Sciweavers

12459 search results - page 2234 / 2492
» cans 2006
Sort
View
PODC
2006
ACM
16 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2006
ACM
16 years 1 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
PPOPP
2006
ACM
16 years 1 months ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...
PPPJ
2006
ACM
16 years 1 months ago
Cost and benefit of rigorous decoupling with context-specific interfaces
In Java programs, classes are coupled to each other through the use of typed references. In order to minimize coupling without changing the executed code, interfaces can be introd...
Florian Forster
SAC
2006
ACM
16 years 1 months ago
Operating system multilevel load balancing
This paper describes an algorithm that allows Linux to perform multilevel load balancing in NUMA computers. The Linux scheduler implements a load balancing algorithm that uses str...
Mônica Corrêa, Avelino Francisco Zorzo...
« Prev « First page 2234 / 2492 Last » Next »