SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Work-optimal asynchronous algorithms for shared memory parallel computers
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
Upper time bounds for executing PRAM-programs on the LogP-machine
ICS '95 Proceedings of the 9th international conference on Supercomputing
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
Source Code and Task Graphs in Program Optimization
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
On Linear Schedules of Task Graphs for Generalized LogP-Machines
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Scheduling with Communication Delays and On-Line Disturbances
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Optimization of Parallel Programs on Machines with Expensive Communication
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
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
Asynchronous PRAMs are (almost) as good as synchronous PRAMs
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We consider the problem of scheduling task-graphs to LogP-machines when the execution of the schedule may be delayed. If each time stepin the schedule is delayed with a certain probability, we show that under LogP the expected execution time for a schedule s is at most O(TIME(s)) where TIME(s) is the makespan of the schedule s.