BROWSE

Related Researcher

Author's Photo

Nam, Beomseok
Data Intensive Computing Lab
Research Interests
  • Distributed and parallel computing, high performance computing, database systems, OS and storage systems

ITEM VIEW & DOWNLOAD

Trade-off in matching jobs and balancing load for distributed desktop grids

Cited 5 times inthomson ciCited 9 times inthomson ci
Title
Trade-off in matching jobs and balancing load for distributed desktop grids
Author
Kim, Jik-SooNam, BeomseokKeleher, PeterMarsh, MichaelBhattacharjee, BobbySussman, Alan
Keywords
Desktop grid; Load balancing; Matchmaking; Peer-to-Peer computing; Resource discovery
Issue Date
2008-05
Publisher
ELSEVIER SCIENCE BV
Citation
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, v.24, no.5, pp.415 - 424
Abstract
Desktop grids can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client-server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P system is decentralized and inherently adaptable, giving the Grid robustness, scalability, and the ability to cope with dynamic environments, while still efficiently mapping application instances to available resources throughout the system. We use simulation to compare three different types of matching algorithms under differing workloads. Overall, the P2P approach produces significantly lower wait times than prior approaches, while adapting efficiently to the dynamic environment.
URI
Go to Link
DOI
10.1016/j.future.2007.07.007
ISSN
0167-739X
Appears in Collections:
EE_Journal Papers
Files in This Item:
2-s2.0-40049112703.pdf Download

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU