Filters








1,256 Hits in 3.7 sec

Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems

Eiman Ebrahimi, Onur Mutlu, Yale N. Patt
2009 2009 IEEE 15th International Symposium on High Performance Computer Architecture  
This paper proposes a low-cost hardware/software cooperative technique that enables bandwidth-efficient prefetching of linked data structures.  ...  Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses.  ...  Acknowledgments Many thanks to Chang Joo Lee, Veynu Narasiman, other HPS members and the anonymous reviewers for their comments and suggestions.  ... 
doi:10.1109/hpca.2009.4798232 dblp:conf/hpca/EbrahimiMP09 fatcat:5nrfndrvubgdnjj7flsqf7s4fe

Data Cache Prefetching Using a Global History Buffer

K.J. Nesbit, J.E. Smith
2005 IEEE Micro  
Acknowledgments This research was funded by an Intel undergraduate research scholarship, a University of Wisconsin Hilldale undergraduate research fellowship, and by National Science Foundation grants  ...  GHB prefetching For more efficient prefetchers, our alternative structure decouples prefetch key matching from the storage of prefetch-related history information.  ...  For hybrid methods with a large prefetch degree, however, the product of the width and depth components is only weakly related to the amount of data actually prefetched.  ... 
doi:10.1109/mm.2005.6 fatcat:aafr4nj2czf63fgyjt3siydtta

CGAcc: A Compressed Sparse Row Representation-Based BFS Graph Traversal Accelerator on Hybrid Memory Cube

Cheng Qian, Bruce Childers, Libo Huang, Hui Guo, Zhiying Wang
2018 Electronics  
However, traditional prefetching does not work well for graph traversal due to data dependencies, the parallel nature of graphs and the need to move vast amounts of data from memory to the caches.  ...  One way to mitigate this cost is memory prefetching, which issues requests from the processor to the memory in anticipation of needing certain data.  ...  Before the wide use of compressed sparse row representation, some works focused on the pointer prefetching because the linked structure is the base data structure in graphs.  ... 
doi:10.3390/electronics7110307 fatcat:fkp4vgps6zg77ebcnfhfdp7hhm

A Thread-Aware Adaptive Data Prefetcher

Jiyang Yu, Peng Liu
2014 2014 IEEE 32nd International Conference on Computer Design (ICCD)  
On a set of parallel benchmarks, our thread-aware data prefetching mechanisms improve the overall performance of 64-core system by 11% and reduce the energy-delay product by 13% over a multi-mode prefetch  ...  This paper proposes a threadaware data prefetching mechanism based on low-overhead runtime information to tune prefetching modes and aggressiveness, mitigating the resource contention in the memory system  ...  Huang, and Mei Yang for their comments on early versions of this paper, and the anonymous referees for their careful reviews and suggestions.  ... 
doi:10.1109/iccd.2014.6974694 dblp:conf/iccd/Yu014 fatcat:bnfaitdngfc2ddziemna3rjc4u

Delfos: the Oracle to Predict NextWeb User's Accesses

B. de la Ossa, J. A. Gil, J. Sahuquillo, A. Pont
2007 Advanced Information Networking and Applications  
In addition, it can be also used as a flexible framework to evaluate and compare existing prefetching techniques and algorithms and to assist in the design of new ones because it provides detailed statistics  ...  Nevertheless, current user bandwidths open a new scenario for prefetching that becomes again an interesting option to improve web performance.  ...  Acknowledgments The authors would like to thank the technical staff of the School of Computer Science from the Polytechnic University of Valencia (www.ei.upv.es) for providing us recent and customized  ... 
doi:10.1109/aina.2007.50 dblp:conf/aina/OssaGSP07 fatcat:7s55ykttcrapbgdukzozv667cq

DRAM-Level Prefetching for Fully-Buffered DIMM: Design, Performance and Power Saving

Jiang Lin, Hongzhong Zheng, Zhichun Zhu, Zhao Zhang, Howard David
2007 2007 IEEE International Symposium on Performance Analysis of Systems & Software  
We have studied DRAM-level prefetching for the fully buffered DIMM (FB-DIMM) designed for multi-core processors.  ...  We have found that the performance gain comes from the reduction of idle memory latency and the improvement of channel bandwidth utilization.  ...  Acknowledgment We appreciate the constructive comments from the anonymous reviewers and thank Bruce Christenson at Intel for his critical comments.  ... 
doi:10.1109/ispass.2007.363740 dblp:conf/ispass/LinZZZD07 fatcat:ut7blyqgqjgehpjlhat3325dcu

Advection-Based Sparse Data Management for Visualizing Unsteady Flow

Hanqi Guo, Jiang Zhang, Richen Liu, Lu Liu, Xiaoru Yuan, Jian Huang, Xiangfei Meng, Jingshan Pan
2014 IEEE Transactions on Visualization and Computer Graphics  
In this work, we explore a novel advection-based scheme to manage flow field data for both efficiency and scalability.  ...  memory and I/O bandwidth-efficiencies as well as the scalability of naive task-parallel particle advection.  ...  Qingdong Cai for providing the TB-scale turbulence simulation data. This work is supported by NSFC No. 61170204.  ... 
doi:10.1109/tvcg.2014.2346418 pmid:26356969 fatcat:4m4nxsxalnhxfaskwlpfmigoim

A scalable processing-in-memory accelerator for parallel graph processing

Junwhan Ahn, Sungpack Hong, Sungjoo Yoo, Onur Mutlu, Kiyoung Choi
2015 Proceedings of the 42nd Annual International Symposium on Computer Architecture - ISCA '15  
The explosion of digital data and the ever-growing need for fast data analysis have made in-memory big-data processing in computer systems increasingly important.  ...  which is extremely challenging in conventional systems due to severe memory bandwidth limitations.  ...  Acknowledgments We thank the anonymous reviewers for their valuable feedback.  ... 
doi:10.1145/2749469.2750386 dblp:conf/isca/AhnHYMC15 fatcat:yxk4mj22h5bkdozvbfxloj3qyi

A scalable processing-in-memory accelerator for parallel graph processing

Junwhan Ahn, Sungpack Hong, Sungjoo Yoo, Onur Mutlu, Kiyoung Choi
2015 SIGARCH Computer Architecture News  
The explosion of digital data and the ever-growing need for fast data analysis have made in-memory big-data processing in computer systems increasingly important.  ...  which is extremely challenging in conventional systems due to severe memory bandwidth limitations.  ...  Acknowledgments We thank the anonymous reviewers for their valuable feedback.  ... 
doi:10.1145/2872887.2750386 fatcat:s73lzobpobfb7mem6e2m5xcmci

VMP: A MAC Protocol for EPON-Based Video-Dominated FiWi Access Networks

Navid Ghazisaidi, Martin Maier, Martin Reisslein
2012 IEEE transactions on broadcasting  
segments, (ii) multi-polling medium access control for upstream voice and data packets and acknowledgements for downstream video packets, and (iii) prefetching of video frames over the optical and wireless  ...  VMP consists of three main novel components: (i) frame fragmentation in conjunction with hierarchical frame aggregation for efficient MAC frame transport over the integrated optical and wireless network  ...  For a wide range of reserved bandwidth levels, prefetching with channel probing robustly achieves playback starvation probabilities that are over an order of magnitude lower than for hybrid reservation  ... 
doi:10.1109/tbc.2012.2191692 fatcat:ru2gye53kva6xe7b5t7znnoe3i

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 Proceedings of the eighth international conference on Architectural support for programming languages and operating systems - ASPLOS-VIII  
We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  By identzj+ing producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/291069.291034 dblp:conf/asplos/RothMS98 fatcat:jul62swkkjbr5f24jf5qjciwoa

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 ACM SIGOPS Operating Systems Review  
We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  By identzj+ing producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/384265.291034 fatcat:4lkgda5hpbck3hbt6npl65jsoi

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 SIGPLAN notices  
We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  By identzj+ing producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/291006.291034 fatcat:fblqhoxlrvafpjqgjz6gcq3csi

Extending data prefetching to cope with context switch misses

Hanyu Cui, Suleyman Sair
2009 2009 IEEE International Conference on Computer Design  
To reduce the impact of frequent context switches, we propose restoring a program's locality by prefetching into the L2 cache the data a program was using before it was swapped out.  ...  Experiments show significant speedup over baseline architectures with and without traditional prefetching in the presence of frequent context switches. 978-1-4244-5028-2/09/$25.00 ©2009 IEEE  ...  The doubly-linked structure of the GHL facilitates easy removal of duplicate entries.  ... 
doi:10.1109/iccd.2009.5413144 dblp:conf/iccd/CuiS09 fatcat:eiinxozlbvaoba23jhdtsd4wsy

A stateless, content-directed data prefetching mechanism

Robert Cooksey, Stephan Jourdan, Dirk Grunwald
2002 SIGARCH Computer Architecture News  
This paper proposes Content-Directed Data Prefetching, a data prefetching architecture that exploits the memory allocation used by operating systems and runtime systems to improve the performance of pointer-intensive  ...  This technique is modeled after conservative garbage collection, and prefetches "likely" virtual addresses observed in memory references.  ...  The content-directed data prefetcher also takes advantage of the recursive construction of linked data structures.  ... 
doi:10.1145/635506.605427 fatcat:i6jgebqg6zde3gmjrownt3yeka
« Previous Showing results 1 — 15 out of 1,256 results