Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Conference on Parallel Processing

Euro-Par 2012: Euro-Par 2012 Parallel Processing pp 141–154Cite as

  1. Home
  2. Euro-Par 2012 Parallel Processing
  3. Conference paper
Dynamic Distributed Scheduling Algorithm for State Space Search

Dynamic Distributed Scheduling Algorithm for State Space Search

  • Ankur Narang19,
  • Abhinav Srivastava19,
  • Ramnik Jain19 &
  • …
  • R. K. Shyamasundar20 
  • Conference paper
  • 2987 Accesses

  • 5 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7484)

Abstract

Petascale computing requires complex runtime systems that need to consider load balancing along with low time and message complexity for scheduling massive scale parallel computations. Simultaneous consideration of these objectives makes online distributed scheduling a very challenging problem. For state space search applications such as UTS, NQueens, Balanced Tree Search, SAT and others, the computations are highly irregular and data dependent. Here, prior scheduling approaches such as [16], [14], [7], HotSLAW [10], which are dominantly locality-aware work-stealing driven, could lead to low parallel efficiency and scalability along with potentially high stack memory usage.

In this paper we present a novel distributed scheduling algorithm (LDSS) for multi-place parallel computations, that uses an unique combination of d-choice randomized remote (inter-place) spawns and topology-aware randomized remote work steals to reduce the overheads in the scheduler and dynamically maintain load balance across the compute nodes of the system. Our design was implemented using GASNet API and POSIX threads. For the UTS (Unbalanced Tree Search) benchmark (using upto 4096 nodes of Blue Gene/P), we deliver the best parallel efficiency (92%) for 295B node binomial tree, better than [16] (87%) and demonstrate super-linear speedup on 1 Trillion node (largest studied so far) geometric tree along with higher tree node processing rate. We also deliver upto 40% better performance than Charm++. Further, our memory utilization is lower compared to HotSLAW. Moreover, for NQueens (N = 18), we demonstrate superior parallel efficiency (92%) as compared Charm++ (85%).

Keywords

  • Load Balance
  • Active Message
  • Binomial Tree
  • Strong Scalability
  • Schedule Overhead

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Acar, U.A., Blelloch, G.E., Blumofe, R.D.: The data locality of work stealing. In: SPAA, New York, NY, USA, pp. 1–12 (December 2000)

    Google Scholar 

  2. Arora, N.S., Blumofe, R.D., Plaxton, C.G.: Thread scheduling for multiprogrammed multiprocessors. In: SPAA, Puerto Vallarta, Mexico, pp. 119–129 (1998)

    Google Scholar 

  3. Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720–748 (1999)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Blumofe, R.D., Lisiecki, P.A.: Adaptive and reliable parallel computing on networks of workstations. In: USENIX Annual Technical Conference, Anaheim, California (1997)

    Google Scholar 

  5. Dinan, J., Krishnamoorthy, S., Larkins, D.B., Nieplocha, J., Sadayappan, P.: A framework for global-view task parallelism. In: Proceedings of the 37th Intl. Conference on Parallel Processing, ICPP (2008)

    Google Scholar 

  6. Guo, Y., Zhao, J., Cave, V., Sarkar, V.: Slaw: A scalable localityaware adaptive work-stealing scheduler. In: IPDPS, pp. 1–12 (2010)

    Google Scholar 

  7. Dinan, J., Larkins, D.B., Sadayappan, P., Krishnamoorthy, S., Nieplocha, J.: Scalable work stealing. In: SC, Oregon, USA (November 2009)

    Google Scholar 

  8. Kalé, L.: An almost perfect heuristic or the n-queens problem. Information Processing Letters 34, 173–178 (1990)

    CrossRef  MATH  Google Scholar 

  9. Ravichandran, K., Lee, S., Pande, S.: Work Stealing for Multi-core HPC Clusters. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part I. LNCS, vol. 6852, pp. 205–217. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  10. Min, S.-J., Iancu, C., Yelick, K.: Hierarchical work stealing on manycore clusters. In: PGAS 2011: Fifth Conference on Partitioned Global Address Space Programming Models. ACM (October 2011)

    Google Scholar 

  11. Mitzenmacher, M.: The Power of Two Choices in Randomized Load Balancing. PhD in computer science. Harvard University (1991)

    Google Scholar 

  12. Pearl, J.: Heuristics-Intelligent Search Strategies for Computer Problem Solving. Addison Wesley (1984)

    Google Scholar 

  13. Shu, W., Kale, L.: A dynamic scheduling strategy for the chare-kernel system. In: ACM/IEEE Conference on Supercomputing (Supercomputing 1989), New York, USA, pp. 389–398 (1989)

    Google Scholar 

  14. Oliver, S., Prins, J.: Scalable dynamic load balancing using UPC. In: ICPP, Oregon, USA (September 2008)

    Google Scholar 

  15. Sun, Y., Zheng, G., Jetley, P., Kale, L.V.: An adaptive framework for large-scale state space search. In: IPDPS Workshop, Alaska, USA, pp. 1798–1805 (2011)

    Google Scholar 

  16. Saraswat, V., Grove, D., Kambadur, P., Kodali, S., Krisnamoorthy, S.: Lifeline based global load balancing. In: PPOPP, Texas, USA (February 2011)

    Google Scholar 

  17. Wah, B.W., Li, G., Yu, C.F.: Multiprocessing of combinatorial search problems. IEEE Computer 18, 93–108 (1985)

    CrossRef  Google Scholar 

  18. Zheng, G., Meneses, E., Bhatele, A., Kale, L.V.: Hierarchical load balancing for charm++ applications on large supercomputers. In: 39th International Conference on Parallel Processing Workshops, ICPPW, pp. 436–444. IEEE Computer Society, Washington, DC (2010)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM India Research Laboratory, New Delhi, India

    Ankur Narang, Abhinav Srivastava & Ramnik Jain

  2. Tata Institute of Fundamental Research, Mumbai, India

    R. K. Shyamasundar

Authors
  1. Ankur Narang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhinav Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramnik Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. K. Shyamasundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Patras, Computer Technology Institute and Press “Diophantus”,, N. Kazantzaki, 26504, Rio, Greece

    Christos Kaklamanis

  2. University of Patras, University Building B, 26504, Rio, Greece

    Theodore Papatheodorou

  3. Computer Technology Institute and Press “Diophantus”, University of Patras, N. Kazantzaki, 26504, Rio, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narang, A., Srivastava, A., Jain, R., Shyamasundar, R.K. (2012). Dynamic Distributed Scheduling Algorithm for State Space Search. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_16

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-32820-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32819-0

  • Online ISBN: 978-3-642-32820-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature