Home »
Academic Articles & Research Papers
Showing 20 of 1,254 academic articles
Vivek S Kale • CRC Press eBooks
(2018)
The origins of big data technologies come from database systems and distributed systems as well as data mining and machine learning algorithms that can process these vast amounts of data to extract the necessary knowledge. This chapter addr...
OPENALEX
DOI: https://doi.org/10.1201/9780429453311-9
Dieter Haban, W. Weigel • Hawaii International Conference on System Sciences (HICSS)
(2003)
A solution to the problem of setting breakpoints in distributed systems is described. It is shown what kind of breakpoints are possible, how to detect those breakpoints, and how to halt the system in a consistent state. The communication am...
OPENALEX
DOI: https://doi.org/10.1109/hicss.1988.11802
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
Bengt Jönsson • ACM Transactions on Programming Languages and Systems
(1994)
We present a method for specification and verification of distributed systems that communicate via asynchronous message passing. The method handles both safety and liveness properties. It is compositional, i.e., a specification of a composi...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/174662.174665
Sukumar Ghosh • Chapman & Hall/CRC eBooks
(2014)
Distributed Systems: An Algorithmic Approach, Second Edition provides a balanced and straightforward treatment of the underlying theory and practical applications of distributed computing. As in the previous version, the language is kept as...
OPENALEX
DOI: https://doi.org/10.1201/b17224
Andreas Bolfing • Oxford University Press eBooks
(2020)
Abstract Chapter 5 considers distributed systems by their properties. The first section studies the classification of software systems, which is usually distinguished in centralized, decentralized and distributed systems. It studies the dif...
OPENALEX
DOI: https://doi.org/10.1093/oso/9780198862840.003.0005
Richard Koo, Sam Toueg • eCommons (Cornell University)
(1986)
We consider the problem of bringing a distributed system to a consistent state after transient failures. We address the two components of this problem by describing a distributed algorithm to create consistent checkpoints, as well as a roll...
OPENALEX
DOI: https://doi.org/10.5555/324493.325074
Jon G. Kuhl, Sudhakar M. Reddy • IEEE International Symposium on Fault-Tolerant Computing
(2005)
The problem of diagnosis of failures, at the system level, in large, truly distributed networks of processing elements is considered. A model proposed earlier, in which nodes of the network perform tests upon certain neighboring nodes and p...
OPENALEX
DOI: https://doi.org/10.1109/ftcsh.1995.532651
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
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
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
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
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
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
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
Audun Jøsang • New Security Paradigms Workshop
(1996)
Research in information security has traditionally focused on where to place or how to propagate trust.In that sense, a cyptographic algorithm or protocol is simply a mechanism to transfer trust from where it exists to where it is needed.Th...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/304851.304877