Sciweavers

183 search results - page 14 / 37
» A case for multi-level main memory
Sort
View
NA
2010
87views more  NA 2010»
14 years 10 months ago
A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
Federico Poloni
DC
2010
14 years 12 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
JUCS
2002
120views more  JUCS 2002»
14 years 11 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler
RTAS
1996
IEEE
15 years 4 months ago
Efficient worst case timing analysis of data caching
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessa...
Sung-Kwan Kim, Sang Lyul Min, Rhan Ha
IPPS
1999
IEEE
15 years 4 months ago
The Impact of Memory Hierarchies on Cluster Computing
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
Xing Du, Xiaodong Zhang