Abstract
We consider the task allocation problem for a homogeneous, multiprogrammed MIMD multicomputer system. Programs arrive in a Poisson stream, and are given as so-called phase graphs. Each phase is described by a task interaction graph. We propose an O(n 2) heuristic allocation algorithm where n is the number of tasks. The algorithm has two parts, the first independent of, the second dependent on the topology of the multicomputer. The first part performs a linear hierarchic clustering of the tasks which is used by the second part to map clusters of suitable size onto free parts of the processor graph. The algorithm is evaluated by simulation for a binary tree topology.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Antonelli,S.; Baiardi,F.; Pelagatti,S.; Vanneschi,M.: A Static Approach to Process Mapping in Massively Parallel Systems. Parallel Processing (1988) pp.319–332.
Baxter,J.; Patel,J.H.: The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm. Proc. 1989 Int. Conf. on Parallel Processing, pp.II-217–II-222.
Bokhari, S.H.: Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE TOC Vol.37, 1 (Jan. 1988), pp. 48–57.
Boillat, J.E.; Kropf,P.G.: A Fas Distributed Mapping Algorithm. CONPAR 90, pp.405–416.
Chern,M.-S.; Chen,G.H.; Liu,P.: An LC Branch-and-Bound Algorithm for the Module Assignment Problem. Information Processing Letters 32 (1989) pp.61–71.
Coffman,E.G.: Computer and Job-Shop-Scheduling Theory. John Wiley & Sons, New York, 1976.
Dussa,K.; Carlson,B.; Dowdy,L.; Park,K.-H.: Dynamic Partitioning in a Transputer Environment. ACM SIGMETRICS Conf. 1990, pp.203–213.
Ercal,F.; Ramanujam,J.; Sadayappan,P.: Task Allocation onto a Hypercube by Recursive Bipartitioning. Journal of Parallel and Distributed Computing 10 (1990) pp.35–44.
Garey,M.R.; Johnson,D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979).
Gulati, S.; Iyengar,S.S.; Barhen,J.: The Pebble Crunching Model for Faulttolerant Load Balancing in Hypercube Ensembles. The Computer Journal 33,3 (1990) pp. 204–214.
Heiss, H.-U.: Classification of Task Assignment Problems in Parallel Systems. Internal Report No. 7/91, Faculty for Informatics, University of Karlsruhe, June 1991.
Kim,J.; Das.C.R.; Lin,W.: A Processor Allocation Scheme for Hypercube Computers. Proc. 1989 Int. Conf. on Parallel Processing, pp.II-231–II-238.
Krämer,O.; Mühlenbein,H.: Mapping Strategies in Message-Based Multiprocessor Systems. Parallel Computing 9 (1988/89), pp. 213–225.
Lo, V.M.: Heuristic Algorithms for Task Assignment in Distributed Systems. IEEE TOC Vol.37, No.11 (Nov. 1988) pp. 1384–1397.
Sadayappan,P.; Ercal,F.; Ramanujam,J.: Cluster partitioning approaches to mapping parallel programs onto a hypercube. Parallel Computing, Vol.13 (1990), pp. 1–16.
Sevcik,K.: Characterizations of Parallelisms in Applications and Their Use in Scheduling. ACM SIGMETRICS Conf., Berkeley, 1989.
Wiesenfarth, R.: Design and Analysis of a Heuristic Algorithm for Dynamic Process Allocation in Highly Parallel Systems. Diploma thesis, University of Karlsruhe, Faculty for Informatics, 1990 (in German)
Williams,S.A.: Programming Models for Parallel Systems. John Wiley & Sons, Chichester, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heiss, HU., Wiesenfarth, R. (1992). A heuristic algorithm for dynamic task allocation in highly parallel systems. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_85
Download citation
DOI: https://doi.org/10.1007/3-540-55437-8_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55437-0
Online ISBN: 978-3-540-47073-1
eBook Packages: Springer Book Archive