Sciweavers

2703 search results - page 252 / 541
» Optimizing memory transactions
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 4 months ago
Communication-avoiding parallel and sequential QR factorizations
We present parallel and sequential dense QR factorization algorithms that are optimized to avoid communication. Some of these are novel, and some extend earlier work. Communicatio...
James Demmel, Laura Grigori, Mark Hoemmen, Julien ...
INFORMATICALT
1998
105views more  INFORMATICALT 1998»
15 years 4 months ago
Parallel Implementation of a Generalized Conjugate Gradient Algorithm
This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact lin...
Jonas Koko, Aziz Moukrim
DAC
2002
ACM
16 years 5 months ago
Scheduler-based DRAM energy management
Previous work on DRAM power-mode management focused on hardware-based techniques and compiler-directed schemes to explicitly transition unused memory modules to low-power operatin...
Victor Delaluz, Anand Sivasubramaniam, Mahmut T. K...
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 8 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han