The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors |
| |
Authors: | Sanjoy K. Baruah |
| |
Affiliation: | (1) The University of North Carolina, North Carolina |
| |
Abstract: | The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several identical processors is considered. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Supported in part by the National Science Foundation (Grant Nos. CCR-9988327 and ITR-0082866). Sanjoy Baruah is a professor of Computer Science at the University of North Carolina at Chapel Hill. He received his Ph.D. from the University of Texas at Austin in 1993. His research and teaching interests are in scheduling theory, real-time and safety-critical system design, and resource-allocation and sharing in distributed computing environments. |
| |
Keywords: | non-preemptive scheduling periodic tasks multiprocessor systems earliest-deadline first feasibility analysis |
本文献已被 SpringerLink 等数据库收录! |