Task scheduling
Authors:
Open Access
- 10 March 2014
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 13 (4) , 1-22
Abstract
This article 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.Keywords
This publication has 17 references indexed in Scilit:
- Feedback process scheduling with simple discrete-time control structuresIET Control Theory & Applications, 2010
- Resource allocation and disturbance rejection in web servers using SLAs and virtualized serversIEEE Transactions on Network and Service Management, 2009
- Legacy Real-Time Applications in a Reservation-Based SystemIEEE Transactions on Industrial Informatics, 2009
- Adaptive scheduling algorithm for real-time operating system2008
- A Control Theory Approach to Improve the Real-Time Capability of Multi-Threaded Microprocessors2008
- Feedback schedulingACM SIGPLAN Notices, 2007
- Control-theoretic Analysis of Admission Control Mechanisms for Web Server SystemsWorld Wide Web, 2007
- Conclusions of the ARTIST2 roadmap on control of computing systemsACM SIGBED Review, 2006
- Hartstone Uniprocessor Benchmark: Definitions and experiments for real-time systemsReal-Time Systems, 1992
- Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared SystemJournal of the ACM, 1972