Home »
Academic Articles & Research Papers
Showing 20 of 4,465 academic articles
John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, Thomas E. Anderson et al. (2008)
Internet routing protocols (BGP, OSPF, RIP) have traditionally favored responsiveness over consistency. A router applies a received update immediately to its forwarding table before propagating the update to other routers, including those t...
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
Robert J. Stroud • ACM SIGOPS Operating Systems Review
(1993)
The recursive composition of systems to form functionally equivalent transparently distributed systems is an important paradigm for constructing distributed systems. The extent to which such recursive transparency can be achieved depends cr...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/155848.155866
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
Michael J. Butler, Marina Waldén • ePrints Soton (University of Southampton)
(1996)
The B-Method is a method for the stepwise derivation of sequential programs. In this paper we show how the B-Method can be used for designing distributed systems by embedding action systems within this method. The action system formalism is...
OPENALEX
Jeff Kramer, Jeff Magee, Morris S. Sloman • ACM SIGOPS European Workshop
(1992)
Distributed systems are constructed from a set of computational components which are bound together to interact and communicate to achieve some over all objective. In this paper, we examine the issues related to system configuration, partic...
OPENALEX
DOI: https://doi.org/10.1145/506378.506406
Ken Birman, Thomas Joseph • ACM eBooks
(1990)
Techniques are examined for replicating data and execution in directly distributed systems: systems in which multiple processes interact directly with one another while continuously respecting constraints on their joint behavior. Directly d...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/90417.90751
X. Zhang, Jeffrey L. Freschl, Jennifer M. Schopf • ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)
(2004)
Monitoring and information services form a key component of a distributed system, or Grid. A quantitative study of such services can aid in understanding the performance limitations, advise in the deployment of the monitoring system, and he...
OPENALEX
Open Access
DOI: https://doi.org/10.1109/hpdc.2003.1210036
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
Héctor García-Molina, Daniel Barbará • Journal of the ACM
(1985)
In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/4221.4223
Doug Terry • IEEE Transactions on Software Engineering
(1987)
Caching reduces the average cost of retrieving data by amortizing the lookup cost over several references to the data. Problems with maintaining strong cache consistency in a distributed system can be avoided by treating cached information ...
OPENALEX
DOI: https://doi.org/10.1109/tse.1987.232834
Henri E. Bal, M. Frans Kaashoek, Andrew S. Tanenbaum • IEEE Transactions on Software Engineering
(1992)
A detailed description is given of the Orca language design and the design choices are discussed. Orca is intended for applications programmers rather than systems programmers. This is reflected in its design goals to provide a simple, easy...
OPENALEX
Open Access
DOI: https://doi.org/10.1109/32.126768
Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno et al. • ACM Symposium on Principles of Distributed Computing (PODC)
(2004)
We analyze replication of resources by server nodes that act selfishly, using a game-theoretic approach. We refer to this as the selfish caching problem. In our model, nodes incur either cost for replicating resources or cost for access to ...
OPENALEX
DOI: https://doi.org/10.1145/1011767.1011771
Lik Mui, Mojdeh Mohtashemi, Cheewee Ang, Peter Szolovits et al. • DSpace@MIT (Massachusetts Institute of Technology)
(2002)
For distributed systems at large and e-commerce systems in particular, ratings play an increasingly important role. Ratings confer reputation measures about sources. This paper reports our formalization of the rating process. This paper arg...
OPENALEX
cc-by-nc
M. Amouroux, A. El Jai, El Hassan Zerrik • International Journal of Systems Science
(1994)
The aim of this paper is to develop the concept of regional observability for distributed systems. This original concept is closer to practical considerations since it only requires the observation of the state on a given subregion. We show...
OPENALEX
DOI: https://doi.org/10.1080/00207729408928961
Ioannis Georgiadis, Jeff Magee, Jeff Kramer • Workshop on Self-healing systems
(2002)
A self-organising software architecture is one in which components automatically configure their interaction in a way that is compatible with an overall architectural specification. The objective is to minimise the degree of explicit manage...
OPENALEX
DOI: https://doi.org/10.1145/582128.582135
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
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
Harish K. Pillai, Shiva Shankar • SIAM Journal on Control and Optimization
(1999)
This paper develops a theory of control for distributed systems (i.e., those defined by systems of constant coefficient partial differential operators) via the behavioral approach of Willems. The study here is algebraic in the sense that it...
OPENALEX
DOI: https://doi.org/10.1137/s0363012997321784
Gul Agha • DSpace@MIT (Massachusetts Institute of Technology)
(1986)
A foundational model of concurrency is developed in this thesis. It examines issues in the design of parallel systems and show why the actor model is suitable for exploiting large-scale parallelism. Concurrency in actors is constrained only...
OPENALEX
cc-by-nc