Quasi-static Scheduling for Concurrent Architectures

Authors:
Jordi Cortadella;Alex Kondratyev;Luciano Lavagno;Alexander Taubin;Yosinori Watanabe
Affiliations:
Universitat Politècnica de Catalunya, Barcelona, Spain;Cadence Berkeley Labs, Berkeley, USA;Politecnico di Torino, Torino, Italy;Boston University, Boston, USA;Cadence Berkeley Labs, Berkeley, USA
Venue:
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Year:
2004

Citing 12
Cited 0

Communicating sequential processes

Communicating sequential processes
Static scheduling of synchronous data flow programs for digital signal processing

IEEE Transactions on Computers
STATEMATE: A Working Environment for the Development of Complex Reactive Systems

IEEE Transactions on Software Engineering
TTP-A Protocol for Fault-Tolerant Real-Time Systems

Computer
Software synthesis of process-based concurrent programs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Scheduling hardware/software systems using symbolic techniques

CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Synthesis of embedded software using free-choice Petri nets

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
YAPI: application modeling for signal processing systems

Proceedings of the 37th Annual Design Automation Conference
Task generation and compile-time scheduling for mixed data-control embedded software

Proceedings of the 37th Annual Design Automation Conference
Synchronous Programming of Reactive Systems

Synchronous Programming of Reactive Systems
Quasi-Static Scheduling of Independent Tasksfor Reactive Systems

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Scheduling dynamic dataflow graphs with bounded memory using the token flow model

Scheduling dynamic dataflow graphs with bounded memory using the token flow model

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a synthesis approach for reactive systems that aims at minimizing the overhead introduced by the operating system and the interaction among the concurrent tasks, while considering multiple concurrent execution resources. A formal model based on the notion of scheduling of Petri nets is used to perform the synthesis. We show how the notion of projections of a schedule for the complete system onto the components implemented on separate resources is essential to define the correctness of the partitioned schedule.