Sciweavers

2703 search results - page 230 / 541
» Optimizing memory transactions
Sort
View
ASPLOS
2012
ACM
14 years 7 days ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
ISLPED
2006
ACM
109views Hardware» more  ISLPED 2006»
15 years 10 months ago
Power reduction of multiple disks using dynamic cache resizing and speed control
This paper presents an energy-conservation method for multiple disks and their cache memory. Our method periodically resizes the cache memory and controls the rotation speeds unde...
Le Cai, Yung-Hsiang Lu
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
16 years 1 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
VLDB
2007
ACM
106views Database» more  VLDB 2007»
15 years 10 months ago
Why You Should Run TPC-DS: A Workload Analysis
The Transaction Processing Performance Council (TPC) is completing development of TPC-DS, a new generation industry standard decision support benchmark. The TPC-DS benchmark, firs...
Meikel Pöss, Raghunath Othayoth Nambiar, Davi...
SIGMOD
1995
ACM
132views Database» more  SIGMOD 1995»
15 years 8 months ago
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines whil...
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Ma...