Abstract
The task scheduling problem for parallel and distributed systems was extensively studied in the literature. The outcome is a large set of heuristics, each of which generate an output schedule of the given application graph by preserving the task dependency constraints with the objective of minimizing the schedule length. We extend the general task scheduling model with multiple objectives of minimizing the schedule length (for task utilization) and minimizing the number of processors used (for resource utilization). These two objectives are both conflicting and complementary, which are combined into a single objective of cost minimization in our study. In this paper, the task scheduling problem for heterogeneous systems with the unified objective is formulated by a genetic search framework.
Supported by Marmara University Research Fund under the contract number FEN032-2000
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. C. Sih and E. A. Lee, A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures, IEEE Transactions on Parallel and Distributed Systems, vol. 4, pp. 175–186, Feb. 1993.
H. El-Rewini and T. G. Lewis, Scheduling Parallel Program Tasks onto Arbitrary Target Machines, Journal of Parallel and Distributed Computing, vol. 9, pp. 138–153, 1990.
H. Topcuoglu, S. Hariri and M. Wu, Performance Effective and Low-Complexity Task Scheduling for Heterogeneous Computing, IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 260–274, March 2002.
L. Wang, H. J. Siegel, and V. P. Roychowdhury, A Genetic-Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environments, Proc. of Heterogeneous Computing Workshop, 1996.
H. Singh, A. Youssef, Mapping and Scheduling Heterogeneous Task Graphs Using Genetic Algorithms, Proc. of Heterogeneous Computing Workshop, pp. 86–97, 1996.
M. Maheswaran, and H. J. Siegel, A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems, Proc. of Heterogeneous Computing Workshop, pp. 57–69, 1998.
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
Y. Ge and D. Yun, Simultaneous Compression of Makespan and Number of Processors Using CRP, Proc. International Parallel Processing Symposium, pp. 332–338, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Topcuoglu, H., Sevilmis, C. (2002). Task Scheduling with Conflicting Objectives. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive