Scheduling Divisible Real-Time Loads on Clusters with Varying Processor Start Times

Authors:
Suriayati Chuprat;Sanjoy Baruah
Affiliations:
-;-
Venue:
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2008

Citing 0
Cited 5

A new algorithm for divisible load scheduling with different processor available times

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
Scheduling real-time divisible loads with advance reservations

Real-Time Systems
Efficient real-time divisible load scheduling

Journal of Parallel and Distributed Computing
Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing
Improving Performance on Data-Intensive Applications Using a Load Balancing Methodology Based on Divisible Load Theory

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become available, we devise exact efficient algorithms to solve two important problems: (i) determine the smallest number of processors needed to complete this job by its deadline; and (ii) given a specific number of processors, determine the earliest completion time for the job on these processors.