A High Throughput Approach to Combinatorial Search on Grids

Author

Liu, Yan ; Segre, Alberto Maria ; Wang, Shaowen

Author_Institution

Iowa Univ., Iowa City, IA

fYear

0

fDate

0-0 0

Firstpage

351

Lastpage

352

Abstract

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

Keywords

fault tolerant computing; grid computing; resource allocation; scheduling; search problems; tree data structures; collaboration tree grafting algorithm; distributed combinatorial search algorithm; dynamic scheduling; fault-tolerant distributed search paradigm; grid resources; nagging on grid; Availability; Cities and towns; Collaboration; Collaborative work; Dynamic scheduling; Grid computing; Resource management; Runtime; Scheduling algorithm; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Paris

ISSN

1082-8907

Print_ISBN

1-4244-0307-3

Type

conf

DOI

10.1109/HPDC.2006.1652179

Filename

1652179