Reducing communication overhead in a dynamic load sharing algorithm

Little research has been performed to reduce communication overhead, associated with load state information collection, in dynamic load sharing for distributed systems. This is due to the assumption that such overhead can be considered negligible compared to the overhead associated with the transfer...

Full description

Saved in:
Bibliographic Details
Main Author: Baraka, Rebhi S.
Format: text
Language:English
Published: Animo Repository 1996
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/1718
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_masteral-8556
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_masteral-85562021-02-08T04:01:13Z Reducing communication overhead in a dynamic load sharing algorithm Baraka, Rebhi S. Little research has been performed to reduce communication overhead, associated with load state information collection, in dynamic load sharing for distributed systems. This is due to the assumption that such overhead can be considered negligible compared to the overhead associated with the transfer of work load [CABR86, MIRC89]. However, this communication overhead is considered to be a major disadvantage of dynamic load sharing [SHIR95]. It may negate the benefits of load sharing and degrade system performance [EAGE86, JUAN86, QIAN94]. Thus, a better dynamic load sharing algorithm must reduce the communication overhead caused by information collection [XU93]. A new load sharing algorithm with reduced communication overhead is presented. It is based on a general approach and a model of distributed control for the coordination among cooperating processes with minimum communication overhead. The approach, as employed by the algorithm, is to replicate (disseminate) the load information of a node to other nodes, to relax the copy consistency constraints resulting from the replication, and to make each node treat the information it has about other nodes, which may be outdated due to unpredictable communication delays, as an estimate of the global state, and hence use it for load sharing decisions. The algorithm incurs less communication overhead than an algorithm based on the bidding approach. The algorithm is distributed, dynamic, nonpreemptive, and cooperative. 1996-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_masteral/1718 Master's Theses English Animo Repository Algorithms Dymanic programming Electronic data processing -- Distributed processing Programming (Electronic computers) Information theory Communication Computer Sciences
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Algorithms
Dymanic programming
Electronic data processing -- Distributed processing
Programming (Electronic computers)
Information theory
Communication
Computer Sciences
spellingShingle Algorithms
Dymanic programming
Electronic data processing -- Distributed processing
Programming (Electronic computers)
Information theory
Communication
Computer Sciences
Baraka, Rebhi S.
Reducing communication overhead in a dynamic load sharing algorithm
description Little research has been performed to reduce communication overhead, associated with load state information collection, in dynamic load sharing for distributed systems. This is due to the assumption that such overhead can be considered negligible compared to the overhead associated with the transfer of work load [CABR86, MIRC89]. However, this communication overhead is considered to be a major disadvantage of dynamic load sharing [SHIR95]. It may negate the benefits of load sharing and degrade system performance [EAGE86, JUAN86, QIAN94]. Thus, a better dynamic load sharing algorithm must reduce the communication overhead caused by information collection [XU93]. A new load sharing algorithm with reduced communication overhead is presented. It is based on a general approach and a model of distributed control for the coordination among cooperating processes with minimum communication overhead. The approach, as employed by the algorithm, is to replicate (disseminate) the load information of a node to other nodes, to relax the copy consistency constraints resulting from the replication, and to make each node treat the information it has about other nodes, which may be outdated due to unpredictable communication delays, as an estimate of the global state, and hence use it for load sharing decisions. The algorithm incurs less communication overhead than an algorithm based on the bidding approach. The algorithm is distributed, dynamic, nonpreemptive, and cooperative.
format text
author Baraka, Rebhi S.
author_facet Baraka, Rebhi S.
author_sort Baraka, Rebhi S.
title Reducing communication overhead in a dynamic load sharing algorithm
title_short Reducing communication overhead in a dynamic load sharing algorithm
title_full Reducing communication overhead in a dynamic load sharing algorithm
title_fullStr Reducing communication overhead in a dynamic load sharing algorithm
title_full_unstemmed Reducing communication overhead in a dynamic load sharing algorithm
title_sort reducing communication overhead in a dynamic load sharing algorithm
publisher Animo Repository
publishDate 1996
url https://animorepository.dlsu.edu.ph/etd_masteral/1718
_version_ 1712574976430702592