File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/IPDPS.2008.4536329
- Scopus: eid_2-s2.0-51049099598
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Lightweight process migration and memory prefetching in openMosix
Title | Lightweight process migration and memory prefetching in openMosix |
---|---|
Authors | |
Keywords | Benchmarking Computer networks Data transfer Time varying systems Openmosix |
Issue Date | 2008 |
Publisher | IEEE 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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/125724 |
ISBN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ho, RSC | en_HK |
dc.contributor.author | Wang, CL | en_HK |
dc.contributor.author | Lau, FCM | en_HK |
dc.date.accessioned | 2010-10-31T11:48:12Z | - |
dc.date.available | 2010-10-31T11:48:12Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.isbn | 978-1-4244-1693-6 | - |
dc.identifier.uri | http://hdl.handle.net/10722/125724 | - |
dc.description.abstract | We 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.language | eng | en_HK |
dc.publisher | IEEE Computer Society. | - |
dc.relation.ispartof | Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008 | en_HK |
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.subject | Benchmarking | - |
dc.subject | Computer networks | - |
dc.subject | Data transfer | - |
dc.subject | Time varying systems | - |
dc.subject | Openmosix | - |
dc.title | Lightweight process migration and memory prefetching in openMosix | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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.email | Wang, CL:clwang@cs.hku.hk | en_HK |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_HK |
dc.identifier.authority | Wang, CL=rp00183 | en_HK |
dc.identifier.authority | Lau, FCM=rp00221 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/IPDPS.2008.4536329 | en_HK |
dc.identifier.scopus | eid_2-s2.0-51049099598 | en_HK |
dc.identifier.hkuros | 180319 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-51049099598&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 12 | - |
dc.description.other | 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 | - |
dc.identifier.scopusauthorid | Ho, RSC=7201453501 | en_HK |
dc.identifier.scopusauthorid | Wang, CL=7501646188 | en_HK |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_HK |