Abstract : Lucy-n is a language for programming networks of processes communicating through bounded buffers. A dedicated type system, termed a clock calculus, automatically computes static schedules of the processes and the sizes of the buffers between them. In this article, we present a new algorithm which solves the subtyping constraints generated by the clock calculus. The advantage of this algorithm is that it finds schedules for tightly coupled systems. Moreover, it does not overestimate the buffer sizes needed and it provides a way to favor either system throughput or buffer size minimization.

Eleventh International Conference on Mathematics of Program Construction , Jun 2012, Madrid, Spain. Eleventh International Conference on Mathematics of Program Construction , 2012, 〈http://babel.ls.fi.upm.es/mpc2012/〉