An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems

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.