Scheduling DAGs on asynchronous processors

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 35-45

  Bender, Michael A ^a   Phillips, Cynthia A ^b  

^a Stony Brook University   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Asynchronous parallel computing; Firing squad scheduling; Online scheduling; Precedence constrained scheduling

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ONLINE SYSTEMS; PROBABILITY; SCHEDULING;

ASYNCHRONOUS PARALLEL COMPUTING; FIRING-SQUAD SCHEDULING; ONLINE SCHEDULING; PRECEDENCE-CONSTRAINED SCHEDULING;

PROGRAM PROCESSORS;

EID: 35248880573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248384     Document Type: Conference Paper

References (35)

1. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. Seti@home: an experiment in public-resource computing. Commun. ACM, 45(11):56-61, 2002.
2. Y. Aumann, M. A. Bender, and L. Zhang. Efficient execution of nondeterministic parallel programs on asynchronous systems. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 270-276, 1996.
3. Y. Aumann, M. A. Bender, and L. Zhang. Efficient execution of nondeterministic parallel programs on asynchronous systems. Information and Computation, 139(1):1-16, 25 Nov. 1997.
4. Y. Aumann, Z. M. Kedem, K. V. Palem, and M. O. R.abin. Highly efficient asynchronous execution of large-grained parallel programs. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 271-280, 1993.
5. Y. Aumann and M. O. Rabin. Clock construction in fully asynchronous parallel systems and pram simulation. Theoretical Computer Science, 128:3-30, 1994.
6. A. Baratloo, P. Dasgupta, V. Karamcheti, and Z. M. Kedem. Metacomputing with milan. In Proceedings of the Eighth Heterogeneous Computing Workshop (HCW), page 169, 1999.
7. A. Baratloo, P. Dasgupta, and Z. M. Kedem. Calypso: A novel software system for fault-tolerant parallel processing on distributed platforms. In Proceedings of the 4th International Symposium on High Performance Distributed Computing (HPDC), pages 122-129, 1995.
8. A. Baratloo, M. Karaul, Z. M. Kedem, and P. Wijckoff. Charlotte: metacomputing on the web. 9th International Conference on Parallel and Distributed Computing Systems (PDCS), 1996.
9. M. A. Bender and M. O. Rabin. Scheduling Cilk multithreaded computations on processors of different speeds. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 13-21, July 2000.
10. M. A. Bender and M. O. Rabin. Online scheduling of parallel programs on heterogeneous systems with applications to Cilk. Theory of Computing Systems Special Issue on SPAA00, 35:289-304, 2002.
11. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 356-368, Santa Fe, New Mexico, Nov. 1994.
12. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, April 1974.
13. C. Chekuri and M. A. Bender. An efficient approximation algorithm for minimizing makespan on uniformly related machines. In Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 1412, pages 383-393, 1998.
14. C. Chekuri and M. A. Bender. An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms, 41:212-224, 2001.
15. F. A. Chudak and D. B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds (extended abstract). In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 581-590, New Orleans, Louisiana, 5-7 Jan. 1997.
16. F. A. Chudak and D. B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms, 30(2):323-343, February 1999.
17. R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proc. of the ACM Symposium on Parallel Architectures and Algorithms, pages 85-94, 1989.
18. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115-128, 1997.
19. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (PLDI), pages 212-223, 1998.
20. P. B. Gibbons. A more practical PRAM model. In Proc. of the 1st ACM Symposium on Parallel Architectures and Algorithms, pages 158-168, June 1989.
21. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416-429, Mar. 1969.
22. J. M. Jaffe. An analysis of preemptive multiprocessor job scheduling. Mathematics of Operations Research, 5(3):415-421, Aug. 1980.
23. J. M. Jaffe. Efficient scheduling of tasks without full use of processor resources. Theoretical Computer Science, 12:1-17, Aug. 1980.
24. P. C. Kanellakis and A. A. Shvartsman. Efficient parallel algorithms can be made robust. Distributed Computing, 5(4):201-217, 1992.
25. Z. M. Kedem, K. V. Palem, M. O. Rabin, and A. Raghunathan. Efficient program transformation for resilient parallel computation via randomization. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), pages 306-317, May 1992.
26. Z. M. Kedem, K. V. Palem, A. Raghunathan, and P. G. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the 23rd Annual A CM Symposium on Theory of Computing (STOC), pages 381-390, May 1991.
27. Z. M. Kedem, K. V. Palem, and P. G. Spirakis. Efficient robust parallel computations. In Proceedings of the 22rd Annual ACM Symposium on Theory of Computing (STOC), pages 138-148, May 1990.
28. S. C. Kontogiannis, G. E. Pantziou, P. G. Spirakis, and M. Yung. Robust parallel computations through randomization. Theory of Computing Systems, 33(5/6):427-464, 2000.
29. G. Malewicz. Parallel scheduling of complex dags under uncertainty. In Proceedings of the 17th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), pages 66-75, 2005.
30. C. Martel, A. Park, and R. Subramonian. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), pages 590-599, 1990.
31. M. O. Neary and P. Cappello. Advanced eager scheduling for java-based adaptive parallel computing: Research articles. Concurrency and Computation: Practice and Experience, 17(7-8):797-819, 2005.
32. N. Nishimura. Asynchronous shared memory parallel computation. In Proc. of the 2nd ACM Symposium on Parallel Architectures and Algorithms, pages 76-84, 1990.
33. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput, 26(2):350-368, 1997.
34. A. Srinivasan. Distributions on level-sets with applications to approximation algorithms. In Proceedings of the 42 Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 588-597, 2001.
35. J. Ullman. NP-complete scheduling problems. Journal Computing System Science, 10:384-393, 1975.