DocumentCode
1882355
Title
SLICC: Self-Assembly of Instruction Cache Collectives for OLTP Workloads
Author
Atta, I. ; Tozun, Pinar ; Ailamaki, Anastasia ; Moshovos, Andreas
Author_Institution
Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
fYear
2012
fDate
1-5 Dec. 2012
Firstpage
188
Lastpage
198
Abstract
Online transaction processing (OLTP) is at the core of many data center applications. OLTP workloads are known to have large instruction footprints that foil existing L1 instruction caches resulting in poor overall performance. Prefetching can reduce the impact of such instruction cache miss stalls, however, state-of-the-art solutions require large dedicated hardware tables on the order of 40KB in size. SLICC is a programmer transparent, low cost technique to minimize instruction cache misses when executing OLTP workloads. SLICC migrates threads, spreading their instruction footprint over several L1 caches. It exploits repetition within and across transactions, where a transaction´s first iteration prefetches the instructions for subsequent iterations or similar subsequent transactions. SLICC reduces instruction misses by 58% on average for TPC-C and TPCE, thereby improving performance by 68%. When compared to a state-of-the-art prefetcher, and notwithstanding the increased storage overheads (42x as compared to SLICC), performance using SLICC is 21% higher for TPC-E and within 2% for TPC-C.
Keywords
cache storage; computer centres; instruction sets; transaction processing; L1 instruction caches; OLTP workloads; SLICC; TPC-C; TPC-E; data center applications; hardware tables; instruction cache miss minimization; instruction footprint; instruction prefetching; online transaction processing; performance improvement; self-assembly-of-instruction cache collectives; thread migration; OLTP; instruction cache; thread migration;
fLanguage
English
Publisher
ieee
Conference_Titel
Microarchitecture (MICRO), 2012 45th Annual IEEE/ACM International Symposium on
Conference_Location
Vancouver, BC
ISSN
1072-4451
Print_ISBN
978-1-4673-4819-5
Type
conf
DOI
10.1109/MICRO.2012.26
Filename
6493619
Link To Document