{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:41:21Z","timestamp":1740807681861,"version":"3.38.0"},"reference-count":28,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2018,9]]},"abstract":"<jats:p> There is a growing need to perform large computations on small systems, as access to large systems is not widely available and cannot keep up with the size of the data that needs to be processed. Recently, a runtime system for programs using a library that implements the Message Passing Interface (MPI), called Big Data MPI (BDMPI), that allows MPI programs whose aggregate amount of memory exceeds the physical amount of memory to be executed efficiently by utilizing node-level cooperative multi-tasking. In this paper we present a virtual memory subsystem which we implemented as part of the BDMPI runtime. Our new virtual memory subsystem, which we call SBMA takes advantage of BDMPI\u2019s node-level cooperative multi-tasking in order to intelligently determine the parts of the virtual address space that need to be loaded to and unloaded from the main memory. Benchmarking using a synthetic application shows that for the use cases relevant to BDMPI, the overhead incurred by the memory protection constructs necessary for the BDMPI-SBMA system is amortized such that it performs as fast as explicit data movement by the application developer. Furthermore, testing SBMA with five different classes of applications showed that with no modification to the original MPI program, speedups from 2\u00d7\u201312\u00d7 over a standard BDMPI implementation can be achieved for the included applications. <\/jats:p>","DOI":"10.1177\/1094342017690975","type":"journal-article","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T10:02:22Z","timestamp":1487584942000},"page":"744-759","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["A virtual memory manager optimized for node-level cooperative multi-tasking in memory constrained systems"],"prefix":"10.1177","volume":"32","author":[{"given":"Jeremy","family":"Iverson","sequence":"first","affiliation":[{"name":"University of Minnesota, USA"}]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[{"name":"University of Minnesota, USA"}]}],"member":"179","published-online":{"date-parts":[[2017,2,1]]},"reference":[{"key":"bibr1-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"bibr2-1094342017690975","unstructured":"Brown AD (2005) Explicit compiler-based memory management for out-of-core applications. Technical report, Stanford University."},{"journal-title":"In AAAI","year":"2010","author":"Carlson A","key":"bibr3-1094342017690975"},{"issue":"4","key":"bibr4-1094342017690975","first-page":"33","volume":"12","author":"Das S","year":"2016","journal-title":"ACM Transactions on Architecture and Code Optimization (TACO)"},{"key":"bibr5-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.43"},{"volume-title":"Fundamentals of Database Systems","year":"2009","author":"Elmasri R","key":"bibr6-1094342017690975"},{"key":"bibr7-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1109\/HOTOS.1995.513458"},{"key":"bibr8-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1109\/SC.Companion.2012.99"},{"key":"bibr9-1094342017690975","unstructured":"hadoop (2007) ApacheTMHadoop\u00ae. Available at: http:\/\/hadoop.apache.org."},{"key":"bibr10-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815971"},{"key":"bibr11-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"key":"bibr12-1094342017690975","first-page":"144","volume-title":"Parallel, distributed and network-based processing, 2004. proceedings. 12th Euromicro conference on","author":"Kee Y","year":"2004"},{"key":"bibr13-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.07.003"},{"key":"bibr14-1094342017690975","first-page":"12","volume-title":"Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation","author":"Lee CH","year":"1994"},{"key":"bibr15-1094342017690975","first-page":"361","volume":"5","author":"Lewis DD","year":"2004","journal-title":"Machine Learning Research"},{"key":"bibr16-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"bibr17-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"bibr18-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1109\/Co-HPC.2014.8"},{"key":"bibr19-1094342017690975","unstructured":"Page L, Brin S, Motwani R, (1999) The pagerank citation ranking: Bringing order to the web. Technical report."},{"key":"bibr20-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369141"},{"key":"bibr21-1094342017690975","unstructured":"parmetis (2013) ParMetis. Available at: http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/parmetis\/overview."},{"key":"bibr22-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250709"},{"key":"bibr23-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1137\/070707233"},{"key":"bibr24-1094342017690975","doi-asserted-by":"crossref","unstructured":"Smith S, Karypis G (2016) A medium-grained algorithm for distributed sparse tensor factorization. Technical report, University of Minnesota.","DOI":"10.1109\/IPDPS.2016.113"},{"key":"bibr25-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/050\/09"},{"key":"bibr26-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-013-0309-0"},{"key":"bibr27-1094342017690975","doi-asserted-by":"publisher","DOI":"10.1145\/2155620.2155671"},{"volume-title":"Proceedings of the 2nd USENIX conference on hot topics in cloud computing","year":"2010","author":"Zaharia M","key":"bibr28-1094342017690975"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342017690975","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342017690975","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342017690975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:35:05Z","timestamp":1740760505000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342017690975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["10.1177\/1094342017690975"],"URL":"https:\/\/doi.org\/10.1177\/1094342017690975","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}