Abstract
Computational Grid projects are ushering in an environment where clients make use of resources and services that are far too expensive for single clients to manage or maintain. Clients compose a megaprogram with services offered by outside organizations. However, the benefits of this paradigm come with a loss of control over job execution with added uncertainty about job completion. Current techniques for scheduling distributed services do not simultaneously account for autonomous service providers whose performance, reliability, and cost are not controlled by the service user. We propose an approach to scheduling that compensates for this uncertainty. Our approach builds initial schedules based on cost estimates from service providers and during program execution monitors job progress to determine if future deadlines will be met. This approach enables early hazard detection and facilitates schedule repairs to compensate for delays.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Berman, High Performance Schedulers in Building a Computational Grid, I. Foster and C. Kesselman, editors, Morgan Kaufmann, 1998.
R. Buyya, J. Giddy, D. Abramson, “An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications,” The Second Workshop on Active Middleware Services (AMS 2000), August 1, 2000.
S. Lohr, “I.B.M. Making a Commitment to Next Phase of the Internet” New York Times 2001, http://www.nytimes.com/2001/08/02/technology/02BLUE.html.
D. Marinescu, L. Bölöni, R. Hao, and K. Jun, “An Alternative Model for Scheduling on a Computational Grid,” Proceedings of ISCIS’98, the Thirteenth International Symposium on Computer and Information Sciences, Antalya, pp. 473–480, IOP Press, 1998.
N. Nisan, S. London, O. Regev, and N. Camiel, “Globally distributed computation over the internet-the popcorn project,” In Proceedings for the 18th Int’l Conference on Distributed Computing Systems, 1998.
I. Foster and C. Kesselman, “Globus: A Metacomputing Infrastructure Toolkit,” Proceedings of the Workshop on Environments and Tools for Parallel Scientific Computing, SIAM, Lyon, France, Aug. 1996.
Juno, “Juno Announces Virtual Supercomputer Project,” Juno Press Release, February 1, 2001), http://www.juno.com/corp/news/supercomputer.html.
United Devices “Edge Distributed Computing with the MetaProcessor(TM) Platform,” White paper, 2001, https://www.ud.com/customers/met.pdf.asp.
UDDI, Technical White Paper, September 6, 2000 http://www.uddi.org/pubs/Iru_UDDI_Technical_White_Paper.pdf.
C. Kurt, “UDDI Version 2.0 Operator’s Specification”, UDDI Open Draft Specification 8, June 2001 (Draft K), http://www.uddi.org/pubs/Operators-V2.00-Open-20010608.pdf
M. Stonebraker, R. Devine, M. Kornacker, W. Litwin, A. Pfeffer, A. Sah, and C. Staelin. “An economic paradigm for query processing and data migration in Mariposa,” In Proceedings of the Third International Conference on Parallel and Distributed Information Systems, Austin, TX, September 1994.
Carl Bartlett, Neal Sample, and Matt Haines “Pipeline Expansion in Coordinated Applications”, 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’99), Las Vegas, Nevada, June 28–July 1, 1999.
J. Sidell, “Performance of Adaptive Query Processing in the Mariposa Distributed Database Management System,” unpublished manuscript, June 1997.
W. K. Shih, J. W. S. Liu, and J. Y. Chung. “Algorithms for scheduling imprecise computations with timing constraints,” In Proc. IEEE Real-Time Systems Symposium, 1989.
G. Wiederhold, P. Wegner, S. Ceri, “Towards Megaprogramming”, CACM, Nov.1992.
N. Sample, D. Beringer, L. Melloul and G. Wiederhold, “CLAM: Composition Language for Autonomous Megamodules,” 3rd Int’l Conference on Coordination Models and Languages, Amsterdam, Apr. 1999.
F. Seredynski, P. Bouvry, and F. Arbab, “Parallel and distributed evolutionary computation with Manifold,” In V. Malyshkin, editor, Proceedings of PaCT-97, volume 1277 of Lecture Notes in Computer Science, pages 94–108. Springer-Verlag, September 1997.
F. Arbab, “The IWIM Model for Coordination of Concurrent Activities,” First International Conference on Coordination Models, Languages and Applications (Coordination’96), Cesena, Italy, April 15–17 1996. (Also appears in LNCS 1061, Springer-Verlag, pp. 3456.)
L. Melloul, D. Beringer, N. Sample and G. Wiederhold, “CPAM, A Protocol for Software Composition,” CAiSE’99, Heidelberg, Germany, June 1999 (Springer LNCS).
A. Garvey, K. Decker, and V. Lesser, “A Negotiation-based Interface Between a Real-time Scheduler and a Decision-Maker,” Tech. Rep. 94-08, U. of Massachusetts Department of Computer Science, March 1994.
A. Garvey and V. Lesser. “Design-to-time scheduling with uncertainty,” CS Technical Report 95-03, University of Massachusetts, 1995.
F. Berman, “High-performance schedulers,” The Grid: Blueprint for a New Computing Infrastructure, 1999.
R. Buyya, J. Giddy, D. Abramson, “A Case for Economy Grid Architecture for Service-Oriented Grid Computing,” 10th IEEE International Heterogeneous Computing Workshop (HCW 2001), In conjunction with IPDPS 2001, San Francisco, CA, April 2001.
A. Geppert, M. Kradolfer, and D. Tombros. “Market-Based Workflow Management,” Int’l Journal on Cooperative Information Systems (IJCIS), 7(4):297–314, December 1998.
M.J. Atallah et al, “Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations,” Journal of Parallel and Distributed Computing, Vol. 16, 1992.
High Performance Fortran Forum (HPFF), “HPF Language Specification”, Version 2.0, January 31, 1997.
A. Grimshaw and W. Wulf. “Legion-a View from 50,000 Feet,” Proc. 5th IEEE Symp. on High Performance Distributed Computing, pp. 89–99, IEEE Press, 1996.
N. Sample, C. Bartlett, M. Haines, “Mars: Runtime Support for Coordinated Applications,” Proceedings of the ACM Symposium on Applied Computing, San Antonio, TX, February 28–March 2, 1999.
P. Lawrence, editor, Workflow handbook 1997, John Wiley 1997.
H. Pozewaunig, J. Eder, and W. Liebhart. “ePERT: Extending PERT for Workflow Management Systems,” In First EastEuropean Symposium on Advances in Database and Information Systems ADBIS’ 97, St. Petersburg, Russia, September 1997.
J. Eder, E. Panagos, H. Pezewaunig, and M. Rabinovich, “Time Management in Workflow Systems,” In 3rd Int. Conf. on Business Information Systems, 1999.
J. Doyle, “Reasoned assumptions and Pareto optimality,” Proc. Ninth International Joint Conference on Artificial Intelligence, 1985.
T. Anderson, D. Culler, and D. Patterson, “A Case for Networks of Workstations: NOW,” IEEE Micro, February 1995.
R. G. Smith, “The CONTRACT NET: A formalism for the control of distributed problem solving,” In Proceedings of the 5th Intl. Joint Conference on Artificial Intelligence (IJCAI-77), Cambridge, MA, 1977.
R. Balzer and K. Narayanaswamy, “Mechanisms for generic process support,” In Proc. First ACM SIGSOFT Symp. Foundations Software Engineering, pages 21–32. ACM Software Engineering Notes, Vol. 18(5), December 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sample, N., Keyani, P., Wiederhold, G. (2002). Scheduling under Uncertainty: Planning for the Ubiquitous Grid. In: Arbab, F., Talcott, C. (eds) Coordination Models and Languages. COORDINATION 2002. Lecture Notes in Computer Science, vol 2315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46000-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-46000-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43410-8
Online ISBN: 978-3-540-46000-8
eBook Packages: Springer Book Archive