Abstract
As grid computing becomes more commonplace, so does the importance of coscheduling these geographically distributed resources. Negotiating resource management and scheduling decisions for these resources is similar to making travel arrangements: guesses are made and then remade or confirmed depending on the availability of resources. This “Travel Agent Method” serves as the basis for a production scheduler and metascheduler suitable for making travel arrangements for a grid. This strategy is more easily implemented than centralized metascheduler because arrangements can be made without requiring control over the individual schedulers for each resource: the reservations are set by users or automatically by negotiating with each local scheduler’s user settable interface. The Generic Universal Remote is a working implementation of such a system and proves that a user-settable reservation facility on local schedulers in a grid is sufficient to enable automated metascheduling.
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
Andrews, P., Sherwin, T., Banister, B.: A centralized data access model for grid computing. In: IEEE Symposium on Mass Storage Systems, April 2003, pp. 280–289 (2003)
Cattlett, C.: The teragrid: A primer (2002), http://www.teragrid.org
Foster, I., Kesselman, C.: Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing 11(2), 115–128 (summer 1997)
Foster, I., Kesselman, C., Nick, J.M., Tuecke, S.: Grid services for distributed system integration. IEEE Computer 35(6), 37–46 (2002)
Frey, J., Tannenbaum, T., Livny, M., Foster, I.T., Tuecke, S.: Condor-G: A computation management agent for multi-institutional grids. In: High Performance Distributed Computing (HPDC-10) (August 2001)
Sabin, G., Kettimuthu, R., Rajan, A., Sadayappan, P.: Scheduling of parallel jobs in a heterogeneous multi-site environment. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 87–104. Springer, Heidelberg (2003)
Schmuck, F., Haskin, R.: GPFS: A shared-disk file system for large computing clusters. In: USENIX (ed.) Proceedings of the FAST 2002 Conference on File and Storage Technologies, Monterey, California, Berkeley, CA, USA, January 28-30 (2002) USENIX
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshimoto, K., Kovatch, P., Andrews, P. (2005). Co-scheduling with User-Settable Reservations. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2005. Lecture Notes in Computer Science, vol 3834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605300_7
Download citation
DOI: https://doi.org/10.1007/11605300_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31024-2
Online ISBN: 978-3-540-31617-6
eBook Packages: Computer ScienceComputer Science (R0)