research-article

Heuristic Technique for Processor and Link Assignment in Multicomputers

Authors:

S. Wayne Bollinger,

Scott F. MidkiffAuthors Info & Claims

IEEE Transactions on Computers, Volume 40, Issue 3

Pages 325 - 333

https://doi.org/10.1109/12.76410

Published: 01 March 1991 Publication History

Publisher Site

Abstract

A graph-based solution to the mapping problem using the simulated annealing optimization heuristic is developed. An automated two-phase mapping strategy is formulated: process annealing assigns parallel processes to processing nodes, and connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized. To evaluate the quality of generated mappings. cost functions suitable for simulated annealing that accurately quantify communications overhead are derived. Communication efficiency is formulated to measure the quality of assignments when the optimal mapping is unknown. The mapping scheme is implemented using the hypercube as a host architecture, and results for several image graphs are presented.

References

[1]

{1} M. Hannan and J. M. Kurtzberg, "A review of the placement and quadratic assignment problems," SIAM Rev., vol. 14, pp. 324-342, Apr. 1972.

Digital Library

Google Scholar

[2]

{2} S. H. Bokhari, "On the mapping problem," IEEE Trans. Comput., vol. C-30, pp. 207-214, Mar. 1981.

Google Scholar

[3]

{3} R. P. Bianchini, Jr. and J. P. Shen, "Interprocessor traffic scheduling algorithm for multiple-processor networks," IEEE Trans. Comput., vol. C-36, pp. 396-409, Apr. 1987.

Digital Library

Google Scholar

[4]

{4} C. S. Steele, "Placement of communicating processes on multiprocessor networks," California Institute of Technology Comput. Sci. Dep., Tech. Rep. 5184:TR:85, Apr. 1985.

Google Scholar

[5]

{5} S.-Y. Lee and J. K. Aggarwal, "A mapping strategy for parallel processing," IEEE Trans. Comput., vol. C-36, pp. 433-442, Apr. 1987.

Digital Library

Google Scholar

[6]

{6} S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, May 1983.

Crossref

Google Scholar

[7]

{7} S. A. Kravitz and R. A. Rutenbar, "Multiprocessor-based placement by simulated annealing," in Proc. 23rd Design Automat. Conf., June 1986, pp. 567-573.

Digital Library

Google Scholar

[8]

{8} P. Siarry, L. Bergonzi, and G. Dreyfus, "Thermodynamic optimization of block placement," IEEE Trans. Comput.-Aided Design, vol. CAD-6, pp. 211-221, Mar. 1987.

Google Scholar

[9]

{9} J. S. Rose, D. R. Blythe, W. M. Snelgrove, and Z. G. Vranesic, "Fast, high quality VLSI placement on an MIMD multiprocessor," in Proc. IEEE Int. Conf. Comput.-Aided Design, 1986, pp. 42-45.

Google Scholar

[10]

{10} J. Lam and J-M. Delosme, "Logic minimization using simulated annealing," in Proc. IEEE Int. Conf. Comput.-Aided Design, 1986, pp. 348-351.

Google Scholar

[11]

{11} C. L. Seitz, "The Cosmic Cube," Commun. ACM, vol. 28, no. 1, pp. 22-33, Jan. 1985.

Digital Library

Google Scholar

Cited By

View all

Wang YChou JChung I(2021)A Deep Reinforcement Learning Method for Solving Task Mapping Problems with Dynamic Traffic on Parallel SystemsThe International Conference on High Performance Computing in Asia-Pacific Region10.1145/3432261.3432262(1-10)Online publication date: 20-Jan-2021
https://dl.acm.org/doi/10.1145/3432261.3432262
Baicheng YZhang YLimin XYi ZBing WYao S(2019)LPMSWorkshop Proceedings of the 48th International Conference on Parallel Processing10.1145/3339186.3339208(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3339186.3339208
Deveci MDevine KPedretti KTaylor MRajamanickam SÇatalyürek Ü(2019)Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.290004330:9(2018-2032)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1109/TPDS.2019.2900043
Show More Cited By

Index Terms

Heuristic Technique for Processor and Link Assignment in Multicomputers

Recommendations

Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency

The problem of assigning task modules within a hypercube multicomputer with possible link failures is investigated. A concept of indirect optimization is introduced and a function, called communication traffic, is proposed as the objective of ...
A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic ...
Combined routing and scheduling of concurrent communication traffic in hypercube multicomputers
ICDCS '96: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

We propose and evaluate low-complexity, low-overhead schemes for distributed message scheduling and routing in binary hypercube multicomputers equipped with a hardware communication adapter at each node. The goal is to optimize the network performance ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 40, Issue 3

March 1991

133 pages

ISSN:0018-9340

Editor:
Earl Swartzlander
Univ. of Texas at Austin, Austin

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 March 1991

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang YChou JChung I(2021)A Deep Reinforcement Learning Method for Solving Task Mapping Problems with Dynamic Traffic on Parallel SystemsThe International Conference on High Performance Computing in Asia-Pacific Region10.1145/3432261.3432262(1-10)Online publication date: 20-Jan-2021
https://dl.acm.org/doi/10.1145/3432261.3432262
Baicheng YZhang YLimin XYi ZBing WYao S(2019)LPMSWorkshop Proceedings of the 48th International Conference on Parallel Processing10.1145/3339186.3339208(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3339186.3339208
Deveci MDevine KPedretti KTaylor MRajamanickam SÇatalyürek Ü(2019)Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.290004330:9(2018-2032)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1109/TPDS.2019.2900043
Zhou AGong YHe BZhai JMohr BRaghavan P(2017)Efficient process mapping in geo-distributed cloud data centersProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3126908.3126913(1-12)Online publication date: 12-Nov-2017
https://dl.acm.org/doi/10.1145/3126908.3126913
Sankaran RAngel JBrown W(2015)Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applicationsConcurrency and Computation: Practice & Experience10.1002/cpe.345727:17(4763-4783)Online publication date: 10-Dec-2015
https://dl.acm.org/doi/10.1002/cpe.3457
Orsila HSalminen EHämäläinen T(2013)Recommendations for using Simulated Annealing in task mappingDesign Automation for Embedded Systems10.1007/s10617-013-9119-017:1(53-85)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s10617-013-9119-0
Subramoni HPotluri SKandalla KBarth BVienne JKeasler JTomko KSchulz KMoody APanda DHollingsworth J(2012)Design of a scalable InfiniBand topology service to enable network-topology-aware placement of processesProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.5555/2388996.2389091(1-12)Online publication date: 10-Nov-2012
https://dl.acm.org/doi/10.5555/2388996.2389091
Gottschling PHoefler T(2012)Productive Parallel Linear Algebra Programming with Unstructured Topology AdaptionProceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)10.1109/CCGrid.2012.51(9-16)Online publication date: 13-May-2012
https://dl.acm.org/doi/10.1109/CCGrid.2012.51
Althaus ENaujoks RThaden E(2011)A column generation approach to scheduling of periodic tasksProceedings of the 10th international conference on Experimental algorithms10.5555/2008623.2008654(340-351)Online publication date: 5-May-2011
https://dl.acm.org/doi/10.5555/2008623.2008654
Hoefler TSnir MLowenthal Dde Supinski BMcKee S(2011)Generic topology mapping strategies for large-scale parallel architecturesProceedings of the international conference on Supercomputing10.1145/1995896.1995909(75-84)Online publication date: 31-May-2011
https://dl.acm.org/doi/10.1145/1995896.1995909
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency

A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks

Combined routing and scheduling of concurrent communication traffic in hypercube multicomputers

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations