Scheduling and buffer sizing of n-synchronous systems: typing of ultimately periodic clocks in lucy-n

Authors:
Louis Mandel;Florence Plateau
Affiliations:
Laboratoire de Recherche en Informatique, Université Paris-Sud 11, France,Laboratoire d'Informatique de l'École Normale Supérieure, INRIA, France;Laboratoire de Recherche en Informatique, Université Paris-Sud 11, France,Laboratoire d'Informatique de l'École Normale Supérieure, INRIA, France
Venue:
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Year:
2012

Citing 15
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
LUSTRE: a declarative language for real-time programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synchronous Kahn networks

Proceedings of the first ACM SIGPLAN international conference on Functional programming
StreamIt: A Language for Streaming Applications

CC '02 Proceedings of the 11th International Conference on Compiler Construction
A new approach to latency insensitive design

Proceedings of the 41st annual Design Automation Conference
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal methods for scheduling of latency-insensitive designs

EURASIP Journal on Embedded Systems
Abstraction of Clocks in Synchronous Data-Flow Systems

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Complete and decidable type inference for GADTs

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Scheduling Synchronous Elastic Designs

ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Lucy-n: a n-synchronous extension of Lustre

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Static scheduling of latency insensitive designs with Lucy-n

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Cycle-static dataflow

IEEE Transactions on Signal Processing
Theory of latency-insensitive design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Scheduling and buffer sizing of n-synchronous systems: typing of ultimately periodic clocks in lucy-n

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction

Scheduling and buffer sizing of n-synchronous systems: typing of ultimately periodic clocks in lucy-n

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

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.