R. Alonso and A. W. Appel. Advisor for flexible working sets. In Proceedings of the 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Controlling Garbage Collection and Heap Growth to.. - Brecht, Arjomandi, Li, .. (2000) (12 citations) (Correct)
....available and overheads due to paging significantly increase execution time. While a smaller threshold might reduce the execution time of such an application it can increase the execution time of other applications where the overhead due to frequent collections is significant. Alonso and Appel [1] implement an advice server that is used to determine how to take maximum advantage of memory resources available to a generational copying garbage collector for ML. After each garbage collection the application contacts the advisor process to determine how it should adjust its heap size. The ....
....example, the markand sweep copying collector reported on by Kim and Hsu [12] incurs overheads proportional to the amount of garbage being collected. It is unclear what impact delaying garbage collection would have in such environments. As discussed in more detail in Section 5, Alonso and Appel [1] demonstrate that garbage collection can be effectively controlled in a number of simultaneously executing applications. Although we intentionally focus on understanding how to minimize the run time of one application executing in isolation, we have tried to keep multiprogrammed environments in ....
R. Alonso and Andrew W. Appel. Advisor for flexible working sets. In Proceedings of the
Tools for the Development of Application-Specific.. - Krueger.. (1993) (33 citations) (Correct)
....if these buffers are in fact mapped into virtual memory. Stonebraker 1981] estimates that using a page manager designed for database access patterns could improve performance by an order of magnitude. A garbage collector is another application that accesses memory in a way unsuitable for LRU [Alonso Appel 1990]. Once a page has been garbage collected, it is not needed until the heap swings around again, yet LRU will keep it in memory because the page has been recently touched. If the number of garbage collected pages is large, the application s own code and data can end up being swapped out. Ideally, a ....
Alonso, R. and Appel, A. An Advisor for Flexible Working Sets. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 153--159, May 1990.
Application-Controlled File Caching Policies - Cao, Felten, Li (1994) (58 citations) (Correct)
....to control page replacement policy. These schemes do not provide resource allocation policies that satisfy our design principles to guarantee replacement performance. Furthermore, they are not concerned with file caching. Previous research on user level virtual memory page replacement policies [1, 9, 12, 15, 27] shows that application tailored replacement policies can improve performance significantly. With certain modifications, these user level policies might be used as user level file caching policies in our two level replacement. Recent work on prefetching [22, 10, 7] can be directly applied in ....
Rafael Alonso and Andrew W. Appel. An Advisor for Flexible Working Sets. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 153--162, May 1990.
Garbage Collection Without Paging - Matthew Hertz Yi (Correct)
No context found.
R. Alonso and A. W. Appel. Advisor for flexible working sets. In Proceedings of the 1990.
Automatic Heap Sizing: Taking Real Memory Into Account - Ting Yang Matthew (2004) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for flexible working sets. In Proceedings of the 1990.
Garbage Collection without Paging - Hertz, Feng, Berger (2005) (Correct)
No context found.
R. Alonso and A. W. Appel. Advisor for flexible working sets. In Proceedings of the 1990.
Page-Level Cooperative Garbage Collection - Matthew Hertz Yi (2004) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for fl exible working sets. In Proceedings of the 1990.
Autonomic Heap Sizing: Taking Real Memory into Account - Yang, Berger, Hertz.. (2004) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for flexible working sets. In Proceedings of the 1990.
Automatic Heap Sizing: Taking Real Memory into Account - Yang, Berger, Hertz.. (2004) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for flexible working sets. In Proceedings of the 1990.
Autonomic Heap Sizing: Taking Real Memory into Account - Yang, Berger, Hertz.. (2001) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for flexible working sets. In Proceedings of the 1990.
Page-Level Cooperative Garbage Collection - Matthew Hertz Yi (2004) (Correct)
No context found.
R. Alonso and A. W. Appel. An advisor for fl exible working sets. In Proceedings of the 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC