Filters








754 Hits in 5.2 sec

Data flow analysis for software prefetching linked data structures in Java

B. Cahoon, K.S. McKinley
Proceedings 2001 International Conference on Parallel Architectures and Compilation Techniques  
We develop a new data flow analysis to detect regular accesses to linked data structures in Java programs.  ...  In this paper, we describe an effective compile-time analysis for software prefetching in Java.  ...  Acknowledgments Thanks to Sam Guyer and Calvin Lin for reading drafts of this work. We thank the anonymous referees for their helpful comments.  ... 
doi:10.1109/pact.2001.953309 dblp:conf/IEEEpact/CahoonM01 fatcat:ri4jvqd7uzeopplqwfyvk7mf5i

Simple and effective array prefetching in Java

Brendon Cahoon, Kathryn S. McKinley
2002 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande - JGI '02  
To hide memory latency, we describe a new unified compile-time analysis for software prefetching arrays and linked structures in Java.  ...  Our previous work uses data-flow analysis to discover linked data structure accesses, and here we present a more general version that also identifies loop induction variables used in array accesses.  ...  Acknowledgments We thank the anonymous referees for their detailed comments and helpful suggestions. Thanks to Sam Guyer for the idea to evaluate prefetching on the PowerPC.  ... 
doi:10.1145/583810.583820 dblp:conf/java/CahoonM02 fatcat:grdoce2vpnbk7fu5vfkxoirqym

Recurrence analysis for effective array prefetching in Java

Brendon Cahoon, Kathryn S. McKinley
2005 Concurrency and Computation  
We thank the anonymous referees from the Java Grande/ISCOPE conference for their detailed comments and helpful suggestions.  ...  Any opinions, findings and conclusions or recommendations expressed in this material are the authors and do not necessarily reflect those of the sponsors.  ...  A unified analysis for discovering recurrences in linked structures and arrays. We use the same analysis for identifying prefetch opportunities in linked structures and arrays. 3 .  ... 
doi:10.1002/cpe.851 fatcat:oj3liilzdfae5a42rwsou4t364

Automatically Generating Symbolic Prefetches for Distributed Transactional Memories [chapter]

Alokika Dash, Brian Demsky
2010 Lecture Notes in Computer Science  
We measured speedups due to prefetching of up to 13.31× for accessing arrays and 4.54× for accessing linked lists.  ...  We present a static compiler analysis for the automatic generation of symbolic prefetches -symbolic prefetches allow objects whose addresses are unknown to be prefetched.  ...  We would like to thank Brad Chamberlain for feedback on our paper and the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-16955-7_18 fatcat:n3nsbvgzb5h6xoykvya35jbuvu

Integrating Caching and Prefetching Mechanisms in a Distributed Transactional Memory

Alokika Dash, Brian Demsky
2011 IEEE Transactions on Parallel and Distributed Systems  
We have observed a speedup of up to 7.26× for distributed applications on our system using prefetching and caching and a speedup of up to 5.55× for parallel applications on our system.  ...  To our knowledge, this is the first prefetching approach that can prefetch objects whose addresses have not been computed or predicted.  ...  We would like to thank the anonymous reviewers and our editor for their helpful feedback. We would also like to thank Brad Chamberlain for feedback on our paper.  ... 
doi:10.1109/tpds.2011.23 fatcat:nitbuelfjvffdk2polrmuxpibq

Runahead execution vs. conventional data prefetching in the IBM POWER6 microprocessor

Harold W. Cain, Priya Nagpurkar
2010 2010 IEEE International Symposium on Performance Analysis of Systems & Software (ISPASS)  
In this paper, we explore the efficacy of both hardware and software prefetching in the context of an IBM POWER6 commercial server.  ...  adopted by the POWER6 design, evaluating it in isolation and in conjunction with a conventional hardware-based sequential stream prefetcher and compiler-inserted software prefetching.  ...  Yaoqing Gao provided much insight into the use of software prefetching in the XL compiler suite.  ... 
doi:10.1109/ispass.2010.5452021 dblp:conf/ispass/CainN10 fatcat:3ug57ribrbdajejgoev7tlwdf4

Prefetch inection based on hardware monitoring and object metadata

Ali-Reza Adl-Tabatabai, Richard L. Hudson, Mauricio J. Serrano, Sreenivas Subramoney
2004 Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04  
Prefetching for linked data structures remains a major challenge because serial data dependencies between elements in a linked data structure preclude the timely materialization of prefetch addresses.  ...  This paper presents Mississippi Delta (MS Delta), a novel technique for prefetching linked data structures that closely integrates the hardware performance monitor (HPM), the garbage collector's global  ...  Murphy, Bratin Saha, Tatiana Shpeisman, James Stichnoth, and Weldon Washburn, for providing a high-performance Java infrastructure that allowed us to do this research.  ... 
doi:10.1145/996841.996873 dblp:conf/pldi/Adl-TabatabaiHSS04 fatcat:pmxgpr55qjd23isl22s3hqztwm

Prefetch injection based on hardware monitoring and object metadata

Ali-Reza Adl-Tabatabai, Richard L. Hudson, Mauricio J. Serrano, Sreenivas Subramoney
2004 SIGPLAN notices  
Prefetching for linked data structures remains a major challenge because serial data dependencies between elements in a linked data structure preclude the timely materialization of prefetch addresses.  ...  This paper presents Mississippi Delta (MS Delta), a novel technique for prefetching linked data structures that closely integrates the hardware performance monitor (HPM), the garbage collector's global  ...  Murphy, Bratin Saha, Tatiana Shpeisman, James Stichnoth, and Weldon Washburn, for providing a high-performance Java infrastructure that allowed us to do this research.  ... 
doi:10.1145/996893.996873 fatcat:skmkqo5cfnasjcwfufu76az6aa

Stride prefetching by dynamically inspecting objects

Tatsushi Inagaki, Tamiya Onodera, Hideaki Komatsu, Toshio Nakatani
2003 SIGPLAN notices  
Software prefetching is a promising technique to hide cache miss latencies, but it remains challenging to effectively prefetch pointerbased data structures because obtaining the memory address to be prefetched  ...  We propose a new algorithm for stride prefetching which is intended for use in a dynamic compiler.  ...  We also thank the anonymous reviewers for their helpful comments and suggestions.  ... 
doi:10.1145/780822.781161 fatcat:psy7hg2r2fc7xccqinqrcsyfxq

Remote Class Prefetching: Improving Performance of Java Applications on Grid Platforms [chapter]

Yudith Cardinale, Jesús De Oliveira, Carlos Figueira
2006 Lecture Notes in Computer Science  
In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid.  ...  Our testbed is suma/g, a grid platform specifically targeted at executing Java bytecode on Globus grids.  ...  JUNG is an open-source software library that provides a language for modeling, analysis, and visualization of graphs and network data.  ... 
doi:10.1007/11946441_56 fatcat:rjaukgmm55fkxmxjpfwgfmhefa

Reducing transfer delay using Java class file splitting and prefetching

Brad Calder, Chandra Krintz, Urs Hölzle
1999 Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '99  
We propose Java class file splitting and class file prefetching optimizations in order to reduce transfer delay.  ...  Class file splitting reduces the startup time for Java programs by 10% on average, and class file splitting used with prefetching reduces the overall transfer delay encountered during a mobile program's  ...  Acknowledgements We would like to thank Bill Pugh, Jim Larus, Emin Sirer, and the anonymous reviewers for providing useful comments. This work was funded in part by NSF CAREER grants No.  ... 
doi:10.1145/320384.320412 dblp:conf/oopsla/KrintzCH99 fatcat:afqx3gv5dzdbdpwtv7ny3pwgmi

Runtime Engine for Dynamic Profile Guided Stride Prefetching

Qiong Zou, Xiao-Feng Li, Long-Bing Zhang
2008 Journal of Computer Science and Technology  
In this paper, we present a prefetch engine for JVM (Java Virtual Machine).  ...  Actually we found the cross-procedural patterns take about 30% of all the prefetchings in the representative Java benchmarks.  ...  We will discuss the details of the prefetch controller in following text. Core Data Structures Fig.3 is the core data structure for runtime detection of stride patterns.  ... 
doi:10.1007/s11390-008-9159-2 fatcat:5e5vkmomcrd6ph2voahfih5z2u

Using aspectC to improve the modularity of path-specific customization in operating system code

Yvonne Coady, Gregor Kiczales, Mike Feeley, Greg Smolyn
2001 Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE-9  
Most AOP language research is in Java. To enable a range of experiments for operating systems written in C, we developed a paper design for AspectC.  ...  An initial experiment using an aspect-oriented programming language to refactor prefetching in the FreeBSD operating system kernel shows significant benefits, including easy (un)pluggability of prefetching  ...  Acknowledgments: Many thanks to Stephan Gudmundson, Jan Hannemann, Gail Murphy and Andrew Warfield for their insightful comments on drafts of this paper.  ... 
doi:10.1145/503222.503223 fatcat:s3hf67yi5baavb655khwqs6jxq

Enabling unrestricted automated synthesis of portable hardware accelerators for virtual machines

Miljan VuletiĆ, Christophe Dubach, Laura Pozzi, Paolo Ienne
2005 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis - CODES+ISSS '05  
In this work, we apply a virtualisation layer that provides portable and seamless integration of hardware and software components to a JVM platform, making it capable of accelerating any Java bytecode  ...  ., Java Virtual Machines-JVMs) can be significantly improved when critical code sections (e.g., Java bytecode methods) are migrated from software to reconfigurable hardware.  ...  Some authors [15] use compile-time analysis to generate distributed memory structures with custom memory managers.  ... 
doi:10.1145/1084834.1084896 dblp:conf/codes/VuleticDPI05 fatcat:oul5qhgt2ve7xj435htyaosjx4

Using aspectC to improve the modularity of path-specific customization in operating system code

Yvonne Coady, Gregor Kiczales, Mike Feeley, Greg Smolyn
2001 Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE-9  
Most AOP language research is in Java. To enable a range of experiments for operating systems written in C, we developed a paper design for AspectC.  ...  An initial experiment using an aspect-oriented programming language to refactor prefetching in the FreeBSD operating system kernel shows significant benefits, including easy (un)pluggability of prefetching  ...  Acknowledgments: Many thanks to Stephan Gudmundson, Jan Hannemann, Gail Murphy and Andrew Warfield for their insightful comments on drafts of this paper.  ... 
doi:10.1145/503209.503223 dblp:conf/sigsoft/CoadyKFS01 fatcat:pab6n4p3enhfbmaowrkkjlrjoi
« Previous Showing results 1 — 15 out of 754 results