By Topic

A High Throughput Approach to Combinatorial Search on 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)
Yan Liu ; Iowa Univ., Iowa City, IA ; Segre, A.M. ; Shaowen Wang

Current distributed combinatorial search algorithms assume the use of managed or reserved resources. However, grid resources are shared and exhibit highly dynamic availability. Accommodating these resources in runtime collaboration for distributed search applications is a challenge. We work on nagging, a naturally scalable and fault-tolerant distributed search paradigm, and propose a high throughput collaboration approach, NoG (nagging on grid), that is continuously adaptive to dynamic resource availability. Dynamic scheduling and collaboration tree grafting algorithms are devised to handle dynamic join and leave of grid resources

Published in:

High Performance Distributed Computing, 2006 15th IEEE International Symposium on

Date of Conference:

0-0 0