Home »
Academic Articles & Research Papers
Showing 20 of 4,753 academic articles
Colin Fidge • IEEE Software
(1996)
It's difficult to determine event order in distributed systems because of the observability problem. The author discusses this problem and evaluates different strategies for determining arrival order. The author analyzed four time stamping ...
OPENALEX
DOI: https://doi.org/10.1109/52.542297
Ian T Foster, Carl Kesselman, J.M. Nick, Steven John Tuecke • Computer
(2002)
Increasingly, computing addresses collaboration, data sharing, and interaction modes that involve distributed resources, resulting in an increased focus on the interconnection of systems both within and across enterprises. These evolutionar...
OPENALEX
DOI: https://doi.org/10.1109/mc.2002.1009167
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
Keith Marzullo, Susan S. Owicki • ACM SIGOPS Operating Systems Review
(1985)
article Free Access Share on Maintaining the time in a distributed system Authors: Keith Marzullo Stanford University Stanford UniversityView Profile , Susan Owicki Stanford University Stanford UniversityView Profile Authors Info & Claims A...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/850776.850780
Nancy Lynch, Michael J. Fischer • Theoretical Computer Science
(1981)
OPENALEX
Open Access
DOI: https://doi.org/10.1016/0304-3975(81)90109-2
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
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
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
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
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
Hongyi Wang, Qingfeng Jing, Rishan Chen, Bingsheng He et al. (2014)
Cloud computing allows users to perform computation in a public cloud with a pricing scheme typically based on incurred resource consumption. While cloud comput-ing is often considered as merely a new application for classic distributed sys...
OPENALEX
Ross Anderson (2001)
The world has changed radically since the first edition of this book was published in 2001. Spammers, virus writers, phishermen, money launderers, and spies now trade busily with each other in a lively online criminal economy and as they sp...
OPENALEX
DOI: https://doi.org/10.1002/9781119644682
Yichuan Jiang • IEEE Transactions on Parallel and Distributed Systems
(2015)
In past decades, significant attention has been devoted to the task allocation and load balancing in distributed systems. Although there have been some related surveys about this subject, each of which only made a very preliminary review on...
OPENALEX
DOI: https://doi.org/10.1109/tpds.2015.2407900
Stanislaw Budkowski, Piotr Dembiński • Computer Networks and ISDN Systems
(1987)
OPENALEX
DOI: https://doi.org/10.1016/0169-7552(87)90084-5
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
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
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
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