Emerging scale-out workloads require extensive amounts of computational resources.
However, data centers using modern server hardware face physical constraints in space …

We present Masstree, a fast key-value database designed for SMP machines. Masstree
keeps all data in memory. Its main data structure is a trie-like concatenation of B+-trees …

Server chips will not scale beyond a few tens to low hundreds of cores, and an increasing
fraction of the chip in future technologies will be dark silicon that we cannot afford to power …

Join is an important database operation. As computer architectures evolve, the best join
algorithm may change hand. This paper re-examines two popular join algorithms--hash join …

Increases in on-chip communication delay and the large working sets of server and scientific
workloads complicate the design of the on-chip last-level cache for multicore processors …

We present a novel design and implementation of relational join algorithms for new-
generation graphics processing units (GPUs). The most recent GPU features include support …

Prior research indicates that there is much spatial variation in applications' memory access
patterns. Modern memory systems, however, use small fixed-size cache blocks and as such …

Scale-out datacenters mandate high per-server throughput to get the maximum benefit from
the large TCO investment. Emerging applications (eg, data serving and web search) that run …

Data prefetching, ie, the act of predicting an application's future memory accesses and
fetching those that are not in the on-chip caches, is a well-known and widely used approach …

In this paper we study the impact of sharing memory resources on five Google datacenter
applications: a web search engine, bigtable, content analyzer, image stitching, and protocol …