The Case of Using Multiple Streams in Streaming  

作　　者：Muhammad Abid Mughal Hai-Xia Wang Dong-Sheng Wang 

机构地区：[1]Tsinghua National Laboratory for Information Science and Technology,Department of Computer Science&Technology,Tsinghua University

出　　处：《International Journal of Automation and computing》2013年第6期587-596,共10页国际自动化与计算杂志（英文版）

基　　金：supported by Higher Education Commission(Pakistan);National High Technology Research and Development Program of China(863 Program)(No.2008AA01A201);Natural Science Foundation of China(Nos.60833004 and 60970002);TNList Cross-discipline Foundation

摘　　要：Off-chip replacement （capacity and conflict） and coherent read misses in a distributed shared memory system cause execution to stall for hundreds of cycles. These off-chip replacement and coherent read misses are recurring and forming sequences of two or more misses called streams. Prior streaming techniques ignored reordering of misses and not-recently-accessed streams while streaming data. In this paper, we present stream prefetcher design that can deal with both problems. Our stream prefetcher design utilizes stream waiting rooms to store not-recently-accessed streams. Stream waiting rooms help remove more off-chip misses. Using trace based simulation% our stream prefetcher design can remove 8% to 66% （on average 40%） and 17% to 63% （on average 39%） replacement and coherent read misses, respectively. Using cycle-accurate full-system simulation, our design gives speedups from 1.00 to 1.17 of princeton application repository for shared-memory computers （PARSEC） workloads running on a distributed shared memory system with the exception of dedup and swaptions workloads.Off-chip replacement （capacity and conflict） and coherent read misses in a distributed shared memory system cause execution to stall for hundreds of cycles. These off-chip replacement and coherent read misses are recurring and forming sequences of two or more misses called streams. Prior streaming techniques ignored reordering of misses and not-recently-accessed streams while streaming data. In this paper, we present stream prefetcher design that can deal with both problems. Our stream prefetcher design utilizes stream waiting rooms to store not-recently-accessed streams. Stream waiting rooms help remove more off-chip misses. Using trace based simulation% our stream prefetcher design can remove 8% to 66% （on average 40%） and 17% to 63% （on average 39%） replacement and coherent read misses, respectively. Using cycle-accurate full-system simulation, our design gives speedups from 1.00 to 1.17 of princeton application repository for shared-memory computers （PARSEC） workloads running on a distributed shared memory system with the exception of dedup and swaptions workloads.

关 键 词：PREFETCHING stream first in first out （FIFO） princeton application repository for shared-memory computers （PARSEC） stream waiting rooms reordering of misses sequitur. 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]