Efficient loop-level parallelism in Ada
TRI-Ada '91 Proceedings of the conference on TRI-Ada '91: today's accomplishments; tomorrow's expectations
Reducers and other Cilk++ hyperobjects
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Parallelism generics for Ada 2005 and beyond
Proceedings of the ACM SIGAda annual international conference on SIGAda
Design and implementation of a Ravenscar extension for multiprocessors
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
A parallel programming model for ada
SIGAda '11 Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming language
Real-time programming on accelerator many-core processors
Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
| Hi-index | 0.00 |
Parallel programming is expected to become more the norm as multi-core and many-core processors gain more widespread use. Ada has always had excellent concurrency support, but could be improved in the area of parallel programming. Specifically, divide and conquer parallelism via parallel loops and subprograms are difficult to write without some sort of library support. In this paper we describe a proposal that combines the use of task pools and parallelism managers to provide parallelism capabilities to real-time Ada applications, including Ravenscar applications. This work complements the syntax enhancements that we previously proposed, so that together they facilitate the writing of parallel applications.