Sciweavers

17760 search results - page 3154 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
PPOPP
2010
ACM
16 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
PPOPP
2010
ACM
16 years 4 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
EUROSYS
2008
ACM
16 years 3 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
EUROSYS
2007
ACM
16 years 3 months ago
Dynamic and adaptive updates of non-quiescent subsystems in commodity operating system kernels
Continuously running systems require kernel software updates applied to them without downtime. Facilitating fast reboots, or delaying an update may not be a suitable solution in m...
Kristis Makris, Kyung Dong Ryu
EUROSYS
2007
ACM
16 years 3 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer
« Prev « First page 3154 / 3552 Last » Next »