Sciweavers

4044 search results - page 758 / 809
» The Evolution of a Distributed Operating System
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
15 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
PERCOM
2005
ACM
15 years 9 months ago
TinyLIME: Bridging Mobile and Sensor Networks through Middleware
In the rapidly developing field of sensor networks, bridging the gap between the applications and the hardware presents a major challenge. Although middleware is one solution, it ...
Carlo Curino, Matteo Giani, Marco Giorgetta, Aless...
PPOPP
2010
ACM
15 years 7 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
SIGCOMM
2009
ACM
15 years 4 months ago
A programmable overlay router for service provider innovation
The threat of commoditization poses a real challenge for service providers. While the end-to-end principle is often paraphrased as “dumb network, smart end-systems”, the origi...
Bruce S. Davie, Jan Medved
GLOBECOM
2008
IEEE
15 years 4 months ago
Network Resource Allocation for Competing Multiple Description Transmissions
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
Ying Li, Chao Tian, Suhas N. Diggavi, Mung Chiang,...