Skip to main content

Global Computing Systems

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2179))

Included in the following conference series:

Abstract

Global Computing harvest the idle time ofIn ternet connected computers to run very large distributed applications. The unprecedented scale ofthe GCS paradigm requires to revisit the basic issues of distributed systems: performance models, security, fault-tolerance and scalability. The first parts ofthis paper review recent work in Global Computing, with particular interest in Peer-to-Peer systems. In the last section, we present XtremWeb, the Global Computing System we are currently developing.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Acharya and M. Raje. MAPbox: Using parameterized behavior classes to confine applications, Technical Report TRCS99-15, 31, 1999.

    Google Scholar 

  2. A. Alexandrov, P. Kmiec, and K. Schauser. Consh: A confined execution environment for internet computations, in USENIX Ann. Technical Conf., 1999.

    Google Scholar 

  3. Y. Amir, B. Awerbuch, A. Barak, R. S. Borgstrom, and A. Keren. An opportunity cost approach for job assignment in a scalable computing cluster, IEEE Trans. Parallel and Distributed Systems, 11(7), 760–768, 2000.

    Article  Google Scholar 

  4. D. Anderson and al. A new major SETI project based on project Serendip data and 100,000 personal computers, in 5th Intl. Conf. on Bioastronomy, 1997. http://setiathome.ssl.berkeley.edu/.

  5. G. Antoniu, L. Bougé, and R. Namyst. An efficient and transparent thread migration scheme in the PM2 runtime system, in 3rd Workshop on Runtime Systems for Parallel Programming, LNCS 1586.

    Google Scholar 

  6. Y. Aumann, Z. M. Kedem, K. Palem, and M. Rabin. Highly efficient asynchronous execution oflarge grained programs, in 34th IEEE Symp. on Foundations of Computer Science, 1993.

    Google Scholar 

  7. The Auger project, http://www.auger.org.

  8. D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programming in Linda, IEEE Trans. on Parallel and Distributed Systems, 6(3), 287–302, 1995.

    Article  Google Scholar 

  9. J. E. Baldeschwieler, R. D. Blumofe, and E. A. Brewer. Atlas: An infrastructure for global computing, in 7th ACM SIGOPS, 1996.

    Google Scholar 

  10. A. Baratloo, M. Karaul, Z. Kedem, and P. Wyckoff. Charlotte: Metacomputing on the web, Future Generation Computing Systems, 15, 559–570, 1999.

    Article  Google Scholar 

  11. A. Baratloo, T. Tsai, and N. Singh. Transparent run-time defense against stack smashing attacks, in USENIX Ann. Technical Conf., 2000.

    Google Scholar 

  12. F. Berman. High-performance scheduling, in I. Foster and C. Kesselman (eds.), The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1997.

    Google Scholar 

  13. M. Beynon, T. Kurc, A. Sussman, and J. Saltz. Design ofa framework for data intensive wide-area applications, in 9th Heterogeneous Computing Workshop, 2000.

    Google Scholar 

  14. S. N. Bhatt, F. Chung, F. T. Leighton, and A. L. Rosenberg. On optimal strategies for Cycle-Stealing in networks of workstations, IEEE Trans. on Computers, 46(5), 1997.

    Google Scholar 

  15. M. Blum and H. Wasserman. Software reliability via run-time result-checking, Journal of the ACM, 44(6), 826–849, 1997.

    Article  MathSciNet  Google Scholar 

  16. R. D. Blumofe and al. Cilk: an efficient multithreaded runtime system, in 5th PPoPP, 205–216, 1995.

    Google Scholar 

  17. R. Buyya, D. Abramson, and J. Giddy. Economy driven resource management architecture for computational power grids, in International Conference on Parallel and Distributed Processing Techniques and Applications, 2000.

    Google Scholar 

  18. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments, in 9th Heterogeneous Computing Workshop, 349–363, 2000.

    Google Scholar 

  19. B. O. Christiansen and al. Javelin: Internet-based parallel computing using Java, Concurrency: Practice and Experience, 9(11), 1139–1160, 1997.

    Article  Google Scholar 

  20. E. G. Coffman, L. Flatto, and A. Y. Kreinin. Scheduling saves in fault-tolerant computations, Acta Informatica, 30, 409–423, 1993.

    Article  MathSciNet  Google Scholar 

  21. C. Cowan and al. StackGuard: Automatic adaptive detection and prevention of buffer-overflow attacks, in USENIX Ann. Technical Conf., 1998.

    Google Scholar 

  22. J. Dike. A user mode port ofthe Linux kernel, in 4th Ann. Linux Showcase, 2000.

    Google Scholar 

  23. G. Fedak, C. Germain, V. NĂ©ri, and F. Cappello. XtremWeb: A generic global computing system, in IEEE Int. Symp. on Cluster Computing and the Grid, 2001.

    Google Scholar 

  24. I. Foster. The anatomy ofthe grid: Enabling scalable virtual organizations, in IJSA, 2001.

    Google Scholar 

  25. C. Germain, V. NĂ©ri, G. Fedak, and F. Cappello. XtremWeb: Building an experimental platform for global computing, in 1st IEEE ACM Intl. Workshop Grid 2000, 2000.

    Google Scholar 

  26. I. Kuz, M. van Steen, and H. J. Sips. The globe infrastructure directory service, in Proc. 7th ASCI Conference, 115–122, 2001.

    Google Scholar 

  27. I. Goldberg, D. Wagner, R. Thomas, and Eric A. Brewer. A secure environment for untrusted helper applications-confining the wily hacker, in 6th USENIX Security Symposium, 1996.

    Google Scholar 

  28. M. Maheswaran and al. Dynamic matching and scheduling ofa class ofindep endent tasks on heterogeneous computing systems, in 8th Heterogeneous Computing Workshop, 1999.

    Google Scholar 

  29. M. Neary and al. Javelin++: Scalability issues in global computing, in ACM Java Grande‘99 Conf., 1999.

    Google Scholar 

  30. G. C. Necula and P. Lee. Safe kernel extensions without run-time checking, in 2nd Symp. on Operating Systems Design and Implementation, 229–243, 1996.

    Google Scholar 

  31. N. Nisan, S. London, O. Regev, and N. Camiel. Globally distributed computation over the internet-the POPCORN project, in 18th Int. Conf.on Distributed Computing Systems, 1998.

    Google Scholar 

  32. A. Oram. Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O‘Reilley, 2001.

    Google Scholar 

  33. H. Pedroso, L. M. Silva, and J. G. Silva. Web-based metacomputing with JET, in ACM 97 PPoPP Workshop on Java for Science and Engineering Computation.

    Google Scholar 

  34. The XtremWeb Project. http://www.xtremweb.net.

  35. A. L. Rosenberg. Optimal schedules for data-parallel cycle-stealing in networks of workstations, in 12th ACM SPAA, 22–29, 2000.

    Google Scholar 

  36. A. L. Rosenberg. Guidelines for data-parallel cycle-stealing in Networks of workstations, I; on maximizing expected output, JPDC, 59, 31–53, 1999.

    Google Scholar 

  37. L. F. G. Sarmenta, S. Hirano, and S. A. Ward. Towards Bayanihan: builing an extensible framework for Volonteer Computing using Java, in ACM Workshop on Java for High-Performance Network Computing, 1998.

    Google Scholar 

  38. H. Takagi and al.Ninflet: A migratable object framework using Java, in ACM Workshop on Java for High-Performance Network Computing, 1998.

    Google Scholar 

  39. A. Takefusa and al. Overview of a performance evaluation system for global computing scheduling algorithms, in 8th Int. Symp. on High Performance Distributed Computing, 97–104, 1999.

    Google Scholar 

  40. D. Wagner, J. S. FOster, E. A. Brewer, and A. Aiken. A first step towards automated detection ofbuffer overrun vulnerabilities, in Networking and Distributed System Security Symp., 2000.

    Google Scholar 

  41. R. Wahbe, S. Lucco, T. E. Anderson, and S. L. Graham. Efficient software-based fault isolation, ACM SIGOPS Operating Systems Review, 27(5), 203–216, 1993.

    Article  Google Scholar 

  42. R. Wolski, N. Spring, and J. Hayes. Predicting the CPU availability oftime-shared Unix systems on the computational grid, in 8th Int. Symp. on High Performance Distributed Computing, 1999.

    Google Scholar 

  43. R. Wolski, N.T. Spring, and J. Hayes. The Network Weather Service: A distributed resource performance forecasting service for metacomputing, Future Generation Comp. Sys., 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Germain, C., Fedak, G., NĂ©ri, V., Cappello, F. (2001). Global Computing Systems. In: Margenov, S., WaÅ›niewski, J., Yalamov, P. (eds) Large-Scale Scientific Computing. LSSC 2001. Lecture Notes in Computer Science, vol 2179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45346-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45346-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43043-8

  • Online ISBN: 978-3-540-45346-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics