Sequential Grid Computing: Models and Computational Experiments

References

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