TY - GEN
T1 - A high throughput approach to combinatorial search on grids
AU - Yan, Liu
AU - Segre, Alberto Maria
AU - Shaowen, Wang
PY - 2006
Y1 - 2006
N2 - 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 faulttolerant 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.
AB - 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 faulttolerant 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.
UR - http://www.scopus.com/inward/record.url?scp=33845898231&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845898231&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33845898231
SN - 1424403073
SN - 9781424403073
T3 - Proceedings of the IEEE International Symposium on High Performance Distributed Computing
SP - 351
EP - 352
BT - Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15
T2 - 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15
Y2 - 19 June 2006 through 23 June 2006
ER -