Costs and Benefits of Load Sharing in the Computational Grid

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Costs and Benefits of Load Sharing in the Computational Grid

Published Date

2003-08-26

Publisher

Type

Report

Abstract

We present an analysis of the costs and benefits of load sharing of parallel jobs in the computational grid. We begin with a workload generation model that captures the essential properties of parallel jobs and use it as input to a grid simulation model. Our experiments are performed for both homogeneous and heterogeneous grids. We measured average job slowdown with respect to both local and remote jobs and we show that, with some reasonable assumptions concerning the migration policy, load sharing proves to be beneficial when the grid is homogeneous, and that load sharing can adversely affect job slowdown for lightly-loaded machines in a heterogeneous grid. With respect to the number of sites in a grid, we find that the benefits obtained by load sharing do not scale well. Small to modest-size grids can employ load sharing as effectively as large-scale grids. We also present and evaluate an effectivescheduling heuristic for migrating a job within the grid.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Technical Report; 03-033

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

England, Darin; Weissman, Jon. (2003). Costs and Benefits of Load Sharing in the Computational Grid. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215576.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.