Results 221 to 230 of about 465,284 (266)
Some of the next articles are maybe not open access.
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
Load distributing for locally distributed systems
Computer, 1992The problem of judiciously and transparently redistributing the load of the system among its nodes so that overall performance is maximized is discussed. Several key issues in load distributing for general-purpose systems, including the motivations and design trade-offs for load-distributing algorithms, are reviewed.
Niranjan G. Shivaratri +2 more
openaire +1 more source
Fault-Local Distributed Mending
Journal of Algorithms, 1999Summary: As communication networks grow, existing fault handling tools that involve global measures such as global time-outs or reset procedures become increasingly unaffordable, since their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, its cost must depend only on the number of failed nodes
Shay Kutten, David Peleg
openaire +1 more source
Distribution and locality of concurrent systems
1994A new semantics for process description languages that discriminates according to the distribution in space of processes is proposed. The semantics is based on a set of distributed transition rules that record spatial information and on a notion of equivalence that discriminates according to which actions processes can perform and where these actions ...
Corradini, Flavio, De Nicola, Rocco
openaire +3 more sources
Parametric localization of distributed sources
IEEE Transactions on Signal Processing, 1995Most array processing algorithms are based on the assumption that the signals are generated by point sources. This is a mathematical constraint that is not satisfied in many applications. In this paper, we consider situations where the sources are distributed in space with a parametric angular cross-correlation kernel.
Shahrokh Valaee +2 more
openaire +1 more source
Localization of distributed wireless cameras
2009 Third ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC), 2009Cooperative cameras enable monitoring wide areas and detecting actions and events on a large scale. Due to hardware advancements and economic factors, distributed networks are becoming widely used for a variety of applications ranging from traffic monitoring and surveillance in shopping malls to sports coverage.
Nadeem Anjum, Andrea Cavallaro
openaire +1 more source
Locality in Distributed Graph Algorithms
SIAM Journal on Computing, 1992The paper deals with distributed solutions of graph problems. The model assumes that each node of the graph is occupied by a processor that has a unique ID number. Moreover, the computation is reliable, synchronous, and communication is accomplished by message passing along the edges of the graph. Let \(\text{diam}(G)\) denote the diameter of the graph
openaire +2 more sources
Object distribution with local information
Proceedings 21st International Conference on Distributed Computing Systems, 2002We investigate the problem of distributing communicating objects across wide-area environments. Our goals are to balance load, minimize network communication, and use resources efficiently. However, applications running in such environments are often dynamic and highly unpredictable. Furthermore, synchronous communication is usually too expensive to be
Bujor D. Silaghi, Peter J. Keleher
openaire +1 more source
Availability and locality in distributed storage
2013 IEEE Global Conference on Signal and Information Processing, 2013Modern distributed file systems are deploying erasure codes to increase storage efficiency compared to block replication. Initially, classical error-correcting codes (like Reed-Solomon) were used but the benefits of custom code designs are now clear.
Ankit Singh Rawat +2 more
openaire +1 more source
Distributed Multi-Robot Localization
2000This paper presents a new approach to the cooperative localization problem, namely distributed multi-robot localization. A group of M robots is viewed as a single system composed of robots that carry, in general, different sensors and have different positioning capabilities.
Stergios I. Roumeliotis, George A. Bekey
openaire +1 more source