Generalized ERSS tree model: Revisiting working sets
暂无分享,去创建一个
[1] Akshat Verma,et al. pMapper: Power and Migration Cost Aware Application Placement in Virtualized Systems , 2008, Middleware.
[2] Kenneth Salem,et al. Adaptive block rearrangement , 1993, TOCS.
[3] John L. Hennessy,et al. WSCLOCK—a simple and effective algorithm for virtual memory management , 1981, SOSP.
[4] Mark A. Franklin,et al. Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison , 1978, IEEE Transactions on Computers.
[5] Medha Bhadkamkar,et al. EXCES: External caching in energy saving storage systems , 2008, 2008 IEEE 14th International Symposium on High Performance Computer Architecture.
[6] Rajeev Balasubramonian,et al. Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures , 2000, MICRO 33.
[7] Peter J. Denning,et al. Thrashing: its causes and prevention , 1968, AFIPS Fall Joint Computing Conference.
[8] Akshat Verma,et al. Power-aware dynamic placement of HPC applications , 2008, ICS '08.
[9] Sanjeev Kumar,et al. Dynamic tracking of page miss ratio curve for memory management , 2004, ASPLOS XI.
[10] Sang Lyul Min,et al. A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references , 2000, OSDI.
[11] James E. Smith,et al. Managing multi-configuration hardware via dynamic working set analysis , 2002, ISCA.
[12] Kaushik Dutta,et al. Application performance modeling in a virtualized environment , 2010, HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture.
[13] Per Stenström,et al. An analytical model of the working-set sizes in decision-support systems , 2000, SIGMETRICS '00.
[14] Wesley W. Chu,et al. The page fault frequency replacement algorithm , 1972, AFIPS '72 (Fall, part I).
[15] Vagelis Hristidis,et al. BORG: Block-reORGanization for Self-optimizing Storage Systems , 2009, FAST.
[16] Peter J. Denning,et al. The working set model for program behavior , 1968, CACM.
[17] R. F. Brown,et al. PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).
[18] Anoop Gupta,et al. Working sets, cache sizes, and node granularity issues for large-scale multiprocessors , 1993, ISCA '93.
[19] Vasanth Bala,et al. Dynamo: a transparent dynamic optimization system , 2000, SIGP.
[20] Trevor N. Mudge,et al. Improving NAND Flash Based Disk Caches , 2008, 2008 International Symposium on Computer Architecture.
[21] Alan P. Batson,et al. Measurements of major locality phases in symbolic reference strings , 1976, SIGMETRICS '76.
[22] Jim Zelenka,et al. Informed prefetching and caching , 1995, SOSP.
[23] Kang G. Shin,et al. Design and Implementation of Power-Aware Virtual Memory , 2003, USENIX ATC, General Track.
[24] Zhao Zhang,et al. Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems , 2008, 2008 IEEE 14th International Symposium on High Performance Computer Architecture.
[25] David A. Wood,et al. Implementing stack simulation for highly-associative memories , 1991, SIGMETRICS '91.
[26] Michael Stumm,et al. Reducing the harmful effects of last-level cache polluters with an OS-level, software-only pollute buffer , 2008, 2008 41st IEEE/ACM International Symposium on Microarchitecture.
[27] Peter J. Denning,et al. Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.
[28] Domenico Ferrari,et al. VSWS: The Variable-Interval Sampled Working Set Policy , 1983, IEEE Transactions on Software Engineering.
[29] 村井 均,et al. NAS Parallel Benchmarks によるHPFの評価 , 2006 .
[30] Michael Stumm,et al. RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations , 2009, ASPLOS.
[31] J. Demmel,et al. Sun Microsystems , 1996 .