Article

Quasi-Static Scheduling for Concurrent Architectures

Authors:

Jordi Cortadella,

Alex Kondratyev,

Luciano Lavagno,

Yosinori WatanabeAuthors Info & Claims

ACSD '03: Proceedings of the Third International Conference on Application of Concurrency to System Design

Page 29

Published: 18 June 2003 Publication History

Publisher Site

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 de.ne the correctness of the partitioned schedule.

Cited By

View all

Iordache MAntsaklis P(2009)Petri nets and programmingProceedings of the 2009 conference on American Control Conference10.5555/1702715.1703154(4994-4999)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702715.1703154
Cortés LEles PPeng Z(2006)Quasi-static assignment of voltages and optional cycles in imprecise-computation systems with energy considerationsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2006.88415214:10(1117-1129)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1109/TVLSI.2006.884152

Index Terms

Quasi-Static Scheduling for Concurrent Architectures
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Formal software verification
  2. Software organization and properties

Recommendations

Quasi-static Scheduling for Concurrent Architectures
Application of Concurrency to System Design (ACSD'03)

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 ...
Quasi-static Scheduling for Concurrent Architectures
Application of Concurrency to System Design (ACSD'03)

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 ...
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

We describe a new algorithm, called quasi-partitioned scheduling (QPS), capable of scheduling any feasible system composed of independent implicit-deadline sporadic tasks on identical processors. QPS partitions the system tasks into subsets, each of ...

Comments

Information & Contributors

Information

Published In

ACSD '03: Proceedings of the Third International Conference on Application of Concurrency to System Design

June 2003

ISBN:0769518877

Publisher

IEEE Computer Society

United States

Publication History

Published: 18 June 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Iordache MAntsaklis P(2009)Petri nets and programmingProceedings of the 2009 conference on American Control Conference10.5555/1702715.1703154(4994-4999)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702715.1703154
Cortés LEles PPeng Z(2006)Quasi-static assignment of voltages and optional cycles in imprecise-computation systems with energy considerationsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2006.88415214:10(1117-1129)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1109/TVLSI.2006.884152

Abstract

Cited By

Index Terms

Recommendations