DocumentCode :
2231614
Title :
An on-line scheduling and allocation scheme for real-time tasks in 2D meshes
Author :
Seong-Moo Yoo ; Youn, Hee Yong
Author_Institution :
Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
fYear :
1995
fDate :
25-28 Oct 1995
Firstpage :
630
Lastpage :
637
Abstract :
In hard real-time environment scheduling and allocation of sporadic tasks for multiprocessor systems is a challenging problem. In this paper, we propose an on-line scheduling and allocation scheme for real-time tasks which require the exclusive use of submeshes in 2D mesh system. By effectively manipulating the information on allocated or reserved submeshes, the proposed scheme can quickly identify the earliest available time of a free submesh for a newly-arrived task. We employ a preemption approach to reduce the complexity of the search for a feasible schedule. Computer simulation reveals that the proposed scheme significantly improves the system performance by decreasing the number of tasks rejected
Keywords :
computational complexity; multiprocessing systems; processor scheduling; resource allocation; 2D meshes; complexity; computer simulation; earliest available time; hard real-time environment scheduling; multiprocessor systems; online allocation scheme; online scheduling; real-time tasks; sporadic tasks; system performance; Application software; Computer science; Computer simulation; Concurrent computing; High performance computing; Multiprocessing systems; Processor scheduling; Real time systems; System performance; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on
Conference_Location :
San Antonio, TX
ISSN :
1063-6374
Print_ISBN :
0-81867195-5
Type :
conf
DOI :
10.1109/SPDP.1995.530741
Filename :
530741
Link To Document :
بازگشت