Reset
Showing 20 of 3,743 academic articles

Structured Graphics for Distributed Systems

Keith A. Lantz, William I. Nowicki • ACM Transactions on Graphics (1984)

One of the most important functions of an intelligent workstation is to provide a state-of-the-art user interface to distributed resources.One aspect of such an interface is virtual terminal support for both local and remote applications wi...

OPENALEX Open Access DOI: https://doi.org/10.1145/357332.357334

1. Pointwise Control for Distributed Systems

J. L. Lions • Society for Industrial and Applied Mathematics eBooks (1992)

1.1. Introduction. We consider in this chapter systems modeled by Partial Differential Equations of evolution, i.e., evolution distributed systems. We suppose that we can act on the system only at some particular points, this is the so-call...

OPENALEX DOI: https://doi.org/10.1137/1.9781611970982.ch1

A framework for event composition in distributed systems

Peter R. Pietzuch, Brian Ninham Shand, Jean Bacon • Lecture notes in computer science (2003)

1 Introduction Event-based communication has become a new paradigm for building large-scaledistributed systems. It has the advantages of loosely coupling communication partners, being extremely scalable, and providing a simple application p...

OPENALEX DOI: https://doi.org/10.5555/1515915.1515921

Distributed Systems

Ratan K. Ghosh, Hiranmay Ghosh • Wiley eBooks (2023)

Distributed Systems Comprehensive textbook resource on distributed systems—integrates foundational topics with advanced topics of contemporary importance within the field Distributed Systems: Theory and Applications is organized around thre...

OPENALEX DOI: https://doi.org/10.1002/9781119825968

An axiomatic basis of trust in distributed systems

P. Venkat Rangan • IEEE Symposium on Security and Privacy (S&P) (2003)

He introduces basic notions about developing a logic or a theory, and shows that modal logics of belief, with their Kripe-style possible-worlds semantics, are appropriate for basing a theory of trust on. He reviews a modal logic of belief, ...

OPENALEX DOI: https://doi.org/10.1109/secpri.1988.8112

FAULT-DIAGNOSIS IN FULLY DISTRIBUTED SYSTEMS

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

Authorization in distributed systems: a formal approach

Thomas Y. C. Woo, Simon S. Lam • IEEE Computer Society Symposium on Research in Security and Privacy (2003)

It is argued that authorization is an independent semantic concept that must be separated from implementation mechanisms and given a precise semantics. A logical approach to representing and evaluating authorization is proposed. Specificall...

OPENALEX DOI: https://doi.org/10.1109/risp.1992.213272

The evolution of distributed systems towards microservices architecture

Tasneem Salah, Mohamed Jamal Zemerly, Chan Yeob Yeun, Mahmoud Al‐Qutayri et al. • International Conference for Internet Technology and Secured Transactions (2016)

Applications developed to fulfil distributed systems needs have been growing rapidly. Major evolutions have happened beginning with basic architecture relying on initiated request by a client to a processing side referred to as the server. ...

OPENALEX DOI: https://doi.org/10.1109/icitst.2016.7856721

Transparency and reflection in distributed systems

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

The timed asynchronous distributed system model

Flaviu Cristian, Christof W. Fetzer • IEEE International Symposium on Fault-Tolerant Computing (2002)

We propose a formal definition for the timed asynchronous distributed system model and we describe extensive measurements of actual message and process scheduling delays and hardware clock drifts that confirm that this model adequately desc...

OPENALEX DOI: https://doi.org/10.1109/ftcs.1998.689463

The LOCUS Distributed System Architecture

Gerald J. Popek • The MIT Press eBooks (1986)

LOCUS, a distributed version of the popular operating system Unix, provides an excellent solution. It makes a collection of computers, whether they are workstations or mainframes, as easy to use as a single computer by providing a set of su...

OPENALEX DOI: https://doi.org/10.7551/mitpress/4279.001.0001

Monitoring distributed systems

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

Robust Probabilistic Inference in Distributed Systems

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

Selfish caching in distributed systems

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

Verdi: a framework for implementing and formally verifying distributed systems

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