{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:40:57Z","timestamp":1648716057116},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T00:00:00Z","timestamp":1340323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"},{"start":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T00:00:00Z","timestamp":1340323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Virtual memory mechanisms allow offering more RAM memory space to processes than the amount of memory physically available in the system, using disk space as a memory extension. When there is not enough RAM memory to satisfy the active processes\u2019 working sets, the system throughput may be significantly reduced, due to the excessive paging activity. Such situation is known as <jats:italic>memory thrashing<\/jats:italic>. This paper presents an evaluation of some commodity desktop operating systems under thrashing conditions. We also identify and discuss the performance data about memory management available in each system and the mechanisms available to collect it. A portable benchmark tool was developed to bring each system to a thrashing situation and then pull it back to normality. The results observed from the systems under study are compared and discussed.<\/jats:p>","DOI":"10.1007\/s13173-012-0080-8","type":"journal-article","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T14:43:41Z","timestamp":1340289821000},"page":"29-42","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluation of desktop operating systems under thrashing conditions"],"prefix":"10.1007","volume":"19","author":[{"given":"Carlos","family":"Maziero","sequence":"first","affiliation":[]},{"given":"Douglas","family":"dos Santos","sequence":"additional","affiliation":[]},{"given":"Altair","family":"Santin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,22]]},"reference":[{"key":"80_CR1","unstructured":"Badam A, Pai V (2011) SSDAlloc: hybrid SSD\/RAM memory management made easy. In: USENIX conference on networked systems design and implementation, pp 16\u201330"},{"key":"80_CR2","doi-asserted-by":"crossref","unstructured":"Blake R (1982) Optimal control of thrashing. In: ACM SIGMETRICS conference on measurement and modeling of computer systems. ACM, New York, pp 1\u201310","DOI":"10.1145\/1035332.1035295"},{"key":"80_CR3","volume-title":"Understanding the Linux Kernel","author":"D Bovet","year":"2005","unstructured":"Bovet D, Cesati M (2005) Understanding the Linux Kernel, 3rd edn. O\u2019Reilly& Associates, Inc., USA","edition":"3"},{"key":"80_CR4","unstructured":"Chartock H, Snyder P (1991) Virtual swap space in SunOS. In: European UNIX users group conference"},{"issue":"5","key":"80_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1002\/(SICI)1097-024X(20000425)30:5<567::AID-SPE312>3.0.CO;2-Z","volume":"30","author":"T Cortes","year":"2000","unstructured":"Cortes T, Becerra Y, Cervera R (2000) Swap compression: esurrecting old ideas. Softw Pract Exp 30(5):567\u2013587","journal-title":"Softw Pract Exp"},{"key":"80_CR6","unstructured":"Cowardin J (1997) A proc buffer for kernel instrumentation. Master\u2019s thesis, The College of William& Mary"},{"issue":"14","key":"80_CR7","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1016\/j.ins.2009.02.002","volume":"179","author":"Y Deng","year":"2009","unstructured":"Deng Y (2009) Exploiting the performance gains of modern disk drives by enhancing data locality. Inf Sci 179(14):2494\u20132511","journal-title":"Inf Sci"},{"key":"80_CR8","doi-asserted-by":"crossref","unstructured":"Denning P (1968) Thrashing: its causes and prevention. In: Proceedings of the December 9\u201311, 1968, fall joint computer conference, part I, AFIPS \u201968 (Fall, part I). ACM, New York, pp 915\u2013922","DOI":"10.1145\/1476589.1476705"},{"issue":"1","key":"80_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TSE.1980.230464","volume":"6","author":"P Denning","year":"1980","unstructured":"Denning P (1980) Working sets past and present. IEEE Trans Softw Eng 6(1):64\u201384","journal-title":"IEEE Trans Softw Eng"},{"key":"80_CR10","unstructured":"dos Santos D, Maziero C (2009) Avalia\u00e7\u00e3o do comportamento de sistemas operacionais de mercado em situa\u00e7\u00e3o de thrashing. In: VI operating systems workshop. Brazilian Computer Society, Brazil, pp 1\u201312 (in Portuguese)"},{"key":"80_CR11","unstructured":"Douglis F (1993) The compression cache: using on-line compression to extend physical memory. In: Winter USENIX conference, pp 519\u2013529"},{"key":"80_CR12","doi-asserted-by":"crossref","unstructured":"Eranian S (2008) What can performance counters do for memory subsystem analysis? In: ACM SIGPLAN workshop on memory systems performance and correctness. ACM, USA, pp 26\u201330","DOI":"10.1145\/1353522.1353531"},{"key":"80_CR13","unstructured":"Gupta N (2010) CompCache: compressed caching for Linux. Google Summer of Code. http:\/\/code.google.com\/p\/compcache"},{"issue":"4","key":"80_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186736.1186737","volume":"34","author":"J Henning","year":"2006","unstructured":"Henning J (2006) SPEC CPU2006 benchmark descriptions. SIGARCH Comput Archit News 34(4):1\u201317","journal-title":"SIGARCH Comput Archit News"},{"key":"80_CR15","unstructured":"Jiang S, Zhang X (2001) Adaptive page replacement to protect thrashing in Linux. In: 5th annual Linux showcase and conference. USENIX Association, Berkeley, pp 16\u201316"},{"issue":"3","key":"80_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/spe.437","volume":"32","author":"S Jiang","year":"2002","unstructured":"Jiang S, Zhang X (2002) TPF: a dynamic system thrashing protection facility. Softw Pract Exp 32(3):295\u2013318","journal-title":"Softw Pract Exp"},{"issue":"1\u20134","key":"80_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.peva.2004.10.002","volume":"60","author":"S Jiang","year":"2005","unstructured":"Jiang S, Zhang X (2005) Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems. Perform Eval 60(1\u20134):5\u201329","journal-title":"Perform Eval"},{"issue":"3","key":"80_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.is.2007.11.001","volume":"33","author":"SH Kim","year":"2008","unstructured":"Kim SH, Yu B, Chang JY (2008) Zoned-partitioning of tree-like access methods. Inf Syst 33(3):315\u2013331","journal-title":"Inf Syst"},{"key":"80_CR19","doi-asserted-by":"crossref","unstructured":"Markatos E (1996) Using remote memory to avoid disk thrashing: a simulation study. In: ACM international workshop on modeling, analysis, and simulation of computer and telecommunication systems. IEEE Computer Society, San Jose, pp 69\u201373","DOI":"10.1109\/MASCOT.1996.500996"},{"key":"80_CR20","unstructured":"Mauro J, McDougall R (2001) Solaris Internals: Core Kernel Components. Prentice Hall PTR, Englewood Cliffs"},{"key":"80_CR21","unstructured":"Mayer U (2008) Linux\/Unix nBench. http:\/\/www.tux.org\/mayer\/linux\/bmark.html"},{"key":"80_CR22","unstructured":"McCalpin J (1991\u20132007) Stream: sustainable memory bandwidth in high performance computers. Technical report, University of Virginia, Charlottesville. A continually updated technical report. http:\/\/www.cs.virginia.edu\/stream\/"},{"key":"80_CR23","first-page":"19","volume":"1","author":"J McCalpin","year":"1995","unstructured":"McCalpin J (1995) Memory bandwidth and machine balance in current high performance computers. IEEE Comput Soc Tech Comm Comput Archit Newsl 1:19\u201325","journal-title":"IEEE Comput Soc Tech Comm Comput Archit Newsl"},{"key":"80_CR24","volume-title":"The design and implementation of the FreeBSD operating system","author":"M McKusick","year":"2004","unstructured":"McKusick M, Neville-Neil G (2004) The design and implementation of the FreeBSD operating system. Pearson Education, Boston"},{"key":"80_CR25","unstructured":"McVoy L, Staelin C (1996) LMbench: portable tools for performance analysis. In: USENIX annual technical conference. USENIX Association, Berkeley, pp 279\u2013294"},{"key":"80_CR26","unstructured":"Morton A (2005) Swap partition vs swap file. https:\/\/lkml.org\/lkml\/2005\/7\/7\/326"},{"key":"80_CR27","unstructured":"Mucci P, London K (1998) The cachebench report. Technical Report CEWES MSRC\/PET TR\/98-25, Nichols Research Corporation"},{"key":"80_CR28","doi-asserted-by":"crossref","unstructured":"Newhall T, Amato D, Pshenichkin A (2008) Reliable adaptable network RAM. In: IEEE Cluster Conference","DOI":"10.1109\/CLUSTR.2008.4663750"},{"key":"80_CR29","doi-asserted-by":"crossref","unstructured":"Newhall T, Finney S, Ganchev K, Spiegel M (2003) Nswap: a network swapping module for Linux clusters. In: Euro-Par international conference on parallel and distributed computing","DOI":"10.1007\/978-3-540-45209-6_157"},{"issue":"3","key":"80_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/comjnl\/bxl001","volume":"49","author":"M Reuven","year":"2006","unstructured":"Reuven M, Wiseman Y (2006) Medium-term scheduler as a solution for the thrashing effect. Comput J 49(3):297\u2013309","journal-title":"Comput J"},{"issue":"2","key":"80_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/250007.250012","volume":"31","author":"L Rizzo","year":"1997","unstructured":"Rizzo L (1997) A very fast algorithm for RAM compression. ACM SIGOPS Oper Syst Rev 31(2):36\u201345","journal-title":"ACM SIGOPS Oper Syst Rev"},{"key":"80_CR32","unstructured":"Ruemmler C, Wilkes J (1993) NIX disk access patterns. In USENIX winter technical conference"},{"key":"80_CR33","unstructured":"Russinovich M, Solomon D (2004) Microsoft Windows Internals. Microsoft Press, Redmond"},{"key":"80_CR34","unstructured":"Smith Z (2008) Bandwidth: a memory bandwidth benchmark. http:\/\/home.comcast.net\/fbui\/bandwidth.html"},{"key":"80_CR35","volume-title":"Modern operating systems","author":"A Tanenbaum","year":"2001","unstructured":"Tanenbaum A (2001) Modern operating systems. Prentice Hall, Englewood Cliffs"},{"key":"80_CR36","unstructured":"Tuduce I, Gross T (2005) Adaptive main memory compression. In: USENIX annual technical conference, pp 237\u2013250"},{"key":"80_CR37","doi-asserted-by":"crossref","unstructured":"Weisberg P, Wiseman Y (2009) Using 4kb page size for virtual memory is obsolete. In: IEEE international conference on information reuse and integration. IEEE Press, Piscataway, pp 262\u2013265","DOI":"10.1109\/IRI.2009.5211562"},{"key":"80_CR38","unstructured":"Wilson P, Kaplan S, Smaragdakis Y (1999) The case for compressed caching in virtual memory systems. In: USENIX annual technical conference, pp 101\u2013116"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-012-0080-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13173-012-0080-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-012-0080-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-012-0080-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T19:15:37Z","timestamp":1630523737000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1007\/s13173-012-0080-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,22]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s13173-012-0080-8","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"value":"0104-6500","type":"print"},{"value":"1678-4804","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,22]]},"assertion":[{"value":"18 November 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2012","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}