Quasi-static Scheduling for Concurrent Architectures.
Quasi-static Scheduling for Concurrent Architectures.
Summary: 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.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Petri nets, Distributed systems, Performance evaluation, queueing, and scheduling in the context of computer systems
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Petri nets, Distributed systems, Performance evaluation, queueing, and scheduling in the context of computer systems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!