skip to main content
10.1145/1621087.1621106acmotherconferencesArticle/Chapter ViewAbstractPublication Pageseatis-orgConference Proceedingsconference-collections
research-article

Achieving better performance through true best effort in scavenging grid computing

Published:10 September 2008Publication History

ABSTRACT

In addition to an untuned performance, inefficient resource management in hinders any attempt to offer Quality of Service in scavenging grids. In this case, Best-Effort mechanisms are synonym to unreliability. Evidently it would be impossible, with undedicated resources, to offer any deterministic warranty (if based on a classic reservation of resources) to service access. Although the usage of scavenging grids for real-time execution remains a challenge, new "Service Qualities" may be proposed to compatiblize applications' preferences versus system oscillations.

References

  1. G. C. Bezerra. Análise de Conglomerados Aplicada ao Reconhecimento de Padrões de Uso de Recursos Computacionais. Master's thesis, Department of Computer Science - University of São Paulo, São Paulo, March 2006.Google ScholarGoogle Scholar
  2. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in gridenvironments. Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th, pages 349--363, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Choi. Group-based Adaptive Scheduling Mechanism in Desktop Grid. PhD thesis, Department of Computer Science and Engineering Graduate School Korea University, June 2007.Google ScholarGoogle Scholar
  4. W. Cirne, F. Brasileiro, N. Andrade, L. Costa, A. Andrade, R. Novaes, and M. Mowbray. Labs of the World, Unite!!! Journal of Grid Computing, 4(3):225--246, 2006.Google ScholarGoogle Scholar
  5. D. M. R. Conde. Análise de padrões de uso em grades computacionais. Master's thesis, Department of Computer Science - University of São Paulo, São Paulo, January 2008.Google ScholarGoogle Scholar
  6. R. Y. de Camargo. Armazenamento distribuído de dados e checkpointing de aplicações paralelas em grades oportunistas. Dr. scient. afhandling, nstituto de Matemática e Estatística - Universidade de São Paulo, 2007.Google ScholarGoogle Scholar
  7. R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley-Interscience, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Goldchleger. Fabio Kon an Alfredo Goldman, Marcelo Finger, and Germano Capistrano Bezerra. Integrade: Object-oriented grid middleware leveraging idle computing power of desktop machines. Concurrency and Computation: Practice&Experience, 16:449--459, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Goldchleger, C. Queiroz, F. Kon, and A. Goldman. Running Highly-Coupled Parallel Applications in a Computational Grid. Proceedings of the 22th Brazilian Symposium on Computer Networks (SBRC 2004) (Gramado-RS, Brazil, May 2004).Google ScholarGoogle Scholar
  10. J. Hill, B. McColl, D. Stefanescu, M. Goudreau, K. Lang, S. Rao, T. Suel, T. Tsantilas, and R. Bisseling. BSPlib: The BSP programming library. Parallel Computing, 24(14):1947--1980, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Kon, F. Costa, G. Blair, and R. H. Campbell. The case for reflective middleware. Commun. ACM, 45(6):33--38, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Kondo, M. Taufer, C. Brooks, H. Casanova, and A. Chien. Characterizing and evaluating desktop grids: an empirical study. Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  13. J. Liang and M. Nahrstedt. Supporting quality of service in a non-dedicated opportunistic environment. Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on, pages 74--81, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Litzkow, M. Livny, and M. Mutka. Condor-a hunter of idle workstations. Distributed Computing Systems, 1988., 8th International Conference on, pages 104--111, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  15. M. Livny, J. Basney, R. Raman, and T. Tannenbaum. Mechanisms for high throughput computing. SPEEDUP Journal, 11(1):36--40, 1997.Google ScholarGoogle Scholar
  16. M. Mutka and M. Livny. The available capacity of a privately owned workstation environment. Performance Evaluation, 12(4):269--284, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Norman. Bulk Synchronous Parallelism. WoTUG Newsletter, 17:32--35, 1992.Google ScholarGoogle Scholar
  18. Object Management Group. CORBA v3.0 Specification. OMG Document 02-06-33, July 2002.Google ScholarGoogle Scholar
  19. J. Rolia, X. Zhu, M. Arlitt, and A. Andrzejak. Statistical service assurances for applications in utility grid environments. Performance Evaluation, 58(2--3):319--339, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. SunOS. Slackware Linux, OSF 3.2. BSDi, NetBSD, OpenBSD and FreeBSD are not.Google ScholarGoogle Scholar
  21. M. Wu and X. Sun. A general self-adaptive task scheduling system for non-dedicated heterogeneous computing. Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on, pages 354--361, 2003.Google ScholarGoogle Scholar
  22. M. Wu, X. Sun, and Y. Chen. QoS Oriented Resource Reservation in Shared Environments. Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)-Volume 00, pages 601--608, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Achieving better performance through true best effort in scavenging grid computing

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          EATIS '08: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
          September 2008
          287 pages
          ISBN:9781595939883
          DOI:10.1145/1621087

          Copyright © 2008 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 September 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate17of64submissions,27%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader