Random Articles
Reseach Article
Partial Temporal Ordering in Distributed Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 53 - Number 12 |
| Year of Publication: 2012 |
| Authors: Soumen Saha, Utpal Roy |
10.5120/8475-2404
|
Soumen Saha, Utpal Roy . Partial Temporal Ordering in Distributed Network. International Journal of Computer Applications. 53, 12 ( September 2012), 29-33. DOI=10.5120/8475-2404
Abstract
As communication is important, it is not the entire thing rather something more interesting as well as complicated. Closely related is how processes cooperate and synchronize with one another. In a distributed system an application may have several processes that run concurrently on multiple nodes of the system. For correct results, several such distributed applications require that the clocks of the nodes are synchronized with each other. For concurrency we have used vector clock method . But there are several disadvantages. For that we have developed a new algorithm for vector clock method from which we can define the concurrency among processes. In our proposed algorithm the vector of each process's local clock consists of (n+1) parameter where n is the number of processes in the system. The (n+1) th parameter is used as a flag which help to discuss the concurrency among different processes.
References
- L. Lamport, "Time, Clocks and the ordering of Events in a Distributed System," Comm. ACM. Vol 21, No. 7 , July 1978, pp 558-565.
- A. S. Tanenbaum and M. V. Steen Distributed System : Principles and Paradigms (2nd Edition)
- V. Kanakaris, D. Ndzi and D. Azzi, Ad-hoc Networks Energy Consumption: A review of the Ad-Hoc Routing Protocols Journal of Engineering Science and Technology Review 3 (1) (2010) 162-167
- S W Smith and J D Tygar, "Signed Vector Timestamps A Secure Protocol for Partial Order Time", Carnegie Mellon Computer Science Technical Report CMU-CS-93-116(1993) .
- PVM ( Parallel Virtual Machine)A Users' Guide and Tutorial for Networked Parallel Computing; http://www. netlib. org/pvm3/book/pvm-book. html.
- L Lamport, P M Melliar-Smith , Byzantine Clock Synchronization: Proceedings of the third annual ACM symposium on Principles of distributed computing PODC 84 (1984).
- F. J. Torres-Rojas and M. Ahamad, " Plausible Clocks: Constant Size Logical Clocks for Distributed System," Proc. 10th Int'l Workshop Distributed Algorithms, Springer Verlag, New York, 1996, pp71-88.
- R. Baldoni and G. Melideo, Tradeoffs in Message overhead versus Detection Tim in Causality Tracking, tech, report 06-01, Dipartimento di Informaticae Sistemistica, Univ. of Rome, 2000.
Index Terms
Keywords