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.
- L. Abeni, L. Palopoli, G. Lipari, and J. Walpole. 2002. Analysis of a reservation-based feedback scheduler. In Proceedings of the 23rd IEEE Real-Time Systems Symposium. 71--80. Google Scholar
Digital Library
- K.-E. Årzén, A. Robertsson, D. Henriksson, M. Johansson, H. Hjalmarsson, and K. H. Johansson. 2006. Conclusions of the artist2 roadmap on control of computing systems. SIGBED Rev. 3, 11--20. Google Scholar
Digital Library
- K. W. Batcher and R. A. Walker. 2008. Dynamic round-robin task scheduling to reduce cache misses for embedded systems. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'08). ACM, New York, 260--263. Google Scholar
Digital Library
- U. Brinkschulte and M. Pacher. 2008. A control theory approach to improve the real-time capability of multi-threaded microprocessors. In Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing. 399--404. Google Scholar
Digital Library
- U. Brinkschulte, J. Kreuzinger, M. Pfeffer, and T. Ungerer. 2002. A scheduling technique providing a strict isolation of real-time threads. In Proceedings of the 7th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'02). 334--340.Google Scholar
- P. Brucker. 2007. Scheduling Algorithms. Springer. Google Scholar
Digital Library
- A. Cervin and P. Alriksson. 2006. Optimal on-line scheduling of multiple control tasks: A case study. In Proceedings of the 18th Euromicro Conference on Real-Time Systems. IEEE, 141--150. Google Scholar
Digital Library
- T. Cucinotta, F. Checconi, L. Abeni, and L. Palopoli. 2010a. Self-tuning schedulers for legacy real-time applications. In Proceedings of the 5th European Conference on Computer Systems (EuroSys'10). ACM, New York, 55--68. Google Scholar
Digital Library
- T. Cucinotta, L. Palopoli, L. Abeni, D. Faggioli, and G. Lipari. 2010b. On the integration of application level and resource level qos control for real-time applications. IEEE Trans. Ind. Inf. 6, 4, 479--491.Google Scholar
Cross Ref
- G. F. Franklin, J. D. Powell, and A. Emami-Naeini. 2010. Feedback Control of Dynamic Systems. 6th Ed. Pearson.Google Scholar
- M. R. Guthaus, J. S. Ringenberg, D. Ernst, T. M. Austin, T. Mudge, and R. B. Brown. 2001. Mibench: A free, commercially representative embedded benchmark suite. In Proceedings of the IEEE International Workshop on Workload Characterization. IEEE, 3--14. Google Scholar
Digital Library
- M. Kihl, A. Robertsson, A. Andersson, and B. Wittenmark. 2008. Control-theoretic analysis of admission control mechanisms for web server systems. World Wide Web 11, 1, 93--116. Google Scholar
Digital Library
- M. A. Kjaer, M. Kihl, and A. Robertsson. 2009. Resource allocation and disturbance rejection in web servers using slas and virtualized servers. IEEE Trans. Netw. Serv. Manage. 6, 4, 226--239. Google Scholar
Digital Library
- L. Kleinrock and R. R. Muntz. 1972. Processor sharing queueing models of mixed scheduling disciplines for time shared system. J. ACM 19, 3, 464--482. Google Scholar
Digital Library
- K. Kotecha and A. Shah. 2008. Adaptive scheduling algorithm for real-time operating system. In Proceedings of the IEEE World Congress on Computational Intelligence. 2109--2112.Google Scholar
- D. A. Lawrence, J. Guan, S. Mehta, and L. R. Welch. 2001. Adaptive scheduling via feedback control for dynamic real-time systems. In Proceedings of the IEEE International Conference on Performance, Computing, and Communications. 373--378.Google Scholar
- A. Leva and M. Maggio. 2010. Feedback process scheduling with simple discrete-time control structures. IET Control Theory Appl 4, 11, 2331--2342.Google Scholar
Cross Ref
- D. Lohn, M. Pacher, and U. Brinkschulte. 2011. A generalized model to control the throughput in a processor for real-time applications. In Proceedings of the 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing. 83--88. Google Scholar
Digital Library
- C. Lu, J. A. Stankovic, S. H. Son, and G. Tao. 2002. Feedback control real-time scheduling: Framework, modeling, and algorithms. Real-Time Systems 23, 85--126. Google Scholar
Digital Library
- C. Lu, J. A. Stankovic, G. Tao, and S. H. Son. 1999. Design and evaluation of a feedback control edf scheduling algorithm. In Proceedings of the 20th IEEE Real-Time Systems Symposium (RTSS'99). IEEE, 56. Google Scholar
Digital Library
- L. Palopoli and L. Abeni. 2009. Legacy real-time applications in a reservation-based system. IEEE Trans. Ind. Inf. 5, 3, 220--228.Google Scholar
Cross Ref
- M. Pinedo. 2008. Scheduling Theory, Algorithms, and Systems. 3rd Ed. Springer. Google Scholar
Digital Library
- N. Weiderman and N. Kamenoff. 1992. Hartstone uniprocessor benchmark: Definitions and experiments for real-time systems. Real-Time Syst. 4, 4, 353--382. Google Scholar
Digital Library
- F. Xia, G. Tian, and Y. Sun. 2007. Feedback scheduling: an event-driven paradigm. SIGPLAN Not. 42, 12, 7--14. Google Scholar
Digital Library
- W. Xu, X. Zhu, S. Singhal, and Z. Wang. 2006. Predictive control for dynamic resource allocation in enterprise data centers. In Proceedings of the 10th IEEE Network Operations and Management Symposium. 115--126.Google Scholar
Index Terms
Task scheduling: A control-theoretical viewpoint for a general and flexible solution
Recommendations
Multi-job Associated Task Scheduling Based on Task Duplication and Insertion for Cloud Computing
Wireless Algorithms, Systems, and ApplicationsAbstractThe jobs processed in cloud computing systems may consist of multiple associated tasks which need to be executed under ordering constraints. The tasks of each job are run on different nodes, and communication is required to transfer data between ...
Multi-heuristic list scheduling genetic algorithm for task scheduling
SAC '03: Proceedings of the 2003 ACM symposium on Applied computingScheduling tasks on a multi-processor system involves making a choice as to the order in which several tasks can be executed and assigned to processors. The problem is to find a schedule that will minimize the execution time of a program. Because task ...






Comments