Sciweavers

50 search results - page 8 / 10
» Transparent logging as a technique for debugging complex dis...
Sort
View
HPDC
2007
IEEE
14 years 2 months ago
PeerStripe: a p2p-based large-file storage for desktop grids
In desktop grids the use of off-the-shelf shared components makes the use of dedicated resources economically nonviable and increases the complexity of design of efficient storag...
Chreston Miller, Patrick Butler, Ankur Shah, Ali R...
ATAL
2009
Springer
14 years 3 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
OSDI
2006
ACM
14 years 8 months ago
Operating System Profiling via Latency Analysis
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
Nikolai Joukov, Avishay Traeger, Rakesh Iyer, Char...
PODC
2010
ACM
14 years 9 days ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel