Skip to main content

Scheduling Strategy of P2P Based High Performance Computing Platform Base on Session Time Prediction

  • Conference paper
  • 580 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5529))

Abstract

P2P based high performance computing (HPC) system introduces many new and interesting problems. P2P environment is heterogeneous and asynchronous. At the same time, P2P platform is not stable. The joining and leaving of peers are random. These characteristics make the P2P based HPC platform have great difference to the traditional HPC platform and the global computing project. To achieve effective job scheduling on P2P based platform, this paper introduces a DHT based monitor and task management scheme. Further, we propose a data structure of distributed bidirectional Skiplist to keep the prediction session time. Our scheme distributes the task to the nodes which have longer online session time. With such scheme, we can reduce the migration of tasks among different nodes and improve the resource utilization of computing nodes. Finally, we use a real trace to demonstrate the efficiency of our algorithms and scheduling schemes.

This paper is supported by ChinaGrid project from Ministry of Education of China, the National High-Tech Research and Development Plan of China under grant No.2006AA01A115, and National Science Foundation of China under grant No.90412010, No.60433040 and NSFC/RGC Joint Research Foundation under grant No.60731160630.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, D., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Communications of the ACM 45(11), 56–61 (2002)

    Article  Google Scholar 

  2. Larson, S., Snow, C., Shirts, M., Pande, V.: Folding@Home and Genome@Home: Using distributed computing to tackle previously intractable problems in computational biology. Computational Genomics (2002)

    Google Scholar 

  3. Anderson, D.: BOINC: A System for Public-Resource Computing and Storage. In: Proceedings of 5th IEEE/ACM International Workshop on Grid Computing, pp. 365–372 (2004)

    Google Scholar 

  4. Lo, V., Zappala, D., Zhou, D., Liu, Y., Zhao, S.: Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 227–236. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Zhou, D., Lo, V.: WaveGrid: a Scalable Fast-turnaround Heterogeneous Peerbased Desktop Grid System. In: Proceedings of the 20th International Parallel & Distributed Processing Symposium (2006)

    Google Scholar 

  6. Bajaj, R., Agrawal, D.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Transaction on Parallel and Distributed Systems, 107–118 (2004)

    Google Scholar 

  7. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 SIGCOMM conference, vol. 31(4), pp. 149–160 (2001)

    Google Scholar 

  8. Rowstron, A., 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)

    Chapter  Google Scholar 

  9. Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network (CAN). In: Proceedings of ACM SIGCOMM (2001)

    Google Scholar 

  10. Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: A global-scale overlay for rapid service deployment. IEEE Journal on Selected Areas in Communications (2003)

    Google Scholar 

  11. Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: a scalable overlay network with practical locality properties. In: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems, p. 9 (2003)

    Google Scholar 

  12. Pugh, W.: Skip Lists: A Probabilistic Alternative to Balanced Trees. In: Proceedings of Workshop on Algorithms and Data Structures, pp. 437–449 (1989)

    Google Scholar 

  13. Zheng, C., Shen, G., Li, S., Shenker, S.: Distributed Segment Tree: Support of Range Query and Cover Query over DHT. In: Proceedings of IPTPS 2006 (2006)

    Google Scholar 

  14. Ramabhadran, S., Ratnasamy, S., Hellerstein, J., Shenker, S.: Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables. IRB Technical Report (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Jin, H., Zhang, Q. (2009). Scheduling Strategy of P2P Based High Performance Computing Platform Base on Session Time Prediction. In: Abdennadher, N., Petcu, D. (eds) Advances in Grid and Pervasive Computing. GPC 2009. Lecture Notes in Computer Science, vol 5529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01671-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01671-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01670-7

  • Online ISBN: 978-3-642-01671-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics