Skip to Main content Skip to Navigation
Conference papers

Scheduling and Buffer Sizing of n-Synchronous Systems: Typing of Ultimately Periodic Clocks in Lucy-n

Louis Mandel 1, 2, 3 Florence Plateau 1, 2, 3
2 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
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.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01508142
Contributor : Timothy Bourke <>
Submitted on : Thursday, April 13, 2017 - 8:16:14 PM
Last modification on : Tuesday, September 22, 2020 - 3:47:21 AM

Files

MandelPlateau-MPC-2012.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01508142, version 1

Collections

Citation

Louis Mandel, Florence Plateau. Scheduling and Buffer Sizing of n-Synchronous Systems: Typing of Ultimately Periodic Clocks in Lucy-n. Eleventh International Conference on Mathematics of Program Construction , Jun 2012, Madrid, Spain. ⟨hal-01508142⟩

Share

Metrics

Record views

898

Files downloads

252