Sciweavers

2035 search results - page 83 / 407
» Working memory
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
ASPLOS
2006
ACM
15 years 9 months ago
Bell: bit-encoding online memory leak detection
Memory leaks compromise availability and security by crippling performance and crashing programs. Leaks are difficult to diagnose because they have no immediate symptoms. Online ...
Michael D. Bond, Kathryn S. McKinley
EDBT
2010
ACM
149views Database» more  EDBT 2010»
15 years 8 months ago
Statistics-based parallelization of XPath queries in shared memory systems
The wide availability of commodity multi-core systems presents an opportunity to address the latency issues that have plaqued XML query processing. However, simply executing multi...
Rajesh Bordawekar, Lipyeow Lim, Anastasios Kements...
PVM
2007
Springer
15 years 9 months ago
Parallelizing Dense Linear Algebra Operations with Task Queues in
llc is a language based on C where parallelism is expressed using compiler directives. The llc compiler produces MPI code which can be ported to both shared and distributed memory ...
Antonio J. Dorta, José M. Badía, Enr...
IPPS
2003
IEEE
15 years 8 months ago
A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
Xiaogang Li, Ruoming Jin, Gagan Agrawal