Figure 2. Lamport's algorithm-Optimization of Distributed Systems Using Multi-Agent Systems with Virtual Time
| Main Authors: | Ioana Alexandra Pandele, Alina Mihaela Patriciu |
|---|---|
| Format: | info Image eJournal |
| Bahasa: | eng |
| Terbitan: |
, 2010
|
| Subjects: | |
| Online Access: |
https://www.edusoft.ro/brain/index.php/brain/issue/view/2 |
Daftar Isi:
- In order to synchronize logical clocks, Lamport [3] defined the relationship “happened before” (preceded) which implies that the expression 1 2 a → a means “ 1 a occurred before 2 a ”, and it means that all the processes coincide in the fact that 1 a took place first, and subsequently 2 a took place. This relation can be directly observed in two situations (figure 2): 1. If two events happen during the same process, the order of the happening is indicated by the common clock; 2. When two processes communicate through a message, the event that corresponds to sending the precise message always happens before the event of receiving it (i.e. the message).