A High Throughput Approach to Combinatorial Search on Grids

Paris June 19-June 23

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652179

2006 15th IEEE International Conferen ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by null Yan Liu Articles by A.M. Segre Articles by null Shaowen Wang

	ASCII Text	x
	null Yan Liu, A.M. Segre, null Shaowen Wang, "A High Throughput Approach to Combinatorial Search on Grids," High-Performance Distributed Computing, International Symposium on, pp. 351-352, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006.

	BibTex	x
	@article{ 10.1109/HPDC.2006.1652179, author = {null Yan Liu and A.M. Segre and null Shaowen Wang}, title = {A High Throughput Approach to Combinatorial Search on Grids}, journal ={High-Performance Distributed Computing, International Symposium on}, volume = {0}, year = {2006}, isbn = {1-4244-0307-3}, pages = {351-352}, doi = {http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652179}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - High-Performance Distributed Computing, International Symposium on TI - A High Throughput Approach to Combinatorial Search on Grids SN - 1-4244-0307-3 SP351 EP352 A1 - null Yan Liu, A1 - A.M. Segre, A1 - null Shaowen Wang, PY - 2006 KW - collaboration tree grafting algorithm KW - distributed combinatorial search algorithm KW - grid resources KW - fault-tolerant distributed search paradigm KW - nagging on grid KW - dynamic scheduling VL - 0 JA - High-Performance Distributed Computing, International Symposium on ER -

null Yan Liu, Iowa Univ., Iowa City, IA

A.M. Segre, Iowa Univ., Iowa City, IA

null Shaowen Wang, Iowa Univ., Iowa City, IA

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

Index Terms:

collaboration tree grafting algorithm, distributed combinatorial search algorithm, grid resources, fault-tolerant distributed search paradigm, nagging on grid, dynamic scheduling

Citation:

null Yan Liu, A.M. Segre, null Shaowen Wang, "A High Throughput Approach to Combinatorial Search on Grids," hpdc, pp.351-352, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.