Real-Time Job Scheduling in Hypercube Systems

Authors:
O-Hoon Kwon;Jong Kim;Sung Je Hong;Sunggu Lee
Affiliations:
-;-;-;-
Venue:
ICPP '97 Proceedings of the international Conference on Parallel Processing
Year:
1997

Citing 3
Cited 2

A Top-Down Processor Allocation Scheme for Hypercube Computers

IEEE Transactions on Parallel and Distributed Systems
On Job Scheduling on a Hypercube

IEEE Transactions on Parallel and Distributed Systems
Job Scheduling is More Important than Processor Allocation for Hypercube Computers

IEEE Transactions on Parallel and Distributed Systems

On-line scheduling of scalable real-time tasks on multiprocessor systems

Journal of Parallel and Distributed Computing
Improving grid performance through processor allocation considering both speed heterogeneity and resource fragmentation

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the problem of scheduling real-time jobs in a hypercube system and propose a scheduling algorithm. The goals of the proposed scheduling algorithm are to determine whether all jobs can complete their processing before their fixed deadlines in a hypercube system and to find such a schedule. Each job is associated with a computation time, a deadline, and a dimensional requirement. Determining a schedule such that all jobs meet before their respective fixed deadlines in a hypercube system when preemption is not allowed is an NP-complete problem. Hence, we present a heuristic scheduling algorithm for scheduling non-preemptable real-time jobs in a hypercube system. Finally, we evaluate the proposed algorithm using simulation.