Results 261 to 270 of about 218,454 (318)

Computability in distributed computing

ACM SIGACT News, 2012
What 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
Maurice Herlihy   +2 more
openaire   +1 more source

Locality in distributed computations

Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
The 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

Distributed computing

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

Distributed Computing

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   +1 more source

Uncheatable Distributed Computations

2001
Computationally 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   +1 more source

On slicing a distributed computation

Proceedings 21st International Conference on Distributed Computing Systems, 2002
We 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   +1 more source

Distributed computing column 47

ACM SIGACT News, 2012
What 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

Computing with distributed chaos

Physical Review E, 1999
We 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

Home - About - Disclaimer - Privacy