Title :
An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems
Author :
Andrei, Silaghi ; Cheng, Albert M. K. ; Radulescu, Vlad
Author_Institution :
Dept. of Comput. Sci., Lamar Univ., Beaumont, TX, USA
Abstract :
Given a task set T, finding a feasible schedule for T is one of the most significant problems of real-time embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and multiprocessor platforms. Biomedical systems are increasingly controlled by computers. The present paper describes an efficient algorithm for getting a feasible schedule of a task set T. Our new algorithm is applicable to biomedical systems and it is able to find a feasible schedule even when the traditional EDF and LLF scheduling techniques are not able to find one.
Keywords :
biomedical equipment; embedded systems; medical computing; multiprocessing systems; processor scheduling; biomedical systems; computers; feasible schedule; multiprocessor platforms; nonpreemptive independent tasks; real-time embedded systems; research community; scheduling algorithm; scheduling problem; task set T; traditional EDF scheduling techniques; traditional LLF scheduling techniques; uniprocessor platforms; Computers; Polynomials; Real-time systems; Schedules; Scheduling; Scheduling algorithms; biomedical systems; multiprocessor platform; scheduling algorithm; scheduling problem;
Conference_Titel :
New Circuits and Systems Conference (NEWCAS), 2014 IEEE 12th International
Conference_Location :
Trois-Rivieres, QC
DOI :
10.1109/NEWCAS.2014.6934073
