Sequential grid computing: Models and computational experiments

INFORMS Journal on Computing

Volumn 23, Issue 2, 2011, Pages 174-188

  Ransbotham, Sam ^a   Murthy, Ishwar ^b   Mitra, Sabyasachi ^c   Narasimhan, Sridhar ^c  

^a BOSTON COLLEGE   (United States)

^b INDIAN INSTITUTE OF MANAGEMENT BANGALORE   (India)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamic programming; Grid computing; Stochastic shortest path

Indexed keywords

EID: 79955786286     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0392     Document Type: Article

References (38)

1. Allahverdi, A., J. Mittenthal. 1995. Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. Eur. J. Oper. Res. 81 (2) 376-387.
2. Andersen, N. T., V. Dobrić. 1987. The central limit theorem for stochastic processes. Ann. Probab. 15 (1) 164-177.
3. Baker, K. R., G. D. Scudder. 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38 (1) 22-36.
4. Balut, S. J. 1973. Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Sci. 19 (11) 1283-1288.
5. Bapna, R., S. Das, R. Garfinkel, J. Stallaert. 2006. A continuous auction model for stochastic grid resource pricing and allocation. Workshop Inform. Tech. Systems (WITS), Milwaukee, Association of Information Systems, Atlanta, 1-6.
6. Bapna, R., S. Das, R. Garfinkel, J. Stallaert. 2008. A market design for grid computing. INFORMS J. Comput. 20 (1) 100-111.
7. Berten, V., J. Goossens, E. Jeannot. 2006. On the distribution of sequential jobs in random brokering for heterogeneous compuational grids. IEEE Trans. Parallel Distrib. Systems 17 (2) 113-124. (Pubitemid 46444796)
8. Bhargava, H. K., S. Sundaresan. 2004. Computing as utility: Managing availability, commitment, and pricing through contingent bid auctions. J. Management Inform. Systems 21 (2) 201-227.
9. Boeres, C., V. E. F. Rebello. 2004. EasyGrid: Towards a framework for the automatic Grid enabling of legacy MPI applications. Concurrency Comput: Practice Experience 16 (5) 425-432.
10. Buyya, R., D. Abramson, J. Giddy, H. Stockinger. 2002. Economic models for resource management and scheduling in grid computing. Concurrency Comput: Practice Experience 14 (13-15) 1507-1542.
11. Cai, X., S. Zhou. 1999. Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs. Oper. Res. 47 (3) 422-437.
12. Chang, K., A. Dasari, H. Madduri, A. Mendoza, J. Mims. 2004. Design of an enablement process for on demand applications. IBM Systems J. 43 (1) 190-203.
13. Deonier, R. C., S. Tavaré, M. S. Waterman. 2005. Computational Genome Analysis: An Introduction. Springer, New York.
14. Donald, J., M. Martonosi. 2006. An efficient, practical parallelization methodology for multicore architecture simulation. IEEE Comput Architecture Lett. 5 (2) 14-17.
15. Eilam, T., K. Appleby, J. Breh, G. Breiter, H. Daur, S. A. Fakhouri, G. D. H. Hunt et al. 2004. Using a utility computing framework to develop utility systems. IBM Systems J. 43 (1) 97-120.
16. Ellisman, M., M. Brady, D. Hart, F.-P. Lin, M. Müller, L. Smarr. 2004. The emerging role of biogrids. Comm. ACM 47 (11) 52-57.
17. Hansen, C., C. Johnson. 2003. Graphics applications for grid computing. IEEE Comput. Graph. Appl. 23 (2) 20-21.
18. Henig, M. I. 1990. Risk criteria in a stochastic knapsack problem. Oper. Res. 38 (5) 820-825.
19. Herbon, A., E. Khmelnitsky, I. Ben-Gal. 2005. Using a pseudostochastic approach for multiple-parts scheduling on an unreliable machine. IIE Trans. 37 (3) 189-199. (Pubitemid 40274545)
20. Joseph, J., M. Ernest, C. Fellenstein. 2004. Evolution of grid computing architecture and grid adoption models. IBM Systems J. 43 (4) 624-645. (Pubitemid 40168073)
21. Karger, D., R. Motwani, G. D. S. Ramkumar. 1997. On approximating the longest path in a graph. Algorithmica 18 (1) 82-98. (Pubitemid 128434419)
22. Kaya, K., C. Aykanat. 2006. Iterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environments. IEEE Trans. Parallel Distrib. Systems 17 (8) 883-896. (Pubitemid 44070155)
23. Kise, H., T. Ibaraki. 1983. On Baluts algorithm and NP-completeness for a chance-constrained scheduling problem. Management Sci. 29 (3) 384-388.
24. Korpela, E., D. Werthimer, D. Anderson, J. Cobb, M. Leboisky 2001. SETI@home-Massively distributed computing for SETI. Comput Sci. Engrg. 3 78-83.
25. Krass, P. 2003. Grid computing. CFO.com (November 17), http://www.cfo.com/article.cfm/3010943.
26. Kumar, S., K. Dutta, V. Mookerjee. 2009. Maximizing business value by optimal assignment of jobs to resources in grid computing. Eur. J. Oper. Res. 194 (3) 856-872.
27. Levitin, G., Y.-S. Dai, H. Ben-Haim. 2006. Reliability and performance of star topology grid service with precedence constraints on subtask execution. IEEE Trans. Reliab. 55 (3) 507-515. (Pubitemid 46547566)
28. Meliksetian, D. S., J.-P. Prost, A. S. Bahl, I. Boutboul, D. P. Currier, S. Fibra, J.-Y. Girard et al. 2004. Design and implementation of an enterprise grid. IBM Systems J. 43 (4) 646-664. (Pubitemid 40168074)
29. Murthy I., S. Sarkar. 1998. Stochastic shortest path problems with piecewise-linear concave utility functions. Management Sci. 44 (11, Part 2) S125-S136. (Pubitemid 128572769)
30. Nikolova, E., J. A. Kelner, M. Brand, M. Mitzenmacher. 2006. Stochastic shortest paths via quasi-convex maximization. Proc. 2006 Eur. Sympos. Algorithms (ESA'06), Zurich. Lecture Notes in Computer Science, Vol. 4168. Springer, Berlin, 552-563. (Pubitemid 44699679)
31. Pinedo, M. L., S. M. Ross. 1980. Scheduling jobs subject to nonhomogeneous Poisson shocks. Management Sci. 26 (12) 1250-1257.
32. Rosenberg, A. L. 2004. On scheduling mesh-structured computations for Internet-based computing. IEEE Trans. Comput. 53 (9) 1176-1186.
33. Shalf, J., E. W. Bethel. 2003. The grid and future visualization system architectures. IEEE Comput. Graph. Appl. 23 (2) 6-9.
34. Sonmez, O. O., A. Gursoy. 2007. A novel economic-based scheduling heuristic for computational grids. Internat. J. High Performance Comput. Appl. 21 (1) 21-29. (Pubitemid 46189366)
35. Stockinger, H. 2006. Grid computing: A critical discussion on business applicability. IEEE Distrib. Systems Online 7 (6) 1-8.
36. van der Aalst, W. M. P., A. Kumar. 2003. XML-based schema definition for support of interorganizational workflow. Inform. Systems Res. 14 (1) 23-46. (Pubitemid 36531430)
37. Venugopal, S., R. Buyya, K. Ramamohanarao. 2006. A taxonomy of data grids for distributed data sharing, management, and processing. ACM Comput. Surv. 38 (1) Article 3.
38. Yu, J., R. Buyya. 2006. A taxonomy of workflow management systems for grid computing. J. Grid Comput. 3 (3-4) 171-200.