Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
A bridging model for parallel computation
Communications of the ACM
Coordination languages and their significance
Communications of the ACM
A cost calculus for parallel functional programming
Journal of Parallel and Distributed Computing
Scheduling UET-UCT series-parallel graphs on two processors
Theoretical Computer Science
The importance of synchronization structure in parallel program optimization
ICS '97 Proceedings of the 11th international conference on Supercomputing
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Send-Recv Considered Harmful? Myths and Truths about Parallel Programming
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Functional Skeletons for Parallel Coordination
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Mapping unstructured applications into nested parallelism
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
SPC-XML: a structured representation for nested-parallel programming languages
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Extending a hierarchical tiling arrays library to support sparse data partitioning
The Journal of Supercomputing
Hi-index | 0.00 |
Nested-parallel programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, cost estimation or automatic mapping to different architectures. In this work we present a preliminary framework approach to exploit some of these advantages. In our framework we reconstruct an application task graph from a high-level specification, where no scheduling or communication details are yet expressed. The obtained synchronization structure determines which mapping modules or back-ends are used to port the application to an specific platform. The first results obtained with our prototype show that even simple balancing techniques for irregular scientific applications may be easily integrated in this nested-parallel framework, to obtain efficient implementations from high-level and portable specifications. Topic: Parallel and Distributed Computing.