CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Modifications in Lamport Algorithm for Distributed Computing System

by Taskeen Zaidi, Vipin Saxena
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 6
Year of Publication: 2012
Authors: Taskeen Zaidi, Vipin Saxena
10.5120/8425-2181

Taskeen Zaidi, Vipin Saxena . Modifications in Lamport Algorithm for Distributed Computing System. International Journal of Computer Applications. 53, 6 ( September 2012), 28-35. DOI=10.5120/8425-2181

@article{ 10.5120/8425-2181,
author = { Taskeen Zaidi, Vipin Saxena },
title = { Modifications in Lamport Algorithm for Distributed Computing System },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 6 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 28-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number6/8425-2181/ },
doi = { 10.5120/8425-2181 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:53:25.273864+05:30
%A Taskeen Zaidi
%A Vipin Saxena
%T Modifications in Lamport Algorithm for Distributed Computing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 6
%P 28-35
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In the current scenario, distributed approach of computing is very popular over the centralized approach of computing due to faster execution of processes; cut off the execution time of processes and cost. In the year 1978, Lamport [6] has proposed an approach for synchronization of processes under distributed environment which has the limitations for reordering and executing the events of the processes by using time, ordering of events and clock conditions. The important limitation is that the algorithm does not cover the process execution in reflexive, symmetric and transitive manners when the unidirectional or bidirectional ring is appearing in the distributed network for executing the processes and sharing the common resources under distributed environment. The present work will focus on these aspects and processor can execute the events of processes either on its node called as computer system in the reflexive manner and if the current node is busy for other tasks then it can use the next promising node under the defined topology and can be executed by using symmetric property and if further second node is busy then events can be transmitted to next promising node and these are executed in the transitive manner and the output is transferred to the first node. These aspects are demonstrated by proposing a new kind of topology called as step topology in which numbers of computer systems are attached in the distributed network. Algorithms are designed for all these three cases by considering the definitions of process and thread. Since one computer system can interact with another computer system with message passing technique under distributed environment, therefore, message complexities in all these cases are also measured and compared with Lamport and other similar kinds of algorithms available for distributed computing system.

References
  1. Siberschatz, A. and Galvin, P. B. , 2000, Operating Systems Concepts, 5th Edition, John Wiley and Sons, Inc. D. D. L. L. D.
  2. Siberschatz, A. and Peterson, J. L. , 1988, Operating System Concepts, Addison–Wesley, Alternate Edition.
  3. Andrew S. Tanenbaum, 1995, Distributed Operating Systems, Prentice Hall.
  4. Hwang, K. 1993, Advanced Computer Architecture, McGraw-Hill Series in Computer Engineering, Inc Publishing.
  5. Milenkovic, M. , 1997, Operating Systems: Concepts and Design,Tata Mcgraw-Hill.
  6. Lamport, L. , 1978, Time, Clocks and Ordering of Events in a Distributed System, Communications of ACM, Vol. 21, No. 7, pp. 558-565.
  7. Ricart, G. and Agrawala, A. , 1981, An Optimal Algorithm for Mutual Exclusion in Computer Networks, Communications of the ACM, Vol. 24, No. 1, pp. 9-17.
  8. Maekawa, M. , 1985, A sqrt(n) Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems,Vol. 3, No. 2, pp. 145-159
  9. Agrawal, D. and El Abbadi, A. , 1991, An efficient and fault tolerant solution for distributed mutual exclusion, ACM Transactions on Computer Systems, Vol. 9, No. 1, pp. 1-20.
  10. Suzuki, I. and Kasami ,T. ,1985, A Distributed Mutual Exclusion Algorithm, ACM Transactions on Computer Systems,Vol. 3,No. 4, pp. 344-349.
  11. Raymond K. ,1989,A Tree Based Algorithm for Distributed Mutual Exclusion, ACM Transactions on Computer Systems,Vol. 7,No. 1, pp. 61-77.
  12. Kawsar, F. , Shaikot, S. H. , Saikat, S. and Mottalib, M. , A. , 2002, An efficient Token Based Algorithm for Mutual Exclusion in Distributed System, Proceedings of 5th International Conference on Computer and Information Technology (ICCIT 2002), pp. 93-96, Dhaka, Bangladesh.
  13. Chakraborty ,R. N. and Yaprak, E. , 1993, Improve-ment in Reliability of the Token Ring Network by Reversal of Token in case of a Single Component Failure, Circuits and Systems, IEEE, Proceedings of the 36th Midwest Symposium on vol. 2,Issue,16-18, pp. 1152-1154.
  14. Minar N, 2002, Distributed System Topologies Part 1 and Part 2, Retrieved on June 19, 2012 from http://www. open2p. com/lpt/a/1461.
  15. Androutsellis –Theotokis S and Spinelis D, 2004, A Survey for peer to peer Content Distribution Technologies, ACM Press, New York ,U. S.
  16. Habib, S. J, 2005, Simulated Analysis of Server Placement on Network Topology Design, Proceedings of the 3rd ACS/IEEE International Conference on Computer Systems and Application, Cairo Egypt, pp. 80-87.
  17. Zhang, H. L. , Leung, H. C. and Raikundalia, G. K. , Performance Analysis of Network Topologies in Agent Based Open Connectivity Architecture for DSS, Available online on Google Search Engine, Retrieved on June 19, 2012.
  18. Pllana, S. and T. Fahringer , 2002,UML Based Modeling of Performance Oriented Parallel and Distributed Applications, Winter Simulation Conference, Retrieved on June 19, 2012.
  19. Gomma, H. , 2001, "Designing Concurrent, Distributed, and Real-Time Applications with UML", Proceedings of the 23rd International Conference on Software Engineering (ICSE'01), IEEE Computer Society.
  20. Saxena, V. and Arora, D. , 2008 "UML Modeling of a Protocol for Establishing Mutual Exclusion in Distributed Computer System, International Journal of Computer Science and Network Security,Vol. 8, No. 6, pp. 227-235.
  21. Saxena, V. , Arora, D. and Ahmad S. , 2007, Object Oriented Distributed Architecture System through UML, Conference IEEE, International Conference on Advances in Computer Vision and Information Technology, ACVIT-07, ISBN 97881-89866-74-7, pp. 305-310.
  22. Martinez Jesus, Merino Pedro and Solmeron Alberto, 2007, "Applying MDE Methodologies to Design Communication Protocols for Distributed Systems", IEEE Transactions of Software Engineering, April.
  23. Drozowski ,M, 2002, Estimating Execution Time of Distributed Application, Parallel Processing and Applied Mathematics, 4th International Conference PPAM, LNCS 2328, Springer-Verlag, pp 137-142.
  24. Helsinger, A. , Lazarus, R. , W. , Wright, W. and Zinnky, J. , 2003, Tools and Techniques for Performance Measurement of Large Distributed Multi Agent System, Proceedings of AAMAS 03 Conference, Australia, pp. 843-850.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed approach Bidirectional ring Message Complexity Step topology and Lamport algorithm

Powered by PhDFocusTM