Skip to main content

A Meta-heuristic Approach to Parallel Code Generation

  • Conference paper
  • First Online:
High Performance Computing for Computational Science — VECPAR 2002 (VECPAR 2002)

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

  • 716 Accesses

Abstract

The efficient generation of parallel code for multi-processor environments, is a large and complicated issue. Attempts to address this problem have always resulted in significant input from users. Because of constraints on user knowledge and time, the automation of the process is a promising and practically important research area. In recent years heuristic approaches have been used to capture available knowledge and make it available for the parallelisation process. Here, the introduction of a novel approach of neural network techniques is combined with an expert system technique to enhance the availability of knowledge to aid in the automatic generation of parallel code.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ayguade, E., Garcia, J., Kremer, U., “Tools and techniques for automatic data layout”, Parallel Computing 24 (1998) 557–578

    Article  Google Scholar 

  2. P.H. Corr, P. Milligan and V. Purnell. “A Neural Network Based Tool for Semi-automatic Code Transformation.” In VECPAR’2000. Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing, Springer, Lecture Notes in Computer Science 1981, 2001, pp 142–153, ISBN 3-540-41999-3

    Google Scholar 

  3. P. J. P. McMullan, P. Milligan, P. P. Sage and P. H. Corr. A Knowledge Based Approach to the Parallelisation, Generation and Evaluation of Code for Execution on Parallel Architectures. IEEE Computer Society Press, ISBN 0-8186-7703-1, pp 58–63, 1997

    Google Scholar 

  4. Mansour, N., Fox, G., “Allocating data to distributed memory multiprocessors by genetic algorithms”, Concurrency: Practice and Experience, Vol. 6(6), 485–504(September 1994)

    Article  Google Scholar 

  5. Shenoy, U., Spikant, Y., Bhatkar, V., Kohli S., “Automatic Data Partitioning by Hierarchical Genetic Search”, Parallel Algorithms and Applications, Vol. 14, pp 119–147.

    Google Scholar 

  6. Chrisochoides, N., Mansour, N., Fox, G., “A Comparison of optimisation heuristics for the data mapping problem”, Concurrency: Practice and Experience, Vol. 9(5), 319–343 (May 1997)

    Article  Google Scholar 

  7. McCollum B.G.C., Milligan P. and Corr P.H., “The Structure and Exploitation of Available Knowledge for Enhanced Data Distribution in a Parallel Environment”, Software and Hardware Engineering for the 21st Century, Ed. N. E. Mastorakis, World Scientific and Engineering Society Press, 1999, pp139–145, ISBN 960 8052-06-8

    Google Scholar 

  8. K. Kennedy and U. Kremer,“ Automatic Data Alignment and Distribution for Loosely Synchronous Problems in an Interactive Programming Environment. Technical Report COMP TR91-155, Rice University, April 1991.

    Google Scholar 

  9. K. Knobe, J. Lukas and G. Steele, “Data Optimisation: Allocation of arrays to reduce communication on SIMD Machines”, Journal of Parallel and Distributed Computing 8, 102–118 (1990)

    Article  Google Scholar 

  10. Z. Shen, Z. Li and P. C. Yew, “An Empirical Study of Fortran Programs for Parallelising Compilers”, Technical Report 983, Centre for Supercomputing research and Development.

    Google Scholar 

  11. A. Dierstein, R. Hayer and T. Rauber, “Automatic Data Distribution and Parallelization. Paralel Programming 1995

    Google Scholar 

  12. U. Banerjee “Loop Transformations for Restructuring Compilers”, Macmillan College Publishing Company, 1992

    Google Scholar 

  13. J. Dongara, “Atest Suite for Parallelising Compilers: Description and Example Results”, Parallel Computing, 17, pp 1247–1255, 1991.

    Article  Google Scholar 

  14. S Haykin “Neural Networks A Comprehensive Foundation” Macmillan College Publishing Company, Inc. 1994.

    Google Scholar 

  15. T. Kohonen, “ The Self-Organising Map”, Procedures of the IEEE, vol.78, pp 1464–1480, 1990

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McCollum, B., Corr, P.H., Milligan, P. (2003). A Meta-heuristic Approach to Parallel Code Generation. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds) High Performance Computing for Computational Science — VECPAR 2002. VECPAR 2002. Lecture Notes in Computer Science, vol 2565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36569-9_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-36569-9_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00852-1

  • Online ISBN: 978-3-540-36569-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics