Sciweavers

11213 search results - page 2157 / 2243
» Low-contention data structures
Sort
View
PPOPP
2010
ACM
14 years 7 months ago
NOrec: streamlining STM by abolishing ownership records
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
Luke Dalessandro, Michael F. Spear, Michael L. Sco...
SPAA
2009
ACM
14 years 7 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ICDCS
2009
IEEE
14 years 7 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
EUROSYS
2009
ACM
14 years 7 months ago
Ksplice: automatic rebootless kernel updates
Ksplice allows system administrators to apply patches to their operating system kernels without rebooting. Unlike previous hot update systems, Ksplice operates at the object code ...
Jeff Arnold, M. Frans Kaashoek
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Two-Colored Pixels
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
Darko Pavic and Leif Kobbelt
« Prev « First page 2157 / 2243 Last » Next »