Home »
Academic Articles & Research Papers
Showing 20 of 2,264 academic articles
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
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
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
Tom A. Rodden, Gordon S. Blair • Springer eBooks
(1991)
OPENALEX
DOI: https://doi.org/10.1007/978-94-011-3506-1_4
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
A. V. Fursikov • Translations of mathematical monographs
(1999)
The existence of solutions to optimal control problems Optimality system for optimal control problems The solvability of boundary value problems for a dense set of data The problem of work minimization in accelerating still fluid to a presc...
OPENALEX
DOI: https://doi.org/10.1090/mmono/187
Sape J. Mullender • ACM Press/Addison-Wesley Publishing Co. eBooks
(1993)
OPENALEX
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
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
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
Ngoc Thanh Nguyên • Information Sciences
(2002)
OPENALEX
DOI: https://doi.org/10.1016/s0020-0255(02)00260-8
Butler Lampson, Martı́n Abadi, Michael T. Burrows, Edward P. Wobber • ACM SIGOPS Operating Systems Review
(1991)
We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a "speaks for" relation between principals. A simple principal either has a name or is a communication channel; a com...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/121132.121160
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