×

Scheduling and buffer sizing of n-synchronous systems. Typing of ultimately periodic clocks in Lucy-n. (English) Zbl 1358.68041

Gibbons, Jeremy (ed.) et al., Mathematics of program construction. 11th international conference, MPC 2012, Madrid, Spain, June 25–27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31112-3/pbk). Lecture Notes in Computer Science 7342, 74-101 (2012).
Summary: 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.
For the entire collection see [Zbl 1245.68009].

MSC:

68M14 Distributed systems
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68N19 Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

Software:

LUSTRE
PDFBibTeX XMLCite
Full Text: DOI