By Topic

FaSReD: Fast and Scalable Resource Discovery in Support of Multiple Resource Range Requirements for Computational Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Smith, D. ; Center for Adv. Comput. Studies, Univ. of Louisiana at Lafayette, Lafayette, LA ; Nian-Feng Tzeng ; Ghantous, M.M.

Distributed grid resource discovery (ReD) systems lack the ability to adapt efficiently to an increase in the number of attributes. The main contribution of this paper is a fast and scalable ReD mechanism, dubbed FaSReD, which composes a resource key via bit string encoding. We establish close-to-optimal FaSReD and a lower bound on the mean number of search hops under FaSReD. Through extensive simulation, our ReD is demonstrated to accommodate effectively an increase in the number of attributes with respect to such performance metrics as overlay hops, total messages, mean query response time, and throughput. FaSReD is further shown to outperform the leading prior distributed ReD range query schemes.

Published in:

Network Computing and Applications, 2008. NCA '08. Seventh IEEE International Symposium on

Date of Conference:

10-12 July 2008