Skip to main content
SpringerLink
Log in

Development and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC

  • Conference paper
  • First Online:
Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 2002)

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

Abstract

This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAM-PVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New implementations of parallel applications tuned for shortest execution time are investigated. They include αβ search, recursive Fibonacci, \( \left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right) \) and finding twin prime numbers in parallel. Various DAC parameters were tuned for specific applications including costs of computing vectors/-subtrees, maximum partitioning levels etc. Moreover, the overhead of DAMPVM/DAC compared to sequential implementations is shown including previously implemented adaptive quadrature integration and image recognition.

Work partially sponsored by the Polish National Grant KBN No. 8T11C 001 17

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Czarnul, P., Tomko, K., Krawczyk, H.: Dynamic Partitioning of the Divide-and-Conquer Scheme with Migration in PVM Environment. In: Recent Advances in Parallel Virtual Machine and Message Passing Interface. Number 131 in Lecture Notes in Computer Science, Springer-Verlag (2001) 174–182 8th European PVM/MPI Users’ Group Meeting, torini/Thera, Greece tember 23–26, 2001, Proceedings

    Chapter  Google Scholar 

  2. Czarnul, P.: Dynamic Process Partitioning and Migration for Irregular Applications, Warsaw, Poland (2002) accepted for International Conference on Parallel Computing in Electrical Engineering PARELEC’2002, http://www.parelec.org

  3. Czarnul, P., Krawczyk, H.: Dynamic Assignment with Process Migration in Distributed Environments. In: Recent Advances in Parallel Virtual Machine and Message Passing Interface. Number 1697 in Lecture Notes in Computer Science (1999) 509–516

    Chapter  Google Scholar 

  4. Czarnul, P., Tomko, K., Krawczyk, H.: A Heuristic Dynamic Load Balancing Algorithm for Meshes. In: Parallel and Distributed Computing and Systems, Proceedings of the IASTED International Conference, Anaheim, CA, USA (2001) 166–171

    Google Scholar 

  5. Erlebach, T.: APRIL 1.0 User Manual, Automatic Parallelization of Divide and Conquer Algorithms. Technische Universitat Munchen, Germany, http://wwwmayr.informatik.tu-muenchen.de/personen/erlebach/aperitif.html. (1995)

    Google Scholar 

  6. Prechelt, L., Hänßgen, S.: Efficient parallel execution of irregular recursive programs. IEEE Transactions on Parallel and Distributed Systems 13 (2002)

    Google Scholar 

  7. R.D. Blumofe, C.F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K.H. Randall, Y. Zhou: Cilk: An efficient multithreaded runtime system. In: Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (1995) 207–216

    Google Scholar 

  8. J. Baldeschwieler, R. Blumofe, E. Brewer: ATLAS: An Infrastructure for Global Computing. In: Proceedings of the Seventh ACM SIGOPS European Workshop on System Support for Worldwide Applications. (1996)

    Google Scholar 

  9. van Nieuwpoort, R.V., Kielmann, T., Bal, H.E.: Satin: Efficient Parallel Divide-and-Conquer in Java. In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference. Number 1900 in LNCS (2000) 690–699

    Google Scholar 

  10. I. Silvestre, J.P., Romke, T.: Programming Frames for the efficient use of parallel systems. Technical Report TR-183-97, Paderborn Center for Parallel Computing (1997)

    Google Scholar 

  11. Piper, A., Prager, R.: Generalized Parallel Programming with Divide-and-Conquer: The Beeblebrox System. Technical Report CUED/F-INFENG/TR132, Cambridge University Engeneering Department (1993) ftp://svr-ftp.eng.cam.ac.uk/pub/reports/ pipertr132.ps.Z.

  12. Brockington, M.: Asynchronous Parallel Game-Tree Search. PhD thesis, Department of Computing Science, University of Alberta, Edmonton, Canada (1998) http://www.cs.ualberta.ca/~games/articles/mgbthesis.ps.gz

    Google Scholar 

  13. Feldmann, R., Mysliwietz, P., Monien, B.: Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. In: Proc. of the 6th ACM Symposium on Parallel Algorithms and Architectures (SPAA’ 94). (1994) 94–103 http://www.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/FMM_StudyingOverheads_1994.ps.Z

  14. Feldmann, R., Mysliwietz, P., Monien, B.: Experiments with a fully distributed chess program system. Heuristic Programming in Artificial Intelligence 3 (1992) 72–87 Ellis Horwood Publishers, ftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-139.ps.Z

    Google Scholar 

  15. Brockington, M.G., Schaeffer, J.: The APHID Parallel alpha-beta Search Algorithm. In: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP’ 96). (1996)

    Google Scholar 

  16. Schaeffer, J.: Search Ideas in Chinook. Games in AI Research (2000) 19–30 http:// www.cs.ualberta.ca/~jonathan/Papers/Papers/searchideas.ps

  17. Mou, Z. G., Hudak, P.: An algebraic model for divide-and-conquer and its parallelism. The Journal of Supercomputing 2 (1988) 257–278

    Article  Google Scholar 

  18. Lo, V., Rajopadhye, S., Telle, J., Zhong, X.: Parallel Divide and Conquer on Meshes. IEEE Transactions on Parallel and Distributed Systems 7 (1996) 1049–1057

    Article  Google Scholar 

  19. Wu, I.: Efficient parallel divide-and-conquer for a class of interconnection topologies. In: Proceedings of the 2nd International Symposium on Algorithms. Number 557 in Lecture Notes in Computer Science, Taipei, Republic of China, Springer-Verlag (1991) 229–240

    Google Scholar 

  20. Verhelst, P.: Chess Tree Search. (http://www.xs4all.nl/~verhelst/chess/search.html)

  21. Geist, A.: Advanced Tutorial on PVM 3.4 New Features and Capabilities (1997) Advanced Tutorial on PVM 3.4 Presented at EuroPVM-MPI’97, http://www.csm.ornl.gov/pvm/EuroPVM97/

  22. Oak Ridge National Laboratory, U.S.A.: (PVM Documentation: Listing of new features found in PVM 3.4 and past PVM versions) http://www.epm.ornl.gov/pvm/changes.html#pvm3.4.0

Download references

Author information

Authors and Affiliations

  1. Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Poland

    Pawel Czarnul

  2. Electrical Engineering and Computer Science, University of Michigan, EECS, 1301 Beal Avenue, Ann Arbor, 48109, MI, USA

    Pawel Czarnul

Authors
  1. Pawel Czarnul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung für Graphische und Parallele Datenverarbeitung (GUP) Institut für Technische Informatik und Telematik, Johannes Kepler Universität Linz, Altenbergstr. 69, 4040, Linz, Austria

    Dieter Kranzlmüller  & Jens Volkert  & 

  2. Computer and Automation Research Institute, MTA SZTAKI, Hungarian Academy of Sciences, Victor Hugo u. 18-22, 1132, Budapest, Hungary

    Peter Kacsuk

  3. Computer Science Department Innovative Computing Laboratory, University of Tennessee, 1122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czarnul, P. (2002). Development and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC. In: Kranzlmüller, D., Volkert, J., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2002. Lecture Notes in Computer Science, vol 2474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45825-5_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-45825-5_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44296-7

  • Online ISBN: 978-3-540-45825-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation