File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Lightweight process migration and memory prefetching in openMosix

TitleLightweight process migration and memory prefetching in openMosix
Authors
KeywordsBenchmarking
Computer networks
Data transfer
Time varying systems
Openmosix
Issue Date2008
PublisherIEEE Computer Society.
Citation
The 2008 IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), Miami, FL., 14-18 April 2008. In Proceedings of the 22nd IPDPS, 2008, p. 1-12 How to Cite?
AbstractWe propose a lightweight process migration mechanism and an adaptive memory prefetching scheme called AMPoM (Adaptive Memory Prefetching in openMosix), whose goal is to reduce the migration freeze time in openMosix while ensuring the execution efficiency of migrants. To minimize the freeze time, our system transfers only a few pages to the destination node during process migration. After the migration, AMPoM analyzes the spatial locality of memory access and iteratively prefetches memory pages from remote to hide the latency of inter-node page faults. AMPoM adopts a unique algorithm to decide which and how many pages to prefetch. It tends to prefetch more aggressively when a sequential access pattern is developed, when the paging rate of the process is high or when the network is busy. This advanced strategy makes AMPoM highly adaptive to different application behaviors and system dynamics. The HPC Challenge benchmark results show that AMPoM can avoid 98% of migration freeze time while preventing 85-99% of page fault requests after the migration. Compared to openMosix which does not have remote page fault, AMPoM induces a modest overhead of 0-5% additional runtime. When the working set of a migrant is small, AMPoM outperforms openMosix considerably due to the reduced amount of data transfer. These results indicate that by exploiting memory access locality and prefetching, process migration can be a lightweight operation with little software overhead in remote paging. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/125724
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorHo, RSCen_HK
dc.contributor.authorWang, CLen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2010-10-31T11:48:12Z-
dc.date.available2010-10-31T11:48:12Z-
dc.date.issued2008en_HK
dc.identifier.citationThe 2008 IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), Miami, FL., 14-18 April 2008. In Proceedings of the 22nd IPDPS, 2008, p. 1-12en_HK
dc.identifier.isbn978-1-4244-1693-6-
dc.identifier.urihttp://hdl.handle.net/10722/125724-
dc.description.abstractWe propose a lightweight process migration mechanism and an adaptive memory prefetching scheme called AMPoM (Adaptive Memory Prefetching in openMosix), whose goal is to reduce the migration freeze time in openMosix while ensuring the execution efficiency of migrants. To minimize the freeze time, our system transfers only a few pages to the destination node during process migration. After the migration, AMPoM analyzes the spatial locality of memory access and iteratively prefetches memory pages from remote to hide the latency of inter-node page faults. AMPoM adopts a unique algorithm to decide which and how many pages to prefetch. It tends to prefetch more aggressively when a sequential access pattern is developed, when the paging rate of the process is high or when the network is busy. This advanced strategy makes AMPoM highly adaptive to different application behaviors and system dynamics. The HPC Challenge benchmark results show that AMPoM can avoid 98% of migration freeze time while preventing 85-99% of page fault requests after the migration. Compared to openMosix which does not have remote page fault, AMPoM induces a modest overhead of 0-5% additional runtime. When the working set of a migrant is small, AMPoM outperforms openMosix considerably due to the reduced amount of data transfer. These results indicate that by exploiting memory access locality and prefetching, process migration can be a lightweight operation with little software overhead in remote paging. ©2008 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE Computer Society.-
dc.relation.ispartofProceedings of the IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIPDPS Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectBenchmarking-
dc.subjectComputer networks-
dc.subjectData transfer-
dc.subjectTime varying systems-
dc.subjectOpenmosix-
dc.titleLightweight process migration and memory prefetching in openMosixen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-1693-6 &volume=&spage=1&epage=12&date=2008&atitle=Lightweight+process+migration+and+memory+prefetching+in+openMosix-
dc.identifier.emailWang, CL:clwang@cs.hku.hken_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityWang, CL=rp00183en_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/IPDPS.2008.4536329en_HK
dc.identifier.scopuseid_2-s2.0-51049099598en_HK
dc.identifier.hkuros180319en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51049099598&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage12-
dc.description.otherThe 2008 IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), Miami, FL., 14-18 April 2008. In Proceedings of the 22nd IPDPS, 2008, p. 1-12-
dc.identifier.scopusauthoridHo, RSC=7201453501en_HK
dc.identifier.scopusauthoridWang, CL=7501646188en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats