loading...
Evaluation of a Resource Selection Mechanism for Complex Network Services
San Francisco, California August 07-August 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPDC.2001.94518710th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Julio C. López, Carnegie Mellon University
David R. O'Hallaron, Carnegie Mellon University
Abstract: Providing complex (resource-intensive) network services is challenging because the resources they need and the resources that are available can vary significantly from request to request. To address this issue, we have proposed a flexible mechanism, called active frames, that provides a basis for selecting a set of available distributed computing resources, and then mapping tasks onto those resources. As a proof of concept, we have used active frames to build a remote visualization service, called Dv, that allows users to visualize the contents of scientific datasets stored at remote locations. In this paper, we evaluate the performance of active frames, in the context of Dv. In particular, we address the following two questions: (1) What performance penalty do we pay for the flexibility of the active frames mechanism? (2) Can the throughput of a service based on active frames be predicted with reasonable accuracy from micro-benchmarks? The results of the evaluation suggest that the overhead imposed by active frames is reasonable (roughly 5%), and that simple models based on micro-benchmarks can conservatively predict measured throughput with reasonable accuracy (at most 20%).
Citation:
Julio C. López, David R. O'Hallaron, "Evaluation of a Resource Selection Mechanism for Complex Network Services," hpdc, pp.0171, 10th IEEE International Symposium on High Performance Distributed Computing (HPDC-10 '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.