Advertisement

Scalable Architecture for Allocation of Idle CPUs in a P2P Network

  • Javier Celaya
  • Unai Arronategui
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4208)

Abstract

In this paper we present a scalable, distributed architecture that allocates idle CPUs for task execution, where any node may request the execution of a group of tasks by other ones. A fast, scalable discovery protocol is an essential component. Also, up to date information about free nodes is efficiently managed in each node by an availability protocol. Both protocols exploit a tree-based peer-to-peer network that adds fault-tolerant capabilities. Results from experiments and simulation tests, using a simple allocation method, show discovery and allocation costs scaling logarithmically with the number of nodes, even with low communication overhead and little, bounded state in each node.

Keywords

Parallel and Distributed Architectures Networking Protocols and Routing and Algorithms Reliability and Fault-tolerance Grid Computing Peer-to-Peer Computing Parallel and Distributed Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: Seti@home: an experiment in public-resource computing. Commun. ACM 45(11), 56–61 (2002)CrossRefGoogle Scholar
  2. 2.
    Distributed.net (2000), http://www.distributed.net
  3. 3.
    Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. In: Record of the 1970 ACM SIGFIDET Workshop on Data Description and Access, Rice University, Houston, Texas, USA, November 15-16, pp. 107–141. ACM, New York (1970) (Second Edition with an Appendix)CrossRefGoogle Scholar
  4. 4.
    Freedman, M., Vutukuru, M., Feamster, N., Balakrishnan, H.: Geographic Locality of IP Prefixes. In: Internet Measurement Conference (IMC), Berkeley, CA (2005)Google Scholar
  5. 5.
    Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: GRID, pp. 4–10 (2004)Google Scholar
  6. 6.
    Neary, M.O., Brydon, S.P., Kmiec, P., Rollins, S., Cappello, P.: Javelin++: scalability issues in global computing. Concurrency: Practice and Experience 12(8), 727–753 (2000)zbMATHCrossRefGoogle Scholar
  7. 7.
    Christiansen, B.O., Cappello, P.R., Ionescu, M.F., Neary, M.O., Schauser, K.E., Wu, D.: Javelin: Internet-based parallel computing using java. Concurrency - Practice and Experience 9(11), 1139–1160 (1997)CrossRefGoogle Scholar
  8. 8.
    Gupta, R., Somani, A.K.: Compup2p: An architecture for sharing of computing resources in peer-to-peer networks with selfish nodes. In: Online Proceedings of Second Workshop on the Economics of Peer-to-Peer Systems, Harvard University (2004)Google Scholar
  9. 9.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)CrossRefGoogle Scholar
  10. 10.
    Mason, R., Kelly, W.: G2-p2p: A fully decentralised fault-tolerant cycle-stealing framework. In: ACSW Frontiers, pp. 33–39 (2005)Google Scholar
  11. 11.
    Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Butt, A.R., Fang, X., Hu, Y.C., Midkiff, S.P.: Java, peer-to-peer, and accountability: Building blocks for distributed cycle sharing. In: Virtual Machine Research and Technology Symposium, pp. 163–176 (2004)Google Scholar
  13. 13.
    Awan, A., Ferreira, R.A., Jagannathan, S., Grama, A.: Unstructured peer-to-peer networks for sharing processor cycles. Journal Parallel Computing (PARCO) 32(2), 115–135 (2006)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: Querying peer-to-peer networks using p-trees. In: WebDB 2004: Proceedings of the 7th International Workshop on the Web and Databases, pp. 25–30. ACM Press, New York (2004)CrossRefGoogle Scholar
  15. 15.
    Aberer, K.: P-grid: A self-organizing access structure for p2p information systems. In: CooplS 2001: Proceedings of the 9th International Conference on Cooperative Information Systems, London, UK, pp. 179–194. Springer, Heidelberg (2001)Google Scholar
  16. 16.
    Jagadish, H.V., Ooi, B., Vu, Q., Zhang, R., Zhou, A.: Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In: 22nd IEEE International Conference on Data Engineering (ICDE) (to appear, 2006)Google Scholar
  17. 17.
    Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661–672 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Javier Celaya
    • 1
  • Unai Arronategui
    • 1
  1. 1.Department of Computer Science and Systems EngineeringUniversity of ZaragozaZaragozaSpain

Personalised recommendations