Parallel scheduling of complex dags under uncertainty

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 66-75

  Malewicz, Grzegorz ^a,b  

^a Department of Computer Science   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Algorithms and theory; Combinatorial optimization; Grid computing; Probabilistic failures; Project management; Resource constraints; Scheduling of dags

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; PROBABILITY; PROJECT MANAGEMENT; SCHEDULING;

GRID COMPUTING; PROBABILISTIC CONSTRAINTS; RESOURCE CONSTRAINTS;

PARALLEL PROCESSING SYSTEMS;

EID: 32144443833     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073981     Document Type: Conference Paper

References (35)

1. Annis, J., Zhao, Y., Voeckler, J., Wilde, M., Kent, S., Foster, I.: Applying Chimera Virtual Data Concepts to Cluster Finding in the Sloan Sky Survey. 15th Conference on High Performance Networking and Computing (SC) (2002) 56
2. Cook, S.A.: An observation on time-storage tradeoff. Journal of Computer and System Sciences, Vol. 9 (1974) 308-316
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (2nd Edition). MIT Press (2001)
4. Crescenzi, P., Kann, V. (eds.): A compendium of NP optimization problems, http://www.nada.kth.se/~viggo/wwwcompendium/node173.html
5. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics, Vol. 51 (1950) 161-166
6. Fernandez, A., Armacost, R., Pet-Edwards, J.: Understanding Simulation Solutions to Resource constrained Project Scheduling Problems with Stochastic task Durations. Engineering Management Journal, Vol. 10(4) (1998) 5-13
7. Fernandez, A., Armacost, R.L., Pet-Edwards, J.: A Model for the Resource Constrained Project Scheduling Problem with Stochastic Task Durations. 7th Industrial Engineering Research Conference Proceedings (1998)
8. Foster, I. Kesselman, C. [eds.]: The Grid: Blueprint for a New Computing Infrastructure, 2nd ed. Morgan-Kaufmann, San Francisco, CA (2004)
9. Gao, L., Malewicz, G.: Internet computing of tasks with dependencies using unreliable workers. 8th International Conference on Principles of Distributed Systems (OPODIS) (2004) 315-325
10. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
11. Goel, A., Indyk, P.: Stochastic load balancing and related problems. 40th Annual Symposium on Foundations of Computer Science (FOCS) (1999) 579-586
12. Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 8th ed. McGraw-Hill (2004)
13. Herroelen, W., Leus, R.: Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, Vol. 165(2) (2005) 289-306
14. Hong, J.-W., Kung, H.T.: I/O complexity: the red-blue pebble game. 13th ACM Symposium on Theory of Computing (STOC) (1981) 326-333
15. Hopcroft, J.E., Paul, W., Valiant, L.G.: On time versus space. Journal of the ACM, Vol. 24 (1977) 332-337
16. Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd ed. Springer-Verlag (1990)
17. Johnson, D.S.: The NP-completeness column: An ongoing guide. Journal of Algorithms, Vol. 8(3) (1987) 438-448
18. Kleinberg, J., Rabani, Y., Tardos, E.: Allocating Bandwidth for Bursty Connections. SIAM Journal on Computing, Vol. 30(1) (2000) 191-217
19. Malewicz, G.: Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty. (2005) submitted for publication
20. Malewicz, G., Rosenberg, A.L.: On batch-scheduling dags for Internet-based computing, 11th European Conference on Parallel Processing (Euro-Par) (2005) to appear
21. Malewicz, G., Rosenberg, A., Yurkewych, M.: Toward a Scheduling Theory for Internet-Based Computing. Submitted for publication. Preliminary version: 19th IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2005) 66
22. Microsoft Project 2003 http://www.microsoft.com/office/project/default. asp
23. Mori, M., Tseng, G.: A Resource Constrained Project Scheduling Problem with Reattempt at Failure: A Heuristic Approach. Journal of the Operations Research Society of Japan, Vol. 40(1) (1997) 33-44
24. Narasimhan, M., Ramanujam, J.: A fast approach to computing exact solutions to the resource-constrained scheduling problem. ACM Transactions on Design Automation of Electronic Systems, Vol. 6(4) (2001) 490-500
25. Özdamar, L., Ulusoy, G.: A survey on the resource-constrained project scheduling problem. HE Transactions, Vol. 27 (1995) 574-586
26. Paterson, M.S., Hewitt, C.E.: Comparative schematology. Project MAC Conference on Concurrent Systems and Parallel Computation, ACM Press (1970) 119-127
27. Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, Vol. 131(3) (2003) 651-654
28. Rosenberg, A.L.: On scheduling mesh-structured computations for Internet-based computing. IEEE Transactions on Computers, Vol. 53 (2004) 1176-1186
29. Rosenberg, A.L., Sudborough, I.H.: Bandwidth and pebbling. Computing Vol. 31 (1983) 115-139
30. Rosenberg, A.L., Yurkewych, M.: Guidelines for scheduling some common computation-dags for Internet-based computing. IEEE Transactions on Computers, Vol. 54(4) (2005) 428-438
31. Sarmenta, L.F.G.: Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems, Vol. 18(4) (2002) 561-572
32. Skutella, M., Uetz, M.: Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2001) 589-590
33. Thain, D., Tannenbaum, T., Livny, M.: Distributed Computing in Practice: The Condor Experience. Concurrency and Computation: Practice and Experience (2005) to appear
34. Tseng, C.C., Mori, M., Yajima, Y.: A project scheduling model considering the success probability. Proc. of the Association of Asian Pacific Operational Research Societies (APROS) (1994) 399-406
35. Turnquist, M.A., Nozick, L.K.: Allocating Time and Resources in Project Management Under Uncertainty. 36th Annual Hawaii International Conference on System Sciences (HICSS) (2003) 250c