Non-preemptive scheduling to maximize the minimum global inter-completion time

Authors:
Carlos C. Amaro;Sanjoy K. Baruah;Alexander D. Stoyen;Wolfgang A. Halang
Affiliations:
Lockheed Martin-NESS-SS, 199 Borton Landing Road, Moorestown, NJ 08057-3054, USA;Department of Computer Science, The University of North Carolina, Chapel Hill, NC 27599-3175, USA;The University of Nebraska-Omaha and 21st Century Systems, Inc., 427 South 166th Street, Omaha, NE 68118-2703, USA;Faculty of Electrical Engineering, Fernuniversität, 58084 Hagen, Germany
Venue:
Automatica (Journal of IFAC)
Year:
2003

Citing 4
Cited 0

Load balanced mapping of distributed objects to minimize network communication

Journal of Parallel and Distributed Computing
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

IEEE Transactions on Computers
Multiprocessor Scheduling with the Aid of Network Flow Algorithms

IEEE Transactions on Software Engineering
Fast algorithms for bin packing

Journal of Computer and System Sciences

Quantified Score

Hi-index	22.14

Visualization

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.