Home »
Academic Articles & Research Papers
Showing 16 of 16 academic articles
H. R. Vidyashree, Nagu Vadlana, Gokaramaiah Thota • IEEE Access
(2026)
In realistic swarm robotic deployments, inter-robot communication links are inherently dynamic, appearing and disappearing as robots move. Consequently, static connectivity assumptions become invalid. This work extends Collatz graph dynamic...
DOAJ
Open Access (DOAJ)
DOI: 10.1109/ACCESS.2026.3716358
C. A. Latha, H.L. Shashidhara • IEEE International Conference on Industrial and Information Systems (ICIIS)
(2010)
Clock inaccuracies cause serious problems and troublesome in distributed systems. The clocks of different processors need to be synchronized to limit errors. This is to have an efficient communication or resource sharing. Hence the clocks n...
OPENALEX
DOI: https://doi.org/10.1109/iciinfs.2010.5578658
Guohong Cao, Mukesh Singhal • IEEE Transactions on Parallel and Distributed Systems
(1998)
Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers from high overhead associated with the che...
OPENALEX
DOI: https://doi.org/10.1109/71.737697
Abraham Silberschatz • IEEE Transactions on Software Engineering
(1979)
Recent advances in technology have made the construction of general-purpose systems out of many small independent microprocessors feasible. One of the issue's concerning distributed systems is the question of appropriate language constructs...
OPENALEX
DOI: https://doi.org/10.1109/tse.1979.230190
Michel Raynal, Jean-Michel Hélary • International Linear Collider
(1990)
Part 1 Different forms of synchronization between processes: distributed systems, networks, and networks of processes synchronization. Part 2 The concept of a wave, and synchronization by wave train: wave algorithms example of use - computa...
OPENALEX
K. Arvind • IEEE Transactions on Parallel and Distributed Systems
(1994)
Presents and analyzes a new probabilistic clock synchronization algorithm that can guarantee a much smaller bound on the clock skew than most existing algorithms. The algorithm is probabilistic in the sense that the bound on the clock skew ...
OPENALEX
DOI: https://doi.org/10.1109/71.282558
Amritha Sampath, C. Tripti • Advances in intelligent systems and computing
(2012)
OPENALEX
DOI: https://doi.org/10.1007/978-3-642-31513-8_43
Leslie Lamport • ACM Transactions on Programming Languages and Systems
(1984)
A general method is described for implementing a distributed system with any desired degree of faulttolerance.Instead of relying upon explicit timeouts, processes execute a simple clock-driven algorithm.Reliable clock synchronization and a ...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/2993.2994
Parameswaran Ramanathan, Kang Geun Shin, Ricky W. Butler • Computer
(1990)
Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as ...
OPENALEX
DOI: https://doi.org/10.1109/2.58235
Butler Lampson, Marmita Paul, Hans-Jürgen Siegert (1981)
1. Motivations, objectives and characterization of distributed systems.- 2. Distributed system architecture model.- 3. Interprocess communication layer: Introduction.- 4. Hardware interconnection technology.- 5. Link level.- 6. Hierarchy.- ...
OPENALEX
Yuguo Liu, Xiaoxi Mo, Yingzi Gao, Yuan Lu • High-Confidence Computing
(2026)
Dynamic asynchronous Byzantine Fault-Tolerant (BFT) protocols provide strong consistency guarantees in open networks with unbounded communication delays and evolving membership, making them a fundamental building block for long-lived distri...
DOAJ
Open Access (DOAJ)
DOI: 10.1016/j.hcc.2026.100397
Jie Wu • CRC Press eBooks
(2017)
Future requirements for computing speed, system reliability, and cost-effectiveness entail the development of alternative computers to replace the traditional von Neumann organization. As computing networks come into being, one of the lates...
OPENALEX
DOI: https://doi.org/10.1201/9781315141411
Leslie Lamport • ACM eBooks
(2019)
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used ...
OPENALEX
DOI: https://doi.org/10.1145/3335772.3335934
Leslie Lamport • Communications of the ACM
(1978)
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used ...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/359545.359563
Rob Strom, Shaula Yemini • ACM Transactions on Computer Systems
(1985)
Optimistic Recovery is a new technique supporting application-independent transparent recovery from processor failures in distributed systems. In optimistic recovery communication, computation and checkpointing proceed asynchronously. Synch...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/3959.3962
Andrew S. Tanenbaum, Maarten R. van Steen (2001)
From the Publisher:
Andrew Tanenbaum and Maarten van Steen cover the principles, advanced concepts, and technologies of distributed systems in detail, including: communication, replication, fault tolerance, and security. Intended for use i...
OPENALEX