A High Throughput Approach to Combinatorial Search on Grids

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