Filters








63 Hits in 1.7 sec

Reducing pause time of conservative collectors

Toshio Endo, Kenjiro Taura
2002 Proceedings of the third international symposium on Memory management - ISMM '02  
While much successful work has been done on incremental collectors in general, achieving small pause time of the order of a few milliseconds in such uncooperative settings has been challenging.  ...  of a collection.  ...  Bounding Dirty Pages In the basic algorithm described in Section 3, we leave all pages updated during a collection dirty until the final phase.  ... 
doi:10.1145/512429.512432 fatcat:xcv3lpmjjvgbjelrqtmgjejomu

Reducing pause time of conservative collectors

Toshio Endo, Kenjiro Taura
2003 SIGPLAN notices  
While much successful work has been done on incremental collectors in general, achieving small pause time of the order of a few milliseconds in such uncooperative settings has been challenging.  ...  of a collection.  ...  Bounding Dirty Pages In the basic algorithm described in Section 3, we leave all pages updated during a collection dirty until the final phase.  ... 
doi:10.1145/773039.512432 fatcat:ntiwq5mghbd6hh4cx2dsuwwpni

Reducing pause time of conservative collectors

Toshio Endo, Kenjiro Taura
2002 Proceedings of the third international symposium on Memory management - ISMM '02  
While much successful work has been done on incremental collectors in general, achieving small pause time of the order of a few milliseconds in such uncooperative settings has been challenging.  ...  of a collection.  ...  Bounding Dirty Pages In the basic algorithm described in Section 3, we leave all pages updated during a collection dirty until the final phase.  ... 
doi:10.1145/512430.512432 fatcat:karkyvujmbaxdbkpviyyrtisge

Using generational garbage collection to implement cache-conscious data placement

Trishul M. Chilimbi, James R. Larus
1998 Proceedings of the first international symposium on Memory management - ISMM '98  
The paper explains how to collect, with low overhead, real-time profiling information about data access patterns in object-oriented languages, and describes a new copying algorithm that utilizes this information  ...  Recent research has demonstrated the value of a complementary approach, in which pointer-based data structures are reorganized to improve cache locality.  ...  ACKNOWLEDGEMENTS The authors would like to thank Brad Calder, Jeffrey Dean, Patrick Dussud, Eliot Moss, Ben Zorn, and the anonymous referees for their useful comments.  ... 
doi:10.1145/286860.286865 dblp:conf/iwmm/ChilimbiL98 fatcat:jgzhepinjfexvn27eeoam7qtia

Using generational garbage collection to implement cache-conscious data placement

Trishul M. Chilimbi, James R. Larus
1999 SIGPLAN notices  
The paper explains how to collect, with low overhead, real-time profiling information about data access patterns in object-oriented languages, and describes a new copying algorithm that utilizes this information  ...  Recent research has demonstrated the value of a complementary approach, in which pointer-based data structures are reorganized to improve cache locality.  ...  ACKNOWLEDGEMENTS The authors would like to thank Brad Calder, Jeffrey Dean, Patrick Dussud, Eliot Moss, Ben Zorn, and the anonymous referees for their useful comments.  ... 
doi:10.1145/301589.286865 fatcat:cfcpd3he3vh57dv5hsvnj6ntrm

Concurrent garbage collection using program slices on multithreaded processors

Manoj Plakal, Charles N. Fischer
2000 Proceedings of the second international symposium on Memory management - ISMM '00  
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program slice of the mutator that  ...  We generate a reference-counting collector as a transsformed program slice of an application and then execute this slice in parallel with the application as a "run-behind" thread.  ...  Acknowledgements This research was supported by the National Science Foundation under grant CCR-9974613.  ... 
doi:10.1145/362422.362468 dblp:conf/iwmm/PlakalF00 fatcat:fpaxex3ulbdonalxscnppkddpu

Concurrent garbage collection using program slices on multithreaded processors

Manoj Plakal, Charles N. Fischer
2001 SIGPLAN notices  
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program slice of the mutator that  ...  We generate a reference-counting collector as a transsformed program slice of an application and then execute this slice in parallel with the application as a "run-behind" thread.  ...  Acknowledgements This research was supported by the National Science Foundation under grant CCR-9974613.  ... 
doi:10.1145/362426.362468 fatcat:sr7jwpev7ngxro2rrhh7qefwqa

MMT: Exploiting fine-grained parallelism in dynamic memory management

Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solihin
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications.  ...  In this paper, we propose a new approach for accelerating dynamic memory management on multicore architecture, by offloading dynamic management functions to a separate thread that we refer to as memory  ...  On the other hand, large requests (> 512 bytes) are rare, less repeated, less predictable, and pre-allocating them result in a higher space fragmentation.  ... 
doi:10.1109/ipdps.2010.5470428 dblp:conf/ipps/TiwariLTS10 fatcat:kmwypfllbff3vbfxc3yljtinwy

Specifying and Solving Constraints on Object Behavior

Tim Felgentreff, Alan Borning, Robert Hirschfeld
2014 Journal of Object Technology  
It is implemented by modifying a state-of-the-art Ruby virtual machine.  ...  There is a long history of research on integrating constraint programming with the imperative paradigm.  ...  Acknowledgments We would like to thank all of the members of the Software Architecture Group at Hasso Plattner Institute and of Viewpoints Research Institute for comments and suggestions on the work, in  ... 
doi:10.5381/jot.2014.13.4.a1 fatcat:zdcbv35aobbknec2mb2vemrneq

Checked Load: Architectural support for JavaScript type-checking on mobile processors

Owen Anderson, Emily Fortuna, Luis Ceze, Susan Eggers
2011 2011 IEEE 17th International Symposium on High Performance Computer Architecture  
We show how to use Checked Load in the Nitro JavaScript just-in-time compiler (used in the Safari 5 browser).  ...  Speedups on a typical mobile processor range up to 44.6% (with a mean of 11.2%) in popular JavaScript benchmarks.  ...  This work was supported in part by NSF grant CCF-0702225 and a gift from Qualcomm.  ... 
doi:10.1109/hpca.2011.5749748 dblp:conf/hpca/AndersonFCE11 fatcat:oasdzfxnzrcsrfmb2c3nqd3h6q

A methodology for evaluating JavaScript execution behavior in interactive web applications

Jan Kasper Martinsen, Hakan Grahn
2011 2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)  
Typical for the established benchmarks is that they often are problem oriented, meaning that the purpose of the benchmark is to accept a problem input, solve this certain problem, and then end the computation  ...  , Richards, Deltablue, and Earley-Boyer are included in the V8 benchmark suite.  ... 
doi:10.1109/aiccsa.2011.6126611 dblp:conf/aiccsa/MartinsenG11 fatcat:pk5eomqgfzcbxjmotgouyvy57y

A decoupled predictor-directed stream prefetching architecture

S. Sair, T. Sherwood, B. Calder
2003 IEEE transactions on computers  
In this approach an action such as a cache miss or the use of a cache block has to occur for each prefetch generated.  ...  The queue is used to store fetch block predictions, which are then fed into the instruction cache in a later cycle. The fetch addresses in the queue are used to perform instruction cache prefetching.  ...  Acknowledgments We would like to thank the anonymous reviewers for providing very useful comments. This work was funded in part by NSF CAREER grant No.  ... 
doi:10.1109/tc.2003.1183943 fatcat:7dcfrvj2ifeq5avmaxnywrrod4

Columnar objects: improving the performance of analytical applications

Toni Mattis, Johannes Henning, Patrick Rein, Robert Hirschfeld, Malte Appeltauer
2015 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) - Onward! 2015  
We propose modifications to dynamic object-oriented runtimes to store collections of objects in a column-oriented memory layout and leverage a just-in-time compiler (JIT) to take advantage of the adjusted  ...  We implemented our concept in PyPy, a Python interpreter equipped with a tracing JIT.  ...  It detects hot paths and loops by observing whether certain parts of the interpreter state repeat, e.g. a repeating program counter may indicate a loop inside the user program.  ... 
doi:10.1145/2814228.2814230 dblp:conf/oopsla/MattisHRHA15 fatcat:53wg4ondqjajflhkcgbnbapcnu

Reducing cache misses using hardware and software page placement

Timothy Sherwood, Brad Calder, Joel Emer
1999 Proceedings of the 13th international conference on Supercomputing - ICS '99  
The hardware approach works by adding a page remap field to the TLB, which is used to allow a page to be remapped to a different color in the physically indexed cache while keeping the same physical page  ...  In this paper we examine the performance of compiler and hardware approaches for reordering pages in physically addressed caches to eliminate cache misses.  ...  This work was funded in part by NSF CAREER grant No. CCR-9733278, a gift from Microsoft, and a grant from Compaq Computer Corporation.  ... 
doi:10.1145/305138.305189 dblp:conf/ics/SherwoodCE99 fatcat:asdc5hmtxje6fotrvmpu6md23i

Constraints as a design pattern

Hesam Samimi, Alessandro Warth, Mahdi Eslamimehr, Alan Borning
2015 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) - Onward! 2015  
Constraint-based programming as an alternative has been observed to suffer much less from these flaws, where the "what" (the intention) is expressed rather than the "how" (the algorithm) in performing  ...  ., in a practical way and without suffering the breakdown of the approach as with the traditional constraint-based paradigm.  ...  Acknowledgments We thank Alan Kay for his lead to revisit Sketchpad and Todd Millstein for helping shape the narrative of this paper.  ... 
doi:10.1145/2814228.2814244 dblp:conf/oopsla/SamimiWEB15 fatcat:gkmnyzjq6ferrfewvucfbgylse
« Previous Showing results 1 — 15 out of 63 results