| Author: | Cheung, King-cheung |
| Title: | The design and implementation of a reliable monitor construct for distributed programming |
| Degree: | M.Phil. |
| Year: | 2002 |
| Subject: | Parallel programming (Computer science) Electronic data processing -- Distributed processing Computer algorithms Hong Kong Polytechnic University -- Dissertations |
| Department: | Department of Computing |
| Pages: | 159 leaves : ill. ; 30 cm |
| Language: | English |
| Abstract: | Being a structured and flexible language-level programming construct for centralized multi-programming environment, the monitor construct can be extended as a good facility for high-level, structured distributed synchronization. This project is concerned with extending the monitor concept to programming distributed systems. It aims to develop an application-level distributed monitor construct for programming in a large-scale distributed system such as the Internet computing environment. The distributed monitor construct we developed is based on a well-known tree-based distributed mutual exclusion algorithm proposed by K. Raymond in 1989. Raymond's algorithm is used extensively because it is relatively easy to adapt to a large-scale distributed system such as the Internet, which is our target programming environment. In order to increase the scalability, a two-level system structure is used in our distributed monitor construct: the node level which controls access to the system-wide shared resource using Raymond's algorithm and the process level which synchronizes local processes based on the local monitor concept. Thus, distributed mutual exclusion of node accesses is ensured at the node level while local mutual exclusion of process requests is guaranteed at the process level. With this mutual exclusion hierarchy, processes and nodes are now distinguishable; this eliminates all possible redundant request messages induced by the original system structure. A prototype of the two-level distributed monitor construct has been implemented using JAVA2TM. Raymond's algorithm cannot handle dynamic node joining and leaving and the failures of consecutive neighboring nodes. We have proposed an adaptive and robust tree configuration scheme, which extends the capabilities of the distributed monitor construct so that it becomes scalable and fault-tolerant. This scheme operates on its own, and can cooperate with Raymond's algorithm to ensure distributed mutual exclusion, to adopt new and remove existing nodes, and to handle node failures. This feature decreases the interference of each other and increases the dependency of both running mechanisms. |
| Rights: | All rights reserved |
| Access: | open access |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b16576494.pdf | For All Users | 8.48 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/951