Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
A bridging model for parallel computation
Communications of the ACM
Optimal reduction of two-terminal directed acyclic graphs
SIAM Journal on Computing
Implementation of a portable nested data-parallel language
Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
Automatic scalability analysis of parallel programs based on modeling techniques
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
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
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
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)
Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
TGEX: a Tool for Portable Parallel and Distributed Execution of Unstructured Problems
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
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
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
Static Scheduling Using Task Replication for LogP and BSP Models
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Dynamic Algorithms for Graphs with Treewidth 2
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Optimization by Redundancy Using an Extended LogP Model
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Low-Cost Static Performance Prediction of Parallel Stochastic Task Compositions
IEEE Transactions on Parallel and Distributed Systems
MPI Microtask for programming the cell broadband engineTM processor
IBM Systems Journal
Assessing the computational benefits of AREA-oriented DAG-scheduling
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
A preliminary nested-parallel framework to efficiently implement scientific applications
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Hi-index | 0.00 |
Nested parallel programming models, where the task graph associated to a computation is series-parallel are easy to program and show good analysis properties. These can be exploited for efficient scheduling, accurate cost estimation or automatic mapping to different architectures. Restricting synchronization structures to nested series-parallelism may bring performance losses due to a less parallel solution, as compared to more generic ones based in unstructured models (e.g. message passing). A new algorithmic technique is presented which allows automatic transformation of the task graph of any unstructured application to a series-parallel form (nested-parallelism). The tool is applied to random and irregular application task graphs to investigate the potential performance degradation when conveying them into series-parallel form. Results show that a wide range of irregular applications can be expressed using a structured coordination model with a small loss of parallelism.