Show simple item record

dc.creatorMorsy, Hazem Kamal
dc.date.accessioned2012-06-07T22:49:51Z
dc.date.available2012-06-07T22:49:51Z
dc.date.created1997
dc.date.issued1997
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-M69
dc.descriptionDue to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item.en
dc.descriptionIncludes bibliographical references: p.111-114.en
dc.descriptionIssued also on microfiche from Lange Micrographics.en
dc.description.abstractDistributed systems have become a popular computing environment. Due to their high potentials in improving performance and resource sharing, the evolution and maturing of technologies such as networks and computer hardware, have led to more realizations of distributed computing capabilities. One of the key factors that impacts the system's performance is how load sharing is handled. Most of the work done in load sharing algorithms focused on either one of two approaches: the static approach, or the dynamic approach. Static load sharing is characterized with its simplicity and minimal overhead induced on the system when performing load distribution. This is attributed to the fact that their load sharing decisions do not require any information exchange between nodes. However, static algorithms are not capable of adapting to traffic changes. Hence, this will affect the distributed system adaptability and stability features against load alteration. The second approach in load sharing algorithums is the dynamic approach. In this approach, nodes base their sharing decisions on the knowledge of the status on other nodes. This knowledge enables nodes to make improved decisions when selecting a remote execution site. Therefore, these algorithms provide the distributed system with adaptability and stability. Nevertheless, information exchange between nodes has proven to be expensive. The problem lies in the communication and processing overheads which these algorithms impose on the system. This research work presents a Semi-Adaptive load sharing approach that attempts to lay a common ground between the dynamic and the static approaches. This approach provides the system with adaptability features at are supplied with tools to control the level of adaptability and information exchange in the system. It is argued that this approach is adaptable, scalable, stable, fault tolerant, and will generate low and controlled system overheads. Two implementations of the Semi-Adaptive approach are presented: The Controller Load Sharing Protocol (CLSP) and The Pool Load Sharing Protocol (PLSP). The study of CLSP and PLSP include simulating their performance under various conditions. The simulation include comparing the performance of these two protocols against two load sharing algorithms representing the static and dynamic families. Furthermore, the properties of CLSP and PLSP are investigated. Finally, based on the study and analysis of both protocols, the research work proposes possible areas of improvement in the final conclusion.en
dc.format.mediumelectronicen
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherTexas A&M University
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.subjectcomputer science.en
dc.subjectMajor computer science.en
dc.titleA new generation of load sharing algorithms: the semi-adaptive load sharing algorithmen
dc.typeThesisen
thesis.degree.disciplinecomputer scienceen
thesis.degree.nameM.S.en
thesis.degree.levelMastersen
dc.type.genrethesisen
dc.type.materialtexten
dc.format.digitalOriginreformatted digitalen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access