Abstract
Recently, there has been considerable interest in providing high performance codes as network services. In particular, high performance network services provide improved performance by executing complex and time-consuming applications (or part of an application) on remote high performance resources. However, since service providers resources are limited, without effective resource scheduling, end-users will not experience performance improvement. In this paper, we propose adaptive resource harvesting algorithms to schedule multiple concurrent service requests within network services. The preliminary results show that our approach can achieve service time improvement up to 40% for a prototypical parallel service.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Buyya, D. Abramson, J. Giddy: Nimrod/G: An Architecture for a Resource Management and Scheduling System in a Global Computational Grid, Proceedings of 4th High Performance Computing in Asia-Pacific Region (2000)
H. Casanova, J. Dongarra: Netsolve: A Network Server for Solving Computational Science Problems, International Journal of Supercomputing Applications and High Performance Computing. Vol. 11(3). (1997)
D. Dill: SVC: The Standard Validity Checker, http://www.sprout.standford.edu/SVC
R.L. Grossman, S. Kasif, D. Mon, A. Ramu, B. Malhi: The Preliminary Desgin of Papyrus: A System for High Performance, Distributed Data Mining over Clusters, Meta-Clusters and Super-Clusters, Proceedings of KDD-98 Workshop on Distributed Data Mining (1998)
N. H. Kapadia, J. Fortes, C. Brodley: Predictive Application-Performance Modeling in a Computational Grid Environment, Proceedings of 8th International Symposium on High Performance Distributed Computing (1999)
H. Nakada, M. Sato, S. Sekiguchi: Design and Implementation of Ninf: Towards a Global Computing Infrastructure, Journal of Future Generation Systems, Metacomputing Issue (1999)
A. Takefusa, H. Casanova, S. Matsouka, F. Berman: A Study of Deadline Scheduling for Client-Server Systems on Computational Grid, Proceedings of 10th International Symposium on High Performance Distributed Computing (2001)
B. Wilkinson, M. Allen: Parallel Programming, Prentice Hall (1999)
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
Lee, BD., Weissman, J.B. (2002). Adaptive Resource Scheduling for Network Services. In: Parashar, M. (eds) Grid Computing — GRID 2002. GRID 2002. Lecture Notes in Computer Science, vol 2536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36133-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-36133-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00133-1
Online ISBN: 978-3-540-36133-6
eBook Packages: Springer Book Archive