Multi-Layers Agorithm of Grid Resource Discovery

Article Preview

Abstract:

There are a great deal and various types of resource in grid, it is important for ensuring share of grid resource and cooperative working to discovery resource efficiently. After two kinds agorithm of resource discovery adopted in grid are analysed, multi-layers resource discovery agorithm is brought up in this text. Time complication and space complication are compared among the three alorithm in theory, and it test the performance of the three agorithm at last.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

3802-3807

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] L. Smarr and C. Catlett, Metacomputing, Communications of the ACM, 44-52, (1992).

Google Scholar

[2] I. Foster and C. Kesselman (Eds. ), The Grid: Blueprint for a New Computing Infrastructure, Morgan-Kaufmann, (1998).

Google Scholar

[3] S. Fitzberald, I. Foster, C. Kesselman, G. von Laszewski, W. Smith, and S. Tuecke, A Directory Service for Configuring High-Performance Distributed Computations, Proceedings of the Sixth IEEE International Symposium on High Performance Distributed Computing (HPDC-6), IEEE Press, (1997).

DOI: 10.1109/hpdc.1997.626445

Google Scholar