File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/cpe.1027
- Scopus: eid_2-s2.0-33750883118
- WOS: WOS:000242113300004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Club theory of the Grid
Title | Club theory of the Grid |
---|---|
Authors | |
Keywords | Club Theory Cost-Benefit Analysis Grid Computing Probabilistic Analysis Randomized Algorithm |
Issue Date | 2006 |
Publisher | John 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? |
Abstract | The 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 Identifier | http://hdl.handle.net/10722/152347 |
ISSN | 2023 Impact Factor: 1.5 2023 SCImago Journal Rankings: 0.533 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shi, Y | en_US |
dc.contributor.author | Lau, FCM | en_US |
dc.contributor.author | Tse, SSH | en_US |
dc.contributor.author | Du, ZH | en_US |
dc.contributor.author | Tang, RC | en_US |
dc.contributor.author | Li, S | en_US |
dc.date.accessioned | 2012-06-26T06:37:21Z | - |
dc.date.available | 2012-06-26T06:37:21Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.citation | Concurrency Computation Practice And Experience, 2006, v. 18 n. 14, p. 1759-1773 | en_US |
dc.identifier.issn | 1532-0626 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152347 | - |
dc.description.abstract | The 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.language | eng | en_US |
dc.publisher | John Wiley & Sons Ltd. The Journal's web site is located at http://www.interscience.wiley.com/jpages/1532-0626/ | en_US |
dc.relation.ispartof | Concurrency Computation Practice and Experience | en_US |
dc.subject | Club Theory | en_US |
dc.subject | Cost-Benefit Analysis | en_US |
dc.subject | Grid Computing | en_US |
dc.subject | Probabilistic Analysis | en_US |
dc.subject | Randomized Algorithm | en_US |
dc.title | Club theory of the Grid | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_US |
dc.identifier.authority | Lau, FCM=rp00221 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1002/cpe.1027 | en_US |
dc.identifier.scopus | eid_2-s2.0-33750883118 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33750883118&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 18 | en_US |
dc.identifier.issue | 14 | en_US |
dc.identifier.spage | 1759 | en_US |
dc.identifier.epage | 1773 | en_US |
dc.identifier.isi | WOS:000242113300004 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Shi, Y=7404964722 | en_US |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_US |
dc.identifier.scopusauthorid | Tse, SSH=7006643113 | en_US |
dc.identifier.scopusauthorid | Du, ZH=7402288638 | en_US |
dc.identifier.scopusauthorid | Tang, RC=8700718300 | en_US |
dc.identifier.scopusauthorid | Li, S=7409239591 | en_US |
dc.identifier.issnl | 1532-0626 | - |