Sciweavers

3202 search results - page 215 / 641
» Memory access scheduling
Sort
View
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
15 years 11 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
ASPLOS
1992
ACM
15 years 10 months ago
Non-Volatile Memory for Fast, Reliable File Systems
Given the decreasing cost of non-volatile RAM (NVRAM), by the late 1990's it will be feasible for most workstations to include a megabyte or more of NVRAM, enabling the desig...
Mary Baker, Satoshi Asami, Etienne Deprit, John K....
208
Voted
ISCAPDCS
2004
15 years 7 months ago
One-Level Cache Memory Design for Scalable SMT Architectures
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past de...
Muhamed F. Mudawar, John R. Wani
CLUSTER
1999
IEEE
15 years 5 months ago
The Network RamDisk: Using remote memory on heterogeneous NOWs
Efficient data storage, a major concern in the modern computer industry, is mostly provided today by the the traditional magnetic disk. Unfortunately the cost of a disk transfer m...
Michail Flouris, Evangelos P. Markatos
159
Voted
ICS
2009
Tsinghua U.
15 years 3 months ago
Refereeing conflicts in hardware transactional memory
In the search for high performance, most transactional memory (TM) systems execute atomic blocks concurrently and must thus be prepared for data conflicts. The TM system must then...
Arrvindh Shriraman, Sandhya Dwarkadas