Evolving toward an Optimal Scheduling Solution through Adaptivity

doi:10.1006/jpdc.2002.1844

Journal of Parallel and Distributed Computing

Volume 62, Issue 7, July 2002, Pages 1203-1222

https://doi.org/10.1006/jpdc.2002.1844 Get rights and content

Abstract

Different users of the same application may have vastly different requirements, and therefore completely different usage patterns of the software. This makes the determination of an efficient distribution of the software tasks across the available processors within the distributed system an extremely difficult problem. This paper presents an adaptive system to automatically allocate tasks to processing nodes based on the past usage statistics of each individual user. The system evolves to a stable and efficient allocation scheme. The rate of evolution of the distribution scheme is determined by a collection of parameters that permits the user to fine tune the system to suit their individual needs.

References (26)

J. Ullman
NP-Complete scheduling problems
J. Comput. System Sci.
(1975)
H. El-Rewini et al.
Scheduling parallel program tasks onto arbitrary target machines
J. Parallel Distrib. Comput.
(1990)
H. El-Rewini et al.
Static scheduling of conditional branches in parallel programs
J. Parallel Distrib. Comput.
(1995)
M.Y. Wu et al.
Hypertool: A programming aid for message-passing systems
IEEE Trans. Parallel Distrib. Systems
(1990)
C.Y. Lee et al.
Multiprocessor scheduling with interprocessor communication delays
Oper. Res. Lett.
(1999)
T. Yang
Scheduling and Code Generation for Parallel Architectures
(1993)
T.L. Casavant et al.
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Trans. Software Eng.
(1988)
H. El-Rewini et al.
Task scheduling in multiprocessing systems
Computer
(1995)
M.J. Oudshoorn et al.
Conditional task scheduling on loosely-coupled distributed processors
10th International Conference on Parallel and Distributed Computing Systems
(1997)
V. Sarkar
Determining average program execution time and their variance
(1989)

W.W. Chu et al.

Task allocation in distributed data processing

Computer

(1980)

F. Harary

Graph Theory

(1969)

Cited by (5)

Scheduling real-time indivisible loads with special resource allocation requirements on cluster computing
2009, IMETI 2009 - 2nd International Multi-Conference on Engineering and Technological Innovation, Proceedings
A distributed evolutionary method to design scheduling policies for Volunteer Computing
2008, Conference on Computing Frontiers - Proceedings of the 2008 Conference on Computing Frontiers, CF'08
EFFICIENT WORKLOAD ALLOCATION TO SCHEDULE TANDEM REAL-TIME TASK GRAPHS IN A CLUSTER COMPUTING ENVIRONMENT
2006, 19th International Conference on Parallel and Distributed Computing Systems 2006, PDCS 2006
Efficient execution of real-time tasks on a single process
2006, Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT
An efficient workload allocation to improve scheduling real-time tasks
2006, Proceedings - IEEE Symposium on Computers and Communications

^f1: [email protected]

View full text

Regular ArticleEvolving toward an Optimal Scheduling Solution through Adaptivity

Abstract

J. Comput. System Sci.

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput.

Hypertool: A programming aid for message-passing systems

IEEE Trans. Parallel Distrib. Systems

Multiprocessor scheduling with interprocessor communication delays

Oper. Res. Lett.

Scheduling and Code Generation for Parallel Architectures

A taxonomy of scheduling in general-purpose distributed computing systems

IEEE Trans. Software Eng.

Task scheduling in multiprocessing systems

Computer

Conditional task scheduling on loosely-coupled distributed processors

10th International Conference on Parallel and Distributed Computing Systems

Determining average program execution time and their variance

Task allocation in distributed data processing

Computer

Graph Theory

Regular Article
Evolving toward an Optimal Scheduling Solution through Adaptivity