{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:40Z","timestamp":1763458900752,"version":"3.45.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100015570","name":"NFSC","doi-asserted-by":"crossref","award":["61303038"],"award-info":[{"award-number":["61303038"]}],"id":[{"id":"10.13039\/100015570","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2016,6,27]]},"abstract":"<jats:p>An emerging trend in developing large and complex applications on today\u2019s high-performance computers is to couple independent components into a comprehensive application. The components may employ the global file system to exchange their data when executing the application. In order to reduce the time required for input\/output (I\/O) data exchange and data transfer in the coupled systems or other applications, this article proposes a dynamic process migration mechanism on the basis of block access pattern similarity for utilizing the local file cache to exchange the data. We first introduce the scheme of the block access counting diagram to profile the process access pattern during a time period on the storage server. Next, we propose an algorithm that compares the access patterns of processes running on different computing nodes. Last, processes are migrated in order to group processes with similar access patterns. Consequently, the processes on the computing node can exchange their data by accessing the local file cache, instead of the global file system.<\/jats:p>\n                  <jats:p>The experimental results show that the proposed process migration mechanism can reduce the execution time required by the application because of the shorter I\/O time, as well as yield attractive I\/O throughput. In summary, this dynamic process migration technique can work fairly well for distributed applications whose data dependency rely on distributed file systems.<\/jats:p>","DOI":"10.1145\/2899002","type":"journal-article","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T08:29:28Z","timestamp":1465892968000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Process Migration Based on Block Access Patterns Occurring in Storage Servers"],"prefix":"10.1145","volume":"13","author":[{"given":"Jianwei","family":"Liao","sequence":"first","affiliation":[{"name":"Southwest University, China"}]},{"given":"Fran\u00e7ois","family":"Trahay","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Saclay, France"}]},{"given":"Guoqiang","family":"Xiao","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2010. Filesystem in Userspace (FUSE). http:\/\/fuse.sourceforge.net. (2010). Online; accessed Nov. 2010."},{"volume-title":"https:\/\/www.mpich.org. (2012). Online","year":"2012","key":"e_1_2_1_2_1","unstructured":"2012. MPICH2. https:\/\/www.mpich.org. (2012). Online; Accessed in Dec., 2012."},{"key":"e_1_2_1_3_1","volume-title":"http:\/\/institute.lanl.gov\/data\/software\/. (2014). Online","author":"MPI-IO","year":"2014","unstructured":"2014. MPI-IO Test (fs test). http:\/\/institute.lanl.gov\/data\/software\/. (2014). Online; Accessed in May, 2014."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125925"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183451"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2579674"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391231"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251203.1251223"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597652.2597679"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1364385.1364405"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970386.1970387"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342010391989"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2007.46"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2010.16"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2604594"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1175\/JCLI3764.1"},{"key":"e_1_2_1_18_1","volume-title":"HPEC 2005 Workshop.","author":"Haney Ryan","year":"2005","unstructured":"Ryan Haney, Theresa Meuse, Jeremy Kepner, and James Lebak. 2005. The HPEC challenge benchmark suite. In HPEC 2005 Workshop."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2493123.2462909"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physd.2006.11.008"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.104"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508010"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005056115"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1096673.1096695"},{"key":"e_1_2_1_25_1","first-page":"693","article-title":"A new concurrent checkpoint mechanism for embeded multi-core systems","volume":"31","author":"Liao Jianwei","year":"2012","unstructured":"Jianwei Liao. 2012. A new concurrent checkpoint mechanism for embeded multi-core systems. Comput. Inform. 31, 3 (2012), 693--709.","journal-title":"Comput. Inform."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.49"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2496595"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2342228"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03770-2_17"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2042476.2042483"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250727.1250729"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00382-002-0268-2"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362660"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.11.002"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.9"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03869-3_16"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5194\/gmd-5-1589-2012"},{"key":"e_1_2_1_38_1","volume-title":"Annual BMRC Modelling Workshop \u201cThe Australian Community Climate and Earth System Simulator (ACCESS)-Challenges and Opportunities.\u201d","author":"Valcke Sophie","year":"2006","unstructured":"Sophie Valcke, Reinhard G. Budich, Mick Carter, Eric Guilyardi, Marie-Alice Foujols, Michael Lautenschlager, Ren\u00e9 Redler, Lois Steenman-Clark, and Nils Wedi. 2006. The PRISM software framework and the OASIS coupler. In Annual BMRC Modelling Workshop \u201cThe Australian Community Climate and Earth System Simulator (ACCESS)-Challenges and Opportunities.\u201d"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/I-SPAN.2009.150"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413414"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168849"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.08.011"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.46"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2899002","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2899002","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2899002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:37:50Z","timestamp":1763458670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2899002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6,27]]}},"alternative-id":["10.1145\/2899002"],"URL":"https:\/\/doi.org\/10.1145\/2899002","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}