A self-organized grouping (SOG) framework for efficient Grid resource discovery

Journal of Grid Computing

Volumn 8, Issue 3, 2010, Pages 365-389

  Padmanabhan, Anand ^a   Ghosh, Sukumar ^b   Wang, Shaowen ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Iowa   (United States)

Author keywords

Grid computing; Multi attribute range queries; Peer to peer systems; Resource discovery; Self organization; Space filling curve

Indexed keywords

MULTI-ATTRIBUTES; PEER-TO-PEER SYSTEM; RANGE QUERY; RESOURCE DISCOVERY; SELF-ORGANIZATIONS; SPACE-FILLING CURVE;

CLIENT SERVER COMPUTER SYSTEMS; GRID COMPUTING; PEER TO PEER NETWORKS;

FILLING;

EID: 77955088252     PISSN: 15707873     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10723-009-9145-0     Document Type: Article

References (39)

1. Andrzejak, A., Xu, Z.: Scalable, efficient range queries for Grid information services. In: P2P '02: Proceedings of the Second International Conference on Peer-to-Peer Computing, p. 33. IEEE Computer Society, Washington, DC (2002).
2. Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmayer, P.: Space-filling curves and their use in the design of geometric data structures. Theor. Comp. Sci. 181(1), 3-15 (1997).
3. Ayalvadi, G., Kermarrec, A., Massoulie, L., SCAMP: peer-to-peer lightweight membership service for large-scale group communication. In: Proc. 3rd Intnl. Wshop Networked Group Communication (NGC '01), LNCS 2233, pp. 44-55. Springer, New York (2001).
4. Bharambe, A. R., Agrawal, M., Seshan, S.: Mercury: supporting scalable Multi-attribute range queries. In: SIGCOMM '04: proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications, pp. 353-366 (2004).
5. Butz, A. R.: Alternative algorithm for Hilbert's space-filling curve. IEEE Trans. Comp. C-20, 424-426 (1971).
6. Caron, E., Desprez, F., Tedeschi, C.: Enhancing computational Grids with peer-to-peer technology for large scale service discovery. Journal of Grid. Computing 5(3), 337-360 (2007).
7. Chen, G., Ping Low, C., Yang, Z.: Enhancing search performance in unstructured P2P networks based on users' common interest. IEEE Trans. Parallel Distrib. Syst. 19(6), 821-836 (2008).
8. Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid information services for distributed resource sharing. In: Proceedings of the Tenth IEEE International Symposium on High-Performance Distributed Computing (HPDC-10) (2001).
9. Eva, S., Manohar, R., Chandy, M.: An analysis of leader election for multicast groups. Technical report, AT& T Labs-Research (2002).
10. Forestiero, A., Mastroianni, C., Spezzano, G.: Building a peer-to-peer information system in Grids via self-organizing agents. Journal of Grid. Computing 6, 125-140 (2008).
11. Forestiero, A., Mastroianni, C., Spezzano, G.: So-Grid: a self-organizing Grid featuring bio-inspired algorithms. ACM Trans. Auton. Adapt. Syst. 3(2), 1-37 (2008).
12. Foster, I., Iamnitchi, A.: On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing, pp. 118-128 (2003).
13. Foster, I., Kesselman, C., Nick, J., Tuecke, S.: The physiology of the Grid: an open Grid services architecture for distributed systems integration. Technical report, Globus Project (2002).
14. Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: enabling scalable virtual organizations. Int. J. Supercomput. Appl. 15 (2001).
15. Iamnitchi, A., Foster, I.: On fully decentralized resource discovery in Grid environments. In: GRID '01: Proceedings of the Second International Workshop on Grid Computing, pp. 51-62. Springer, London (2001).
16. Jin, G., Mellor-Crummey, J.: SFCGen: a framework for efficient generation of multi-dimensional space-filling curves by recursion. ACM Trans. Math. Softw. 31(1), 120-148 (2005).
17. Kermarrec, A., Massouli, L., Ganesh, A.: Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14(3), 248-258 (2003).
18. Koloniari, G., Pitoura, E.: Bloom-based filters for hierarchical data. In: 5th Workshop on Distributed Data and Structures (2003).
19. Lawder, J.: Calculation of Mappings between One and n-dimensional Values Using the Hilbert Space-Filling Curve (2000).
20. Li, M., Lee, W., Sivasubramaniam, A., Zhao, J.: SSW: a small-world-based overlay for peer-to-peer search. IEEE Trans. Parallel Distrib. Syst. 19(6), 735-749 (2008).
21. Mstroianni, C., Talia, D., Verta, O.: A super-peer model for resource discovery services in large-scale Grids. Future Gener. Comput. Syst. 21(8), 1235-1248 (2005).
22. Merz, P., Gorunova, K.: Fault-tolerant resource discovery in peer-to-peer Grids. Journal of Grid. Computing 5(3), 319-335 (2007).
23. Moon, B., Jagadish, H. V., Faloutsos, C., Saltz, J. H.: Analysis of the clustering properties of the Hilbert space-Filling curve. IEEE Trans. Knowl. Data Eng. 13(1), 124-141 (2001).
24. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995).
25. Newman, H. B., Legrand, I. C., Galvez, P., Voicu, R., Cirstoiu, C.: MonALISA: a distributed monitoring service architecture. In: CHEPLa Jola, California (2003).
26. Open Science Grid (OSG): Open Science Grid homepage. http://opensciencegrid. org (2008).
27. Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Design and implementation tradeoffs for wide-area resource discovery. In: HPDCResearch Triangle Park, NC (2005).
28. Padmanabhan, A., Wang, S., Ghosh, S., Briggs, R.: A Self-Organized Grouping (SOG) method for efficient Grid resource discovery. In: GRID 2005. (2005).
29. Ramabhadran, S., Ratnasamy, S., Hellerstein, J. M., Shenker, S.: Prefix hash tree. In: PODC (2004).
30. Raman, R., Livny, M., Solomon, M.: Policy driven heterogeneous resource co-allocation with gangmatching. In: Proceedings of the Twelfth IEEE International Symposium on High-Performance Distributed Computing (HPDC-12)Seattle, WA (2003).
31. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM (2001).
32. RFC-Gnutella: The Gnutella Protocol Specification v0. 4 (2004).
33. Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC'03)IEEE Computer Society, Washington, DC (2003).
34. Schulz, S., Blochinger, W., Hannak, H.: Capability-aware information aggregation in peer-to-peer Grids. Journal of Grid. Computing 7(2), 135-167 (2009).
35. Spence, D., Harris, T.: XenoSearch: distributed resource discovery in the xenoServer open platform. In: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC'03)IEEE Computer Society, Washington, DC (2003).
36. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149-160. ACM Press, New York (2001).
37. Viana, A. C., de Amorim, M. D., Viniotis, Y., Fdida, S., de Rezende, J. F.: Twins: a dual addressing space representation for self-organizing networks. IEEE Trans. Parallel Distrib. Syst. 17(12), 1468-1481 (2006).
38. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: IEEE International Conference on Data Engineering, (ICDE 2003) (2003).
39. Zhu, C., Liu, Z., Zhang, W., Xiao, W., Xu, Z., Yang, D.: Decentralized Grid resource discovery based on resource information community. Journal of Grid. Computing 2(3), 261-277 (2004).