A high throughput approach to combinatorial search on grids

Liu Yan, Alberto Maria Segre, Shaowen Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15
Pages351-352
Number of pages2
Volume2006
StatePublished - 2006
Externally publishedYes
Event15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15 - Paris, France
Duration: Jun 19 2006Jun 23 2006

Other

Other15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15
CountryFrance
CityParis
Period6/19/066/23/06

Fingerprint

Throughput
Availability
Scheduling

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Yan, L., Segre, A. M., & Wang, S. (2006). A high throughput approach to combinatorial search on grids. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15 (Vol. 2006, pp. 351-352). [1652179]

A high throughput approach to combinatorial search on grids. / Yan, Liu; Segre, Alberto Maria; Wang, Shaowen.

Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15. Vol. 2006 2006. p. 351-352 1652179.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yan, L, Segre, AM & Wang, S 2006, A high throughput approach to combinatorial search on grids. in Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15. vol. 2006, 1652179, pp. 351-352, 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, Paris, France, 6/19/06.
Yan L, Segre AM, Wang S. A high throughput approach to combinatorial search on grids. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15. Vol. 2006. 2006. p. 351-352. 1652179
Yan, Liu ; Segre, Alberto Maria ; Wang, Shaowen. / A high throughput approach to combinatorial search on grids. Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15. Vol. 2006 2006. pp. 351-352
@inproceedings{4a970059e90c46529a717325d5519a24,
title = "A high throughput approach to combinatorial search on grids",
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 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.",
author = "Liu Yan and Segre, {Alberto Maria} and Shaowen Wang",
year = "2006",
language = "English (US)",
isbn = "1424403073",
volume = "2006",
pages = "351--352",
booktitle = "Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15",

}

TY - GEN

T1 - A high throughput approach to combinatorial search on grids

AU - Yan, Liu

AU - Segre, Alberto Maria

AU - Wang, Shaowen

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

VL - 2006

SP - 351

EP - 352

BT - Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15

ER -