Sciweavers

822 search results - page 123 / 165
» Contention in shared memory algorithms
Sort
View
136
Voted
TSE
2010
180views more  TSE 2010»
15 years 28 days ago
Aspect-Oriented Race Detection in Java
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
Eric Bodden, Klaus Havelund
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
15 years 6 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
138
Voted
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 7 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
122
Voted
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 2 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
121
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 2 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel