Skip to main content
Springer Nature Link
Log in

Communication and Computation Overlap through Task Synchronization in Multi-locale Chapel Environment

  • Conference paper
Future Information Technology

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 184))

Abstract

Parallel processing systems use data parallelism to achieve high performance data processing. Data parallelism is normally based on data arrays, which are distributed to separate nodes. Therefore, efficient communication between nodes is required to initialize the distribution. In this paper, we propose a computation and communication overlapping technique to reduce the overhead of communication during array distribution. Our overlapping technique uses task parallelism for the initiate task and the worker tasks, and also the synchronization mechanism supported by Chapel. To show our overlapping technique is effective, we design and develop a parallel version of the Mandelbrot set program, and then evaluate the benefit of overlapping against the execution time of Mandelbrot. From our comparison, the overlapping technique proposed in this paper is effective in that it reduces the impact of communication in the initial array distribution.

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

Access this chapter

Log in via an institution

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
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 106.99
Price includes VAT (Germany)
  • 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

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyingOptions = buybox.querySelectorAll(".buying-option") ;[].slice.call(buyingOptions).forEach(initCollapsibles) var buyboxMaxSingleColumnWidth = 480 function initCollapsibles(subscription, index) { var toggle = subscription.querySelector(".buying-option-price") subscription.classList.remove("expanded") var form = subscription.querySelector(".buying-option-form") var priceInfo = subscription.querySelector(".price-info") var buyingOption = toggle.parentElement if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth <= buyboxMaxSingleColumnWidth && option != buyingOption) { hideBuyingOption(option) } }) var expanded = toggle.getAttribute("aria-expanded") === "true" || false toggle.setAttribute("aria-expanded", !expanded) form.hidden = expanded if (!expanded) { buyingOption.classList.add("expanded") } else { buyingOption.classList.remove("expanded") } priceInfo.hidden = expanded }, false) } } function hideBuyingOption(buyingOption) { var toggle = buyingOption.querySelector(".buying-option-price") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") toggle.setAttribute("aria-expanded", false) form.hidden = true buyingOption.classList.remove("expanded") priceInfo.hidden = true } function initKeyControls() { document.addEventListener("keydown", function (event) { if (document.activeElement.classList.contains("buying-option-price") && (event.code === "Space" || event.code === "Enter")) { if (document.activeElement) { event.preventDefault() document.activeElement.click() } } }, false) } function initialStateOpen() { var buyboxWidth = buybox.offsetWidth ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (buyboxWidth > buyboxMaxSingleColumnWidth) { toggle.click() } else { if (index === 0) { toggle.click() } else { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

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. Diaconescu, R., Zima, H.P.: An approach to data distributions in Chapel. International Journal of High Performance Computing Applications 21(3), 313–335 (2007)

    Article  Google Scholar 

  2. Cray Inc.: Chapel Specification, 0.795 ed. Seattle, WA (April 2010)

    Google Scholar 

  3. Abdelkhalek, R., Calandra, H., Coulaud, O., Roman, J., Latu, G.: Fast Seismic Modeling and Reverse Time Migration on a GPU Cluster. In: International Conference on High Performance Computing & Simulations, Leipzig, pp. 36–43 (2009)

    Google Scholar 

  4. Steven, J.D., Bradford, L.C., Choi, S.-E., David, I.: Five Powerful Chapel Idioms, Cray User Group 2010 (2010)

    Google Scholar 

  5. Chamberlain, B.L., Callahan, D., Zima, H.P.: Parallel programmability and the Chapel language. International Journal of High Performance Computing Applications 21(3), 291–312 (2007)

    Article  Google Scholar 

  6. http://en.wikipedia.org

  7. Chamberlain, B.L., Deitz, S.J., Iten, D., Choi, S.-G.: User-Defined Distributions and Layouts in Chapel: Philosophy and Framework. In: USENIX Workshop on Hot Topics in Parallelism (2010)

    Google Scholar 

  8. Bikshandi, G., Guo, J., Hoeflinger, D.: Programming for Parallelism and Locality with Hierarchically Titled Arrays. In: PPoPP 2006: Proceedings of the Eleventh ACM SIGPLAN Symposium on Pinciples and Practice of Parallel Programming, pp. 48–57. ACM Press, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Chungju National University, 50 Daehak-ro Chungju-si, Chungbuk, 380-702, Republic of Korea

    Bongen Gu & Yoonsik Kwak

  2. Dept. of Computer Science and Software Engineering, Auburn University, Auburn, AL, 36849-5347

    Weikuan Yu

Authors
  1. Bongen Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weikuan Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoonsik Kwak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Seoul National University of Science and Technology, 172 Gongreung 2-dong, Nowon-gu, 139-742, Seoul, Korea

    James J. Park

  2. Department of Computer Science, St. Francis Xavier University, B2G 2W5, Antigonish, NS, Canada

    Laurence T. Yang

  3. Hanshin University, 411 Yangsandong, 447-791, Osan-si, Korea

    Changhoon Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, B., Yu, W., Kwak, Y. (2011). Communication and Computation Overlap through Task Synchronization in Multi-locale Chapel Environment. In: Park, J.J., Yang, L.T., Lee, C. (eds) Future Information Technology. Communications in Computer and Information Science, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22333-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22333-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22332-7

  • Online ISBN: 978-3-642-22333-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics