Issue No. 02 - April (1990 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.80146
<p>Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an empty partial schedule, each step of the search extends the current partial schedule by including one of the tasks yet to be scheduled. The heuristic functions used in the algorithm actively direct the search for a feasible schedule, i.e. they help choose the task that extends the current partial schedule. Two scheduling algorithms are evaluated by simulation. To extend the current partial schedule, one of the algorithms considers, at each step of the search, all the tasks that are yet to be scheduled as candidates. The second focuses its attention on a small subset of tasks with the shortest deadlines. The second algorithm is shown to be very effective when the maximum allowable scheduling overhead is fixed. This algorithm is hence appropriate for dynamic scheduling in real-time systems.</p>
Index Termsdeadlines; scheduling algorithms; real-time multiprocessor systems; heuristic functions; worst-case computation times; deadlines; resources requirements; partial schedule; feasible schedule; dynamic scheduling; multiprocessing systems; real-time systems; scheduling
J. Stankovic, K. Ramamritham and P. Shiah, "Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 184-194, 1990.