Sammanfattning
Abstract in Undetermined
This manuscript presents a new approach to the design of task scheduling algorithms, where system-theoretical methodologies are used throughout. The proposal implies a significant perspective shift with respect to mainstream design practices, but yields large payoffs in terms of simplicity, flexibility, solution uniformity for different problems, and possibility to formally assess the results also in the presence of unpredictable run-time situations. A complete implementation example is illustrated, together with various comparative tests, and a methodological treatise of the matter.
This manuscript presents a new approach to the design of task scheduling algorithms, where system-theoretical methodologies are used throughout. The proposal implies a significant perspective shift with respect to mainstream design practices, but yields large payoffs in terms of simplicity, flexibility, solution uniformity for different problems, and possibility to formally assess the results also in the presence of unpredictable run-time situations. A complete implementation example is illustrated, together with various comparative tests, and a methodological treatise of the matter.
| Originalspråk | engelska |
|---|---|
| Sidor (från-till) | 76-76:22 |
| Tidskrift | ACM Transactions on Embedded Computing Systems |
| Volym | 13 |
| Nummer | 4 |
| DOI | |
| Status | Published - 2014 |
Bibliografisk information
Accepted for publication on May 5, 2012.month=May
Ämnesklassifikation (UKÄ)
- Reglerteknik