Abstract
This paper presents an efficient technique for mapping a set of tasks onto a set of heterogeneous processors. The tasks require data communication between them. The system is assumed to be completely heterogeneous, where the processing speeds, memory access speeds, communication latency between processors and the network topology are all considered being non-uniform. Typically, the numbers of tasks are much larger than the number of processor available. The problem of optimal mapping of the tasks to the processors such that the application run -time is minimized is NP-Complete. The searching capabilities of genetics algorithms are utilized to perform the optimal/near optimal mapping.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Heterogeneous Computing: A New Computing Paradigm by Raju D. Venkataramana Department of Computer Science & Engineering, University of South Florida, Tampa
A Heuristic model for task allocation in heterogeneous distributed computing systems: by A. Abdelmageed Elsadek B. Earl Wells, Electrical and Computer Engineering The University of Alabama in Huntsville, Huntsville, AL 35899, U.S.A.
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
Dey, S., Majumder, S. (2002). Task Allocation in Heterogeneous Computing Environment by Genetic Algorithm. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-36385-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00355-7
Online ISBN: 978-3-540-36385-9
eBook Packages: Springer Book Archive