Home »
Academic Articles & Research Papers
Showing 20 of 2,650 academic articles
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
J.L. Kim, T. Park • IEEE Transactions on Parallel and Distributed Systems
(1993)
The authors present an efficient synchronized checkpointing protocol that exploits the dependency relation between processes in distributed systems. In this protocol, a process takes a checkpoint when it knows that all processes on which it...
OPENALEX
DOI: https://doi.org/10.1109/71.238629
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Roşu • ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)
(2004)
This paper presents a variant of past time linear temporal logic, called PT-DTL, suitable for expressing temporal properties of distributed systems. The formulae in this logic are given with respect to a particular process and are interpret...
OPENALEX
DOI: https://doi.org/10.1109/icse.2004.1317464
Qiang Fu, Jian–Guang Lou, Yi Wang, Li Jiang • Proceedings
(2009)
Detection of execution anomalies is very important for the maintenance, development, and performance refinement of large scale distributed systems. Execution anomalies include both work flow errors and low performance problems. People often...
OPENALEX
DOI: https://doi.org/10.1109/icdm.2009.60
Gérard Tel • Cambridge University Press eBooks
(2000)
The earlier parts of this book studied the coordinated behavior that can be achieved in distributed systems where processes are reliable . For several reasons it is attractive to study what coordinated behavior of processes is possible unde...
OPENALEX
Open Access
DOI: https://doi.org/10.1017/cbo9781139168724.014
Ivan Beschastnikh, Perry Liu, Albert Xing, Patty Wang et al. • ACM Transactions on Software Engineering and Methodology
(2020)
Distributed systems pose unique challenges for software developers. Understanding the system’s communication topology and reasoning about concurrent activities of system hosts can be difficult. The standard approach, analyzing system logs, ...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/3375633
Masoud Mansouri-Samani, Morris S. Sloman • IEEE Network
(1993)
It is suggested that a functional model of monitoring in terms of the generation, processing, dissemination, and presentation of information can help determine the facilities needed to design and construct distributed systems. Implementatio...
OPENALEX
DOI: https://doi.org/10.1109/65.244791
Mark A. Paskin, Carlos Guestrin • arXiv (Cornell University)
(2012)
Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to ...
OPENALEX
Open Access
DOI: https://doi.org/10.48550/arxiv.1207.4174
Masoud Mansouri-Samani, Morris S. Sloman • Distributed Systems Engineering
(1997)
Event-based monitoring is critical for managing and debugging networks and distributed systems. This paper presents GEM - an interpreted generalized event monitoring language. It allows high-level, abstract events to be specified in terms o...
OPENALEX
Open Access
DOI: https://doi.org/10.1088/0967-1846/4/2/004
Peter Michael Melliar-Smith, L.E. Moser, Vivek Agrawala • IEEE Transactions on Parallel and Distributed Systems
(1990)
An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The approach is based on broadcast communicati...
OPENALEX
DOI: https://doi.org/10.1109/71.80121
Arup Abhinna Acharya, B. R. Badrinath (1991)
This paper presents an eflcient protocol to totally order the delivery of broadcast messages in a distributed system with N sites. The protocol exploits a symmetric communication scheme based on finite projective planes and requires N+2a me...
OPENALEX
S. Landis, Silvano Maffeis • Theory and Practice of Object Systems
(1997)
New classes of large-scale distributed applications will have to deal with unpredictable communication delays, with partial failures, and with networks that partition. In addition, sophisticated applications such as teleconferencing, video-...
OPENALEX
DOI: https://doi.org/10.1002/(sici)1096-9942(1997)3:1<31::aid-tapo4>3.0.co;2-a
James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock et al. • ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
(2015)
Distributed systems are difficult to implement correctly because they must handle both concurrency and failures: machines may crash at arbitrary points and networks may reorder, drop, or duplicate packets. Further, their behavior is often t...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/2737924.2737958
Sukumar Ghosh • Chapman & Hall/CRC eBooks
(2006)
Most applications in distributed computing center around a set of common subproblems. Distributed Systems: An Algorithmic Approach presents the algorithmic issues and necessary background theory that are needed to properly understand these ...
OPENALEX
DOI: https://doi.org/10.1201/9781420010848
Wen-Ke Chen, Matti A. Hiltunen, Richard D. Schlichting • Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems
(2002)
Adaptive software that can react to changes in the execution environment or user requirements by switching algorithms at run time is powerful yet difficult to implement, especially in distributed systems. This paper describes a software arc...
OPENALEX
DOI: https://doi.org/10.1109/icdsc.2001.918994
Michel Raynal, Mukesh Singhal • Computer
(1996)
Causality is vital in distributed computations. Distributed systems can determine causality using logical clocks. Human beings use the concept of causality to plan, schedule, and execute an enterprise, or to determine a plan's feasibility. ...
OPENALEX
DOI: https://doi.org/10.1109/2.485846
Marc Shapiro (1986)
We present a novel view of the structuring of distributed systems, and a few examples of its utilization in an object-oriented context. In a distributed system, the structure of a service or subsystem may be complex, being implemented as a ...
OPENALEX
Open Access
Mukesh Singhal • Computer
(1989)
The author describes a series of deadlock detection techniques based on centralized, hierarchical, and distributed control organizations. The point of view is that of practical implications. An up-to-date and comprehensive survey of deadloc...
OPENALEX
DOI: https://doi.org/10.1109/2.43525
Jeffrey J. Joyce, Greg Lomow, Konrad L. Slind, Brian W. Unger • ACM Transactions on Computer Systems
(1987)
The monitoring of distributed systems involves the collection, interpretation, and display of information concerning the interactions among concurrently executing processes. This information and its display can support the debugging, testin...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/13677.22723
• Issues in Information Systems
(2024)
Small and Medium-sized Enterprises (SMEs) all over the world are the very heart of economic growth.SMEs drive economic growth worldwide.However, unlike most behemoths, they lack the resources and experience to tackle cybersecurity threats c...
OPENALEX
cc-by-nc-nd
DOI: https://doi.org/10.48009/1_iis_2024_120