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

DC Field Value Language
dc.contributor.author Kim, Jik-Soo ko
dc.contributor.author Nam, Beomseok ko
dc.contributor.author Keleher, Peter ko
dc.contributor.author Marsh, Michael ko
dc.contributor.author Bhattacharjee, Bobby ko
dc.contributor.author Sussman, Alan ko
dc.date.available 2014-10-30T00:09:58Z -
dc.date.created 2014-10-29 ko
dc.date.issued 2008-05 -
dc.identifier.citation FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, v.24, no.5, pp.415 - 424 ko
dc.identifier.issn 0167-739X ko
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/8009 -
dc.identifier.uri http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=40049112703 ko
dc.description.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. ko
dc.description.statementofresponsibility close -
dc.language ENG ko
dc.publisher ELSEVIER SCIENCE BV ko
dc.subject Desktop grid ko
dc.subject Load balancing ko
dc.subject Matchmaking ko
dc.subject Peer-to-Peer computing ko
dc.subject Resource discovery ko
dc.title Trade-off in matching jobs and balancing load for distributed desktop grids ko
dc.type ARTICLE ko
dc.identifier.scopusid 2-s2.0-40049112703 ko
dc.identifier.wosid 000254813500008 ko
dc.type.rims ART ko
dc.description.wostc 5 *
dc.description.scopustc 9 *
dc.date.tcdate 2015-05-06 *
dc.date.scptcdate 2014-10-29 *
dc.identifier.doi 10.1016/j.future.2007.07.007 ko
Appears in Collections:
EE_Journal Papers

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

Show simple item record

qrcode

  • mendeley

    citeulike

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

MENU