A parallel programming model for ada

Article OPEN
Hazem Ali ; Luís Pinho (2011)

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.
  • References (19)
    19 references, page 1 of 2

    [2] K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, Dec 2006.

    [3] M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the cilk-5 multithreaded language. SIGPLAN Not., 33:212-223, May 1998

    [4] Intel. Thread Building Blocks, http://threadingbuildingblocks.org/. Last access September 2011.

    [5] D. Lea. A java fork/join framework. In Proceedings of the ACM 2000 conference on Java Grande, JAVA '00, pages 36- 43, New York, NY, USA, 2000. ACM.

    [6] A. Marowka. Parallel computing on any desktop. Commun. ACM, 50:74-78, September 2007.

    [7] Microsoft. Task parallel library, http://msdn.microsoft.com/en-us/library/dd460717.aspx. Last access September 2011.

    [8] K. Taura, K. Tabata, and A. Yonezawa. Stackthreads/mp: integrating futures into calling standards. ACM SIGPLAN Notices, 34(8):60-71, 1999.

    [9] B. Moore, “Parallelism generics for Ada 2005 and beyond”, SIGAda'10 Proceedings of the ACM SIGAda annual conference, October 2010.

    [10] R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. J. ACM, 46:720-748, September 1999.

    [11] Moore, B., “A comparison of work-sharing, work-seeking, and work-stealing parallelism strategies using Paraffin with Ada 2005”, Ada User Journal, Vol 32, N. 1, March 2011.

  • Metrics
    No metrics available
Share - Bookmark