Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Some efficient solutions to the affine scheduling problem: I. One-dimensional time
International Journal of Parallel Programming
Scheduling outtrees of height one in the LogP model
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Scheduling balanced task-graphs to LogP-machines
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
Iteration Space Tiling for Memory Hierarchies
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
Scheduling Fork Graphs under LogP with an Unbounded Number of Processors
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Parallelization of Non-Simultaneous Iterative Methods for Systems of Linear Equations
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
An Approach to Machine-Independent Parallel Programming
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
On Scheduling Task-Graphs to LogP-Machines with Disturbances
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Hi-index | 0.00 |
We present scheduling techniques considering the source code as well as the task graph of a parallel program. This approach allows to chose the proper scheduling algorithm and to estimate the execution time of the target program. We demonstrate this on stencil computations and their optimizations.