Next Article in Journal
Predicting Radiological Panel Opinions Using a Panel of Machine Learning Classifiers
Previous Article in Journal
Linear-Time Text Compression by Longest-First Substitution
Algorithms 2009, 2(4), 1449-1472; doi:10.3390/a2041449

Exact and Heuristic Algorithms for Thrift Cyclic Scheduling

Received: 7 October 2009; Accepted: 18 November 2009 / Published: 26 November 2009
Download PDF [306 KB, uploaded 26 November 2009]
Abstract: Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application areas—has recently received considerable attention for the implementation of such embedded systems. A thrift scheduler provides a flexible and compact implementation model for periodic task sets with comparatively small overheads; additionally, it can overcome several of the problems associated with traditional ‘cyclic executives’. However, severe computational difficulties can still arise when designing schedules for non-trivial task sets. This paper is concerned with an optimization version of the offset-assignment problem, in which the objective is to assign task offsets such that the required CPU clock speed is minimized whilst ensuring that task overruns do not occur; it is known that the decision version of this problem is complete for Σ2p. The paper first considers the problemof candidate solution verification—itself strongly coNP-Complete—and a fast, exact algorithm for this problem is proposed; it is shown that for any fixed number of tasks, its execution time is polynomial. The paper then proposes two heuristic algorithms of pseudopolynomial complexity for solving the offset-assignment problem, and considers how redundant choices of offset combinations can be eliminated to help speed up the search. The performance of these algorithms is then experimentally evaluated, before conclusions are drawn.
Keywords: non-preemptive scheduling; offset-assignment; heuristics; complexity non-preemptive scheduling; offset-assignment; heuristics; complexity
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |

MDPI and ACS Style

Short, M.J. Exact and Heuristic Algorithms for Thrift Cyclic Scheduling. Algorithms 2009, 2, 1449-1472.

AMA Style

Short MJ. Exact and Heuristic Algorithms for Thrift Cyclic Scheduling. Algorithms. 2009; 2(4):1449-1472.

Chicago/Turabian Style

Short, Michael J. 2009. "Exact and Heuristic Algorithms for Thrift Cyclic Scheduling." Algorithms 2, no. 4: 1449-1472.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert