On Scheduling Task-Graphs to LogP-Machines with Disturbances

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.

[1]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[2]  Welf Löwe,et al.  Source Code and Task Graphs in Program Optimization , 2001, HPCN Europe.

[3]  Naomi Nishimura,et al.  Asynchronous shared memory parallel computation , 1990, SPAA '90.

[4]  Welf Löwe,et al.  An Approach to Machine-Independent Parallel Programming , 1994, CONPAR.

[5]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[6]  Denis Trystram,et al.  Scheduling Precedence Task Graphs with Disturbances , 2003, RAIRO Oper. Res..

[7]  Eric Sanlaville,et al.  Scheduling with Communication Delays and On-Line Disturbances , 1999, Euro-Par.

[8]  Welf Löwe,et al.  Upper time bounds for executing PRAM-programs on the LogP-machine , 1995, ICS '95.

[9]  Welf Löwe,et al.  Optimization of Parallel Programs on Machines with Expensive Communication , 1996, Euro-Par, Vol. II.

[10]  Welf Löwe,et al.  On Linear Schedules of Task Graphs for Generalized LogP-Machines , 1997, Euro-Par.

[11]  D. K. Arvind,et al.  Detection of Concurrency-Related Errors in Joyce , 1992, CONPAR.

[12]  Phillip B. Gibbons.  A more practical PRAM model , 1989, SPAA '89.

[13]  Richard Cole,et al.  The APRAM: incorporating asynchrony into the PRAM model , 1989, SPAA '89.

[14]  Charles U. Martel,et al.  Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers , 1992, SIAM J. Comput..

[15]  Beniamino Di Martino,et al.  Parallelization of Non-Simultaneous Iterative Methods for Systems of Linear Equations , 1994, CONPAR.

[16]  Richard Cole,et al.  The expected advantage of asynchrony , 1990, SPAA '90.

[17]  Tao Yang,et al.  On the Granularity and Clustering of Directed Acyclic Task Graphs , 1993, IEEE Trans. Parallel Distributed Syst..

[18]  R. Subramonian,et al.  Asynchronous PRAMs are (almost) as good as synchronous PRAMs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.