To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Quorum Based Distributed Mutual System |
|
Author |
M.V.Ramana Murthy, Pradosh Patnaik, M.V.Vijaya Saradhi, V.Venkateswarlu, Ismail, Syed Salahuddin |
| Citation |
Vol. 9 No. 12 pp. 265-267 |
|
Abstract |
The main goal of a distributed computing system is to connect users and resources in a transparent, open, and scalable way. Ideally this arrangement is drastically more fault tolerant and more powerful than many combinations of stand-alone computer systems. Openness is the property of distributed systems such that each subsystem is continually open to interaction with other systems. An open system that scales has an advantage over a perfectly closed and self-contained system. Distributed programming typically falls into one of several basic architectures or categories: Client-server, 3-tier architecture, N-tier architecture, Distributed objects, loose coupling, or tight coupling. In Client-server architecture Smart client code contacts the server for data, then formats and displays it to the user. Input at the client is committed back to the server when it represents a permanent change. Three tier systems move the client intelligence to a middle tier so that stateless clients can be used. This simplifies application deployment. Most web applications are 3-Tier. N-Tier refers typically to web applications, which further forward their requests to other enterprise services. This type of application is the one most responsible for the success of application servers. |
|
Keywords |
DCE, Maekawa's Algorithm, Mutual exclusion, Lamport algorithm and the Ricart-Agrawal algorithm |
|
URL |
