Sciweavers

4155 search results - page 136 / 831
» External Memory Algorithms
Sort
View
126
Voted
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
15 years 14 hour ago
Semi-autonomous networks: Network resilience and adaptive trees
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
Airlie Chapman, Mehran Mesbahi
DSN
2007
IEEE
15 years 11 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
163
Voted
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
15 years 7 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
SIROCCO
2007
15 years 6 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
PPOPP
1999
ACM
15 years 9 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard