Filters








620 Hits in 8.2 sec

Controlling garbage collection and heap growth to reduce the execution time of Java applications

Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham
2001 SIGPLAN notices  
We use these results to devise some guidelines for controlling garbage collection and heap growth in a conservative garbage collector in order to minimize application execution times.  ...  In this paper we use a large collection of Java applications and the highly tuned and widely used Boehm-Demers-Weiser conservative garbage collector to experimentally examine the extent to which the frequency  ...  (using a variety of configurations) and compare their execution time to our new approach to controlling garbage collection and heap growth.  ... 
doi:10.1145/504311.504308 fatcat:5m45liaverax7humfyzn4ct3si

Controlling garbage collection and heap growth to reduce the execution time of Java applications

Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham
2006 ACM Transactions on Programming Languages and Systems  
We use these results to devise some guidelines for controlling garbage collection and heap growth in a conservative garbage collector in order to minimize application execution times.  ...  In this paper we use a large collection of Java applications and the highly tuned and widely used Boehm-Demers-Weiser conservative garbage collector to experimentally examine the extent to which the frequency  ...  (using a variety of configurations) and compare their execution time to our new approach to controlling garbage collection and heap growth.  ... 
doi:10.1145/1152649.1152652 fatcat:nwoi5kranbeezpransurqcbarm

Controlling garbage collection and heap growth to reduce the execution time of Java applications

Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham
2001 Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications - OOPSLA '01  
We use these results to devise some guidelines for controlling garbage collection and heap growth in a conservative garbage collector in order to minimize application execution times.  ...  In this paper we use a large collection of Java applications and the highly tuned and widely used Boehm-Demers-Weiser conservative garbage collector to experimentally examine the extent to which the frequency  ...  (using a variety of configurations) and compare their execution time to our new approach to controlling garbage collection and heap growth.  ... 
doi:10.1145/504282.504308 dblp:conf/oopsla/BrechtALP01 fatcat:e5fj33p6mvdiboh5f45cdorvq4

The economics of garbage collection

Jeremy Singer, Richard E. Jones, Gavin Brown, Mikel Luján
2010 Proceedings of the 2010 international symposium on Memory management - ISMM '10  
As an application of this new theory, we show how allocation elasticity can be used to control the heap growth rate for variable sized heaps in Jikes RVM.  ...  An allocation curve for a program characterises how the amount of garbage collection activity required during its execution varies in relation to the heap size associated with that program.  ...  Hence fewer GCs are incurred in the larger heaps, so overall application execution time is reduced.  ... 
doi:10.1145/1806651.1806669 dblp:conf/iwmm/SingerJBL10 fatcat:3elp2tnucnfulle7rd3cwebo4y

Investigating throughput degradation behavior of Java application servers

Feng Xian, Witawas Srisa-an, Hong Jiang
2006 Proceedings of the 4th international symposium on Principles and practice of programming in Java - PPPJ '06  
Application servers are gaining popularity as a way for businesses to conduct day-to-day operations. Currently, the most adopted technologies for Application Servers are Java and .NET.  ...  As a preliminary study, we conducted experiments to observe the throughput degradation behavior of Java application servers and found that the throughput degrades ungracefully.  ...  Just prior to the complete failure of JBoss, the accumulative garbage collection time can take up over 50% of the overall execution time.  ... 
doi:10.1145/1168054.1168061 dblp:conf/pppj/XianSJ06 fatcat:zyghnrdzvngtnd3vfvv45zdjce

Garbage collection: Java application servers' Achilles heel

Feng Xian, Witawas Srisa-an, Hong Jiang
2008 Science of Computer Programming  
As a preliminary study, we conducted an experiment to observe the throughput degradation behavior of a widely-used Java application server running a standardized benchmark and found that throughput performance  ...  Java application servers are gaining popularity as a way for businesses to conduct day-to-day operations.  ...  We thank the anonymous reviewers for providing insightful comments for the final version of this paper.  ... 
doi:10.1016/j.scico.2007.07.008 fatcat:zttrcpvpinfenfenduc23iagm4

Java server performance: A case study of building efficient, scalable Jvms

R. Dimpsey, R. Arora, K. Kuiper
2000 IBM Systems Journal  
Focus is also given to memory management, specifically, object allocation, garbage collection, and heap management. Details of communication and connection scaling are also provided.  ...  The authors' specific contributions include the three-tier spin lock, the thread local heap and freelist merge, the dynamic heap growth algorithm, bitwise sweep, compaction avoidance, and the suite of  ...  The authors would especially like to thank Ben Hoflich, Walter Fraser, MengWu Wang, and Robert Reynolds. Thanks also go to the DB2 database group for their informed discussion of locking.  ... 
doi:10.1147/sj.391.0151 fatcat:pzh4f5yrcrdaflpwrkidw77yk4

A performance perspective on the Active Memory System

Witawas Srisa-an, Chia-Tien Dan Lo, J.Morris Chang
2002 Microprocessors and microsystems  
For the garbage collection, the turnaround time is usually determined by the size of the heap, the number of live objects, the number of object collected, and the amount of garbage collected.  ...  One major problem of using Java in real-time and embedded devices is the non-deterministic turnaround time of dynamic memory management systems (memory allocation and garbage collection).  ...  Acknowledgements Partial support for this work was provided by the National Science Foundation through grants CCR-0098235 and CCR-0113335.  ... 
doi:10.1016/s0141-9331(02)00067-4 fatcat:vkqzyo4hdfdrznsavh2x74mmoy

Crystal Gazer

Shoaib Akram, Jennifer Sartor, Kathryn McKinley, Lieven Eeckhout
2019 Proceedings of the ACM on Measurement and Analysis of Computing Systems  
state-of-the-art write-rationing garbage collection while at the same time extending PCM lifetime and reducing DRAM capacity needs.  ...  Compared to KG-W, the state-of-the-art in terms of improving PCM lifetime for hybrid memories, CGZ reduces the execution time overhead by 8% on average and up to 30%.  ...  We take the execution time of the longest running instance as the total execution time to run the workload. Nursery and Heap Sizes.  ... 
doi:10.1145/3322205.3311080 fatcat:3jp2f55stzashlxt6473cdtf4a

Realtime garbage collection in the JamaicaVM 3.0

Fridtjof Siebert
2007 Proceedings of the 5th international workshop on Java technologies for real-time and embedded systems - JTRES '07  
The JamaicaVM garbage collector is incremental to an extreme extent: single incremental steps of the garbage collector correspond to scanning only 32 bytes of memory and have a worst-case execution time  ...  ; and significant performance optimisation such as a faster write-barrier and a sweep phase that does not need to touch the objects and therefore reduces the number of cache misses caused during sweep.  ...  The worst case execution time of a unit of garbage collection work depends on the target architecture, processor For an application that uses up to 66% of the heap memory as reachable memory, Pmax = 18  ... 
doi:10.1145/1288940.1288954 dblp:conf/jtres/Siebert07 fatcat:ysomdij4i5h5xeq4le6jomi7mq

Emulating Hybrid Memory on NUMA Hardware [article]

Shoaib Akram, Jennifer B. Sartor, Kathryn S. McKinley, Lieven Eeckhout
2018 arXiv   pre-print
We use standard C library routines to allocate heap memory in the DRAM or NVM socket for use with explicit memory management or garbage collection.  ...  We evaluate the emulator using various configurations of write-rationing garbage collectors that improve NVM lifetimes by limiting writes to NVM, and use 15 applications from three benchmark suites with  ...  reduces the execution time, and KG-W increases the execution time.  ... 
arXiv:1808.00064v1 fatcat:dlgzpmcap5bbxdsuavhntbljy4

Detecting memory leaks in managed languages with Cork

Maria Jump, Kathryn S. McKinley
2009 Software, Practice & Experience  
It is space efficient (adding less than 1% to the heap) and time efficient (adding 2.3% on average to total execution time).  ...  We demonstrate that the construction and comparison of CPFGs across multiple collections adds on average 2.3% to total time to a system with a generational collector.  ...  ACKNOWLEDGEMENTS We would like to thank Steve Blackburn, Robin Garner, Xianglong Huang, and Jennifer Sartor for their help, input, and discussions on the preliminary versions of this work.  ... 
doi:10.1002/spe.945 fatcat:o5ikaxnvhfbptavwet7m4su7bq

A page fault equation for dynamic heap sizing

Y.C. Tay, X.R. Zong
2010 Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10  
Specifically, the number of faults and the execution time are reduced for both static and dynamically changing M .  ...  This paper presents a Heap Sizing Rule for how H should vary with M . The Rule can help an application trade less page faults for more garbage collection, thus reducing execution time.  ...  A larger heap would reduce the number of garbage collections, which would in turn reduce the application execution time, unless the heap is so large as to exceed (main) memory allocation and incur page  ... 
doi:10.1145/1712605.1712636 dblp:conf/wosp/TayZ10 fatcat:zagq4vd4e5czllvcekw2bp7bsq

Integrated symbol table, engine and heap memory management in multi-engine prolog

Paul Tarau
2011 SIGPLAN notices  
As our symbols represent not just Prolog atoms, but also handles to Java objects (including arbitrary size integers and decimals), everything is centered around a symbol garbage collection algorithm ensuring  ...  We describe an integrated solution to symbol, heap and logic engine memory management in a context where exchanges of arbitrary Prolog terms occur between multiple dynamically created engines, implemented  ...  Acknowledgement We are grateful to Kostis Sagonas and the anonymous reviewers of ISMM 2011 for their salient comments and constructive criticism. We thank NSF (research grant 1018172) for support.  ... 
doi:10.1145/2076022.1993497 fatcat:2zw4ug2gw5gtpjznekhl2w4vd4

Integrated symbol table, engine and heap memory management in multi-engine prolog

Paul Tarau
2011 Proceedings of the international symposium on Memory management - ISMM '11  
As our symbols represent not just Prolog atoms, but also handles to Java objects (including arbitrary size integers and decimals), everything is centered around a symbol garbage collection algorithm ensuring  ...  We describe an integrated solution to symbol, heap and logic engine memory management in a context where exchanges of arbitrary Prolog terms occur between multiple dynamically created engines, implemented  ...  Acknowledgement We are grateful to Kostis Sagonas and the anonymous reviewers of ISMM 2011 for their salient comments and constructive criticism. We thank NSF (research grant 1018172) for support.  ... 
doi:10.1145/1993478.1993497 dblp:conf/iwmm/Tarau11 fatcat:zh2or4bqjbg23mpfwvavukkbxu
« Previous Showing results 1 — 15 out of 620 results