Title :
Fast scheduling of periodic tasks on multiple resources
Author :
Baruah, Sanjoy K. ; Gehrke, Johannes E. ; Plaxton, C. Grey
Author_Institution :
Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA
Abstract :
Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(min{mlgn,n}) time per slot scheduled
Keywords :
computational complexity; processor scheduling; scheduling; execution requirement; fast scheduling; identical copies; multiple resources; periodic tasks; AC generators; Character generation; Partial response channels; Polynomials; Processor scheduling; Resource management; Scheduling algorithm;
Conference_Titel :
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7074-6
DOI :
10.1109/IPPS.1995.395946
