Christian René Sechting
ABSTRACT
One of the main task of every operating system is the scheduling of processes. A good scheduling algorithm results in reactiveness for a desktop system or ensures that deadlines are not violated in case of an real time operating system. Furthermore scheduling can assure fairness among processes and prioritisation of temporarily important ones. Besides functional requirements, the scheduler is more and more important to ensure non-functional requirements which come more into consideration these days. For example, energy and temperature aware algorithms are required in mobile devices due to restrictions from battery life and missing cooling systems.
- A. Busse, J. H. Schönherr, M. Diener, G. Mühl, and J. Richling. Analyzing resource interdependencies in multi-core architectures to improve scheduling decisions. In ACM, editor, Proceedings of the 28th Annual ACM Symposium on Applied Computing, pages 1595--1602, New York, NY, USA, Mar. 2013. Google Scholar
Digital Library
- J. Corbet, G. Kroah-Hartman, and A. McPherson. Linux kernel development: How fast it is going, who is doing it, what they are doing, and who is sponsoring it: An march 2012 update. The Linux Foundation, Mar. 2012.Google Scholar
- H. Fennel, S. Bunzel, H. Heinecke, J. Bielefeld, S. Fürst, K.-P. Schnelle, W. Grote, N. Maldener, T. Weber, F. Wohlgemuth, et al. Achievements and exploitation of the autosar development partnership. Convergence, 2006: 10, Sept. 2006.Google Scholar
- Y.-C. Wang and K.-J. Lin. Implementing a general real-time scheduling framework in the red-linux real-time kernel. In Real-Time Systems Symposium, 1999. Proceedings. The 20th IEEE, pages 246--255. IEEE, Dec. 1999. Google ScholarDigital Library
Index Terms
- A platform independent scheduler framework
Recommendations
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform
Special Issue on the First Workshop on Declarative Programming for Real-Time and Cyber-Physical Systems (DPRTCPS 2015)The abort-and-restart scheme from the Priority-based Functional Reactive Programming (PFRP) paradigm eliminates the priority inversion problem. This paper is similar by solving the priority inversion problem using the task order restrictions sets of ...
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using {\sc Ilog\ Scheduler} . A new way of calculating lower bounds on the ...
A general distributed scalable grid scheduler for independent tasks
We consider non-preemptively scheduling a bag of independent mixed tasks (hard, firm and soft) in computational grids. Based upon task type, we construct a novel generalized distributed scheduler (GDS) for scheduling tasks with different priorities and ...
Comments