Skip to main content

Exploring Irregular Reduction Support in Transactional Memory

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2013)

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

Abstract

Transactional memory (TM) has emerged as an alternative to the lock-based parallel programming model offering an effective and optimistic management of concurrency. Recently, TM is being experimented in the context of high performance computing. Many applications in that area spent a large amount of computing time in irregular reduction operations, so their efficient parallelization is of utmost importance. This paper explores how to address irregular reductions in the TM model, analyzing which support needs to be added to the TM system to deal with reductions as a special case of conflicting memory accesses.

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

Access this chapter

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. Ansari, M., Kotselidis, C., Jarvis, K., Luján, M., Kirkham, C., Watson, I.: Advanced concurrency control for transactional memory using transaction commit rate. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 719–728. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Bihari, B.L.: Transactional memory for unstructured mesh simulations. J. Scientific Computing 54(2-3), 311–332 (2013)

    Article  MathSciNet  Google Scholar 

  3. Feautrier, P.: Array expansion. In: 2nd Int’l Conf. on Supercomputing (ICS 1988), pp. 429–441 (1988)

    Google Scholar 

  4. Felber, P., Fetzer, C., Marlier, P., Riegel, T.: Time-based software transactional memory. IEEE Trans. on Parallel and Distributed Systems 21(12), 1793–1807 (2010)

    Article  Google Scholar 

  5. Gutiérrez, E., Plata, O., Zapata, E.: A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors. In: 14th Int. Conf. on Supercomputing (ICS 2000), pp. 78–87 (2000)

    Google Scholar 

  6. Hall, M., Anderson, J., Amarasinghe, S., Murphy, B., Liao, S., Bu, E.: Maximizing multiprocessor performance with the suif compiler. IEEE Computer 29(12), 84–89 (1996)

    Article  Google Scholar 

  7. Han, H., Tseng, C.: Exploiting locality for irregular scientific codes. IEEE Trans. on Parallel and Distributed Systems 17(7), 606–618 (2006)

    Article  Google Scholar 

  8. Harris, T., Larus, J.R., Rajwar, R.: Transactional Memory, 2nd edn. Morgan & Claypool Publishers, USA (2010)

    Google Scholar 

  9. Intel: Intel 64 and IA-32 Architectures Software Developer’s Manual – Volume 3: System Programming Guide. Intel Corporation, Santa Clara, CA, USA (2013)

    Google Scholar 

  10. Jain, T., Agrawal, T.: The Haswell microarchitecture – 4th generation processor. International Journal of Computer Science and Information Technologies 4(3), 477–480 (2013)

    Google Scholar 

  11. Johnson, N.P., Kim, H., Prabhu, P., Zaks, A., August, D.I.: Speculative separation for privatization and reductions. In: 33rd ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI 2012), pp. 359–370 (2012)

    Google Scholar 

  12. Larus, J., Kozyrakis, C.: Transactional memory. Communications of the ACM 51(7), 80–88 (2008)

    Article  Google Scholar 

  13. McDonald, A., Chung, J., Carlstrom, B.D., Minh, C.C., Chafi, H., Kozyrakis, C., Olukotun, K.: Architectural semantics for practical transactional memory. In: 33rd Int’l. Symp. on Computer Architecture (ISCA 2006), pp. 53–65 (2006)

    Google Scholar 

  14. Yu, H., Rauchwerger, L.: An adaptive algorithm selection framework for reduction parallelization. IEEE Trans. on Parallel and Distributed Systems 17(10), 1084–1096 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Gonzalez-Mesa, M.A., Quislant, R., Gutierrez, E., Plata, O. (2013). Exploring Irregular Reduction Support in Transactional Memory. In: Kołodziej, J., Di Martino, B., Talia, D., Xiong, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2013. Lecture Notes in Computer Science, vol 8285. Springer, Cham. https://doi.org/10.1007/978-3-319-03859-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03859-9_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03858-2

  • Online ISBN: 978-3-319-03859-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics