File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Club theory of the Grid

TitleClub theory of the Grid
Authors
KeywordsClub Theory
Cost-Benefit Analysis
Grid Computing
Probabilistic Analysis
Randomized Algorithm
Issue Date2006
PublisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www.interscience.wiley.com/jpages/1532-0626/
Citation
Concurrency Computation Practice And Experience, 2006, v. 18 n. 14, p. 1759-1773 How to Cite?
AbstractThe Grid is a new type of resource sharing infrastructure. Due to software and hardware limitations, the service that a certain Grid can offer is finite, and so is the number of users it can accommodate. If the number of users is too small, much of the planned resources would be wasted. On the other hand, excessive loading due to too many users could substantially reduce the benefit enjoyed by each user and also the efficiency of the Grid service. Therefore, there are two main problems for Grid design. (1) How many users should the Grid serve so that each user can receive the maximum benefit? (2) To a certain group of users, how much resources should be invested so that the construction and maintenance of the Grid become viable? Based on the economic theory of clubs, this paper gives a quantitative analysis of the quasi-optimal number of users and amount of each resource by regarding Grid services and resources as club goods. Based on our assumptions on the system model, we deduce two preliminary results and verify them by experiments using GridFTP. These two results allow the users to run randomized algorithms to achieve better system performance. Copyright © 2006 John Wiley & Sons, Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/152347
ISSN
2015 Impact Factor: 0.942
2015 SCImago Journal Rankings: 0.452
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorShi, Yen_US
dc.contributor.authorLau, FCMen_US
dc.contributor.authorTse, SSHen_US
dc.contributor.authorDu, ZHen_US
dc.contributor.authorTang, RCen_US
dc.contributor.authorLi, Sen_US
dc.date.accessioned2012-06-26T06:37:21Z-
dc.date.available2012-06-26T06:37:21Z-
dc.date.issued2006en_US
dc.identifier.citationConcurrency Computation Practice And Experience, 2006, v. 18 n. 14, p. 1759-1773en_US
dc.identifier.issn1532-0626en_US
dc.identifier.urihttp://hdl.handle.net/10722/152347-
dc.description.abstractThe Grid is a new type of resource sharing infrastructure. Due to software and hardware limitations, the service that a certain Grid can offer is finite, and so is the number of users it can accommodate. If the number of users is too small, much of the planned resources would be wasted. On the other hand, excessive loading due to too many users could substantially reduce the benefit enjoyed by each user and also the efficiency of the Grid service. Therefore, there are two main problems for Grid design. (1) How many users should the Grid serve so that each user can receive the maximum benefit? (2) To a certain group of users, how much resources should be invested so that the construction and maintenance of the Grid become viable? Based on the economic theory of clubs, this paper gives a quantitative analysis of the quasi-optimal number of users and amount of each resource by regarding Grid services and resources as club goods. Based on our assumptions on the system model, we deduce two preliminary results and verify them by experiments using GridFTP. These two results allow the users to run randomized algorithms to achieve better system performance. Copyright © 2006 John Wiley & Sons, Ltd.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www.interscience.wiley.com/jpages/1532-0626/en_US
dc.relation.ispartofConcurrency Computation Practice and Experienceen_US
dc.subjectClub Theoryen_US
dc.subjectCost-Benefit Analysisen_US
dc.subjectGrid Computingen_US
dc.subjectProbabilistic Analysisen_US
dc.subjectRandomized Algorithmen_US
dc.titleClub theory of the Griden_US
dc.typeArticleen_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1002/cpe.1027en_US
dc.identifier.scopuseid_2-s2.0-33750883118en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33750883118&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume18en_US
dc.identifier.issue14en_US
dc.identifier.spage1759en_US
dc.identifier.epage1773en_US
dc.identifier.isiWOS:000242113300004-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridShi, Y=7404964722en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridTse, SSH=7006643113en_US
dc.identifier.scopusauthoridDu, ZH=7402288638en_US
dc.identifier.scopusauthoridTang, RC=8700718300en_US
dc.identifier.scopusauthoridLi, S=7409239591en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats