Results 281 to 290 of about 3,355,993 (333)
Some of the next articles are maybe not open access.
Proceedings of the 1992 ACM annual conference on Communications - CSC '92, 1992
A distributed computing system consists of a collection autonomous computers connected by a communication network. The motivation for such a distributed system includes resource and load sharing, reduced costs in computation and communication, higher performance and throughput, and increased reliability and availability.
openaire +1 more source
A distributed computing system consists of a collection autonomous computers connected by a communication network. The motivation for such a distributed system includes resource and load sharing, reduced costs in computation and communication, higher performance and throughput, and increased reliability and availability.
openaire +1 more source
Locality in distributed computations
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988The defining characteristic of a distributed system is the (temporal) distance between components; communication time is non-trivial compared to processing time. Because of this, the design of efficient distributed computations involves trade-offs between maximizing the amount of parallelism and minimizing communication costs. We argue that any sort of
David K. Garnick, A. Toni Cohen
openaire +1 more source
ACM SIGACT News, 2001
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, internet, and the web.
openaire +2 more sources
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, internet, and the web.
openaire +2 more sources
On slicing a distributed computation
Proceedings 21st International Conference on Distributed Computing Systems, 2002We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate.
Vijay K. Garg, Neeraj Mittal
openaire +2 more sources
Distributed computing column 47
ACM SIGACT News, 2012What can and cannot be computed in a distributed system is a complex function of the system’s communication model, timing model, and failure model. This tutorial surveys some important results about computability in the canonical distributed system model, where processes execute asynchronously, they communicate by reading and writing shared memory, and
openaire +1 more source
Mastering Distributed Computing
IEEE Distributed Systems Online, 2005A review of "Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd ed." by Hagit Attiya and Jennifer Welch.
openaire +2 more sources
Distributed Computing on Distributed Memory
2018Distributed computation is formalized in several description languages for computation, as e.g. Unified Modeling Language (UML), Specification and Description Language (SDL), and Concurrent Abstract State Machines (CASM). All these languages focus on the distribution of computation, which is somewhat the same as concurrent computation.
openaire +2 more sources
Computing with Distributed Resources
2003The metaphor “Network is the Computer” has received much attention lately. It is easy/hard to claim such an equivalence since neither term is defined precisely. It is easy to establish an equivalence by ignoring several key aspects of the network, such as the costs of remote data access, failures of network nodes and communication links, and the ...
Young-ri Choi +4 more
openaire +2 more sources
Uncheatable Distributed Computations
2001Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Internet has made it possible to invite the participation of just about any computer in such distributed computations.
Philippe Golle, Ilya Mironov
openaire +2 more sources
Computing with distributed chaos
Physical Review E, 1999We describe and discuss in detail some recent results by Sinha and Ditto [Phys. Rev. Lett. 81, 2156 (1998)] demonstrating the capacity of a lattice of threshold coupled chaotic maps to perform computations. Such systems are shown to emulate logic gates, encode numbers, and perform specific arithmetic operations, such as addition and multiplication, as ...
S, Sinha, W L, Ditto
openaire +2 more sources