Change search
ReferencesLink to record
Permanent link

Direct link
Design and Evaluation of a Decentralized System for Grid-wide Fairshare Scheduling
Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N).
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2005 (English)In: Proceedings of the First International Conference on e-Science and Grid Computing (e-Science’05), USA, Los Alamitos: IEEE Computer Society Press , 2005, 221-229 p.Conference paper (Refereed)
Abstract [en]

This contribution presents a decentralized architecture for a grid-wide fairshare scheduling system and demonstrates its potential in a simulated environment. The system, which preserves local site autonomy, enforces locally and globally scoped share policies, allowing local resource capacity as well as global grid capacity to be logically divided across different groups of users. The policy model is hierarchical and subpolicy definition can be delegated so that, e.g., a VO that has been granted a resource share can partition its share across its projects, which in turn can divide their shares between project members. There is no need for a central coordinator as policies are enforced collectively by the resource schedulers. Each local scheduler adopts a grid-wide view on utilization in order to steer local resource utilization to not only maintain local resource shares but also to contribute to maintaining global shares across the entire set of grid resources. Share enforcement is addressed by an algorithm that calculates simple priority values, thus simplifying integration with local schedulers, which can remain unaware of the hierarchical share policy structure

Place, publisher, year, edition, pages
USA, Los Alamitos: IEEE Computer Society Press , 2005. 221-229 p.
National Category
Computer Science
Research subject
Computing Science
URN: urn:nbn:se:umu:diva-9622DOI: 10.1109/E-SCIENCE.2005.27OAI: diva2:149293
First International Conference on e-Science and Grid Computing, 1 july 2005
Available from: 2008-05-05 Created: 2008-05-05 Last updated: 2013-03-18Bibliographically approved
In thesis
1. Capacity allocation mechanisms for grid environments
Open this publication in new window or tab >>Capacity allocation mechanisms for grid environments
2006 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

During the past decade, Grid computing has gained popularity as a means to build powerful computing infrastructures by aggregating distributed computing capacity. Grid technology allows computing resources that belong to different organizations to be integrated into a single unified system image – a Grid. As such, Grid technology constitutes a key enabler of large-scale, crossorganizational sharing of computing resources. An important objective for the Virtual Organizations (VOs) that result from such sharing is to tame the distributed capacity of the Grid in order to manage it and make fair and efficient use of the pooled computing resources.

Most Grids to date have, however, been completely unregulated, essentially serving as a “source of free CPU cycles” for authorized Grid users. Whenever unrestricted access is admitted to a shared resource there is a risk of overexploitation and degradation of the common resource, a phenomenon often referred to as “the tragedy of the commons”. This thesis addresses this problem by presenting two complementary Grid capacity allocation systems that allow the aggregate computing capacity of a Grid to be divided between users in order to protect the Grid from overuse while delivering fair service that satisfies the individual computational needs of different user groups.

These two Grid capacity allocation mechanisms constitute the core contribution of this thesis. The first mechanism, the SweGrid Accounting System (SGAS), addresses the need for coordinated soft, real-time quota enforcement across Grid sites. The SGAS project was an early adopter of the serviceoriented principles that are now common practice in the Grid community, and the system has been tested in the Swegrid production environment. Furthermore, SGAS has been included in the Globus Toolkit, the de-facto standard Grid middleware toolkit. SGAS employs a credit-based allocation model where research projects are granted quota allowances that can be spent across the Grid resources, which charge users for their resource consumption. This enforcement of usage limits thus produces real-time overuse protection.

The second approach, employed by the Fair Share Grid (FSGrid) system, uses a share-based allocation model where project entitlements are expressed in terms of hierarchical share policies that logically divide the Grid capacity between user groups. By coordinating local job scheduling to maintain these global capacity shares, the Grid resources collectively strive to schedule users for a “share of the Grid”. We refer to this cooperative scheduling model as decentralized Grid-wide fairshare scheduling.

Place, publisher, year, edition, pages
Umeå: Datavetenskap, 2006. 34 p.
Report / UMINF, ISSN 0348-0542 ; 06.38
Grid computing, capacity allocation, allocation enforcement, accounting, Grid-wide fairshare scheduling, Web services
National Category
Computer Science
urn:nbn:se:umu:diva-927 (URN)91-7264-216-5 (ISBN)
Available from: 2006-11-14 Created: 2006-11-14 Last updated: 2012-05-14Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Elmroth, ErikGardfjäll, Peter
By organisation
Department of Computing ScienceHigh Performance Computing Center North (HPC2N)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 48 hits
ReferencesLink to record
Permanent link

Direct link