Cost-effective data-parallel load balancing

PDF Version Also Available for Download.

Description

Load balancing algorithms improve a program`s performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-effective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon renderer show a performance improvement of up to a factor of 33 on unbalanced datasets and a maximum performance loss of only 27 percent on balanced datasets when using this algorithm.

Physical Description

17 p.

Creation Information

Hansen, C.D. & Ahrens, J.P. May 1, 1995.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

  • Hansen, C.D. Los Alamos National Lab., NM (United States)
  • Ahrens, J.P. Washington Univ., Seattle, WA (United States). Dept. of Computer Science and Engineering

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

Load balancing algorithms improve a program`s performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-effective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon renderer show a performance improvement of up to a factor of 33 on unbalanced datasets and a maximum performance loss of only 27 percent on balanced datasets when using this algorithm.

Physical Description

17 p.

Notes

OSTI as DE95010985

Source

  • International conference on parallel processing, Madison, WI (United States), 14-18 Aug 1995

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE95010985
  • Report No.: LA-UR--95-1462
  • Report No.: CONF-9508112--1
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 65031
  • Archival Resource Key: ark:/67531/metadc708191

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • May 1, 1995

Added to The UNT Digital Library

  • Sept. 12, 2015, 6:31 a.m.

Description Last Updated

  • Feb. 29, 2016, 8:47 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 2

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Hansen, C.D. & Ahrens, J.P. Cost-effective data-parallel load balancing, article, May 1, 1995; New Mexico. (digital.library.unt.edu/ark:/67531/metadc708191/: accessed August 19, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.