loading...
Issues in Runtime Algorithm Selection for Grid Environments
Seattle, Washington June 21-June 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CLADE.2003.1210003International Workshop on Challenges ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Prachi Bora, Virginia Tech
Calvin Ribbens, Virginia Tech
Sandeep Prabhakar, Virginia Tech
Gautam Swaminathan, Virginia Tech
Malarvizhi Chinnusamy, Virginia Tech
Ashwin Jeyakumar, Virginia Tech
Beatriz Diaz-Acosta, Virginia Tech
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of requirements for an algorithm selection web service, which supports runtime, context-aware algorithm recommendations in a multi-language, multi-platform environment. An architecture and prototype implementation of such a system is described, along with a perspective of how such a system will be helpful to other grid middleware such as meta-scheduling systems.
Citation:
Prachi Bora, Calvin Ribbens, Sandeep Prabhakar, Gautam Swaminathan, Malarvizhi Chinnusamy, Ashwin Jeyakumar, Beatriz Diaz-Acosta, "Issues in Runtime Algorithm Selection for Grid Environments," clade, pp.80, International Workshop on Challenges of Large Applications in Distributed Environments, 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions