Scheduling and Buffer Sizing of n-Synchronous Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Scheduling and Buffer Sizing of n-Synchronous Systems

(1, 2, 3) , (1, 2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
MandelPlateau-MPC-2012.pdf (358.51 Ko) Télécharger le fichier
Vignette du fichier
mpc12-extended.pdf (422.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01508142 , version 1 (13-04-2017)

Identifiers

  • HAL Id : hal-01508142 , version 1

Cite

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 ({MPC'12}), Jun 2012, Madrid, Spain. ⟨hal-01508142⟩
617 View
168 Download

Share

Gmail Facebook Twitter LinkedIn More