Non-preemptive scheduling to maximize the minimum global inter-completion time |
| |
Authors: | Carlos C Amaro [Author Vitae] Sanjoy K Baruah [Author Vitae] [Author Vitae] Wolfgang A Halang [Author Vitae] |
| |
Affiliation: | a Lockheed Martin-NESS-SS, 199 Borton Landing Road, Moorestown, NJ 08057-3054, USA b Department of Computer Science, The University of North Carolina, Chapel Hill, NC 27599-3175, USA c The University of Nebraska-Omaha and 21st Century Systems, Inc., 427 South 166th Street, Omaha, NE 68118-2703, USA d Faculty of Electrical Engineering, Fernuniversität, 58084 Hagen, Germany |
| |
Abstract: | Temporal load-balancing—“spreading out” the executions of tasks over time—is desirable in many applications. A form of temporal load-balancing is discussed, scheduling to maximize minimum minimum global inter-completion time (MGICT-scheduling). It is shown that MGICT-scheduling is, in general, NP-hard. A number of restricted classes of task systems are identified, which can be efficiently MGICT-scheduled. The technique is applied to a Defense Network System. Simulation results indicate that the proposed strategy achieves higher communication performance in multiprocessor systems. Specifically, our strategy significantly reduces average message delay and percentage of delayed messages. |
| |
Keywords: | Real-time systems non-preemptive scheduling Multiple processors Resource allocation Load balancing |
本文献已被 ScienceDirect 等数据库收录! |
|