Skip to main content
SpringerLink
Log in

An efficient mapping heuristic for mesh-connected parallel architectures based on Mean Field Annealing

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 854))

  • 139 Accesses

Abstract

A new Mean Field Annealing (MFA) formulation is proposed for the mapping problem for mesh-connected architectures. The proposed MFA heuristic exploits the conventional routing scheme used in mesh interconnection topologies to introduce an efficient encoding scheme. An efficient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also developed. Experimental results also show that the proposed MFA heuristic approaches the speed performance of the fast Kernighan-Lin heuristic while approaching the solution quality of the powerful simulated annealing heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bultan, T., and Aykanat, C., “A new mapping heuristic based on mean field annealing”, Journal of Parallel and Distributed Computing, vol. 10, pp. 292–305, 1992.

    Google Scholar 

  2. Bokhari, S.H., “On the mapping problem”, IEEE Trans. Comput., vol. 30, no. 3, pp. 207–214, 1981.

    Google Scholar 

  3. Camp, W.J, Plimpton, S.J, Hendrickson, B.A., and Leland, R.W., “Massively parallel methods for Enineering and Science problem”, Communication of ACM, vol. 37, no. 4, April 1994.

    Google Scholar 

  4. Duff, I.S., and Grius, R.G., “Sparse matrix test problems”, ACM Trans. on Matematical software, vol. 17, no. 1, pp. 1–14, March 1989.

    Google Scholar 

  5. Fiduccia, C. M., and Mattheyses, R. M., “A linear heuristic for improving network partitions”, Proc. Design Automat. Conf., pp. 175–181, 1982.

    Google Scholar 

  6. Hopfield, J. J., and Tank, D. W., “Neural Computation of Decisions in Optimization Problems”, Biolog. Cybern., vol. 52, pp. 141–152, 1985.

    Google Scholar 

  7. Kernighan, B. W., and Lin, S., “An efficient heuristic procedure for partitioning graphs”, Bell Syst. Tech. J., vol. 49, pp. 291–307, 1970.

    Google Scholar 

  8. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., “Optimization by simulated annealing”, Science, vol. 220, pp. 671–680, 1983.

    Google Scholar 

  9. Johnson, A., Aragon, G.R., McGeoch, L.A., and Scheoven, C., “Optimization by simulated annealing”, Operations Research, vol. 37, no. 6, Nov 1989.

    Google Scholar 

  10. Peterson, C., and Anderson, J.R., “Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem”, Complex Syst. vol. 2, pp. 59–89, 1988.

    Google Scholar 

  11. Peterson, C., and Soderberg, B., “A new method for mapping optimization problems onto neural networks”, Int. J. Neural Syst., vol. 3, no. 1, pp. 3–22, 1989.

    Google Scholar 

  12. Van den Bout, D. E., and Miller, T. K. “Improving the performance of the Hopfield-Tank neural network through normalization and annealing”, Biolog. Cybern., vol. 62, pp. 129–139, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept.of Comp. Eng. & Info. Scn., Bilkent University, Ankara, Turkey

    Ismail Haritaoğlu & Cevdet Aykanat

Authors
  1. Ismail Haritaoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cevdet Aykanat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haritaoğlu, I., Aykanat, C. (1994). An efficient mapping heuristic for mesh-connected parallel architectures based on Mean Field Annealing. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation