請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/65434完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 郭大維(Tei-Wei Kuo) | |
| dc.contributor.author | Sheng-Wei Cheng | en |
| dc.contributor.author | 鄭聖威 | zh_TW |
| dc.date.accessioned | 2021-06-16T23:42:38Z | - |
| dc.date.available | 2017-08-28 | |
| dc.date.copyright | 2012-08-28 | |
| dc.date.issued | 2012 | |
| dc.date.submitted | 2012-07-24 | |
| dc.identifier.citation | [1] Dejan S. Milojiˇci’c, Fred Douglis, Yves Paindaveine, Richard Wheeler, and Songnian
Zhou. Process migration. ACM Comput. Surv., 32:241–299, September 2000. [2] Steven Osman, Dinesh Subhraveti, Gong Su, and Jason Nieh. The design and implementation of zap: A system for migrating computing environments. In Proceedings of the Fifth Symposium on Operating Systems Design and Implementation, pages 361–376, 2002. [3] Clement Calmels Dave Hansen Serge Hallyn Cedric Le Goater, Daniel Lezcano and Hubertus Franke. Making applications mobile under linux. pages 347–367. Proceedings of the Ottawa Linux Symposium, 2006. [4] Pavel Emelyanov and Kir Kolyshkin. Pid namespaces in the 2.6.24 kernel. 2007. [5] Sukadev Bhattiprolu, Eric W. Biederman, Serge Hallyn, and Daniel Lezcano. Virtual servers and checkpoint/restart in mainstream linux. SIGOPS Oper. Syst. Rev., 42:104–113, July 2008. [6] Andrey Mirkin, Alexey Kuznetsov, and Kir Kolyshkin. Containers checkpointing and live migration. Technical report, Linux Symposium, 2008. [7] Fred Douglis and John Ousterhout. Transparent process migration: design alternatives and the sprite implementation. Softw. Pract. Exper., 21:757–785, July 1991. [8] Amnon Barak and Richard Wheeler. Mosix: an integrated multiprocessor unix. In Mobility, pages 41–53. ACMPress/Addison-Wesley Publishing Co., New York, NY, USA, 1999. [9] Yi-Min Wang, Yennun Huang, Kiem-Phong Vo, Pe-Yu Chung, and C. Kintala. Checkpointing and its applications. In Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing, FTCS ’95, pages 22–,Washington, DC, USA, 1995. IEEE Computer Society. [10] James S. Plank, Micah Beck, Gerry Kingsley, and Kai Li. Libckpt: Transparent checkpointing under unix. Technical report, Knoxville, TN, USA, 1994. [11] J.C. Gioiosa, R.and Sancho, S. Jiang, and F. Petrini. Transparent, incremental checkpointing at kernel level: a foundation for fault tolerance for parallel computers. 2005. [12] Kapil Arya Jason Ansel and Gene Cooperman. Dmtcp: Transparent checkpointing for cluster computations and the desktop. IPDPS’09, 2009. [13] Jim Basney Michael Litzkow, Todd Tannenbaum and Miron Livny. Checkpoint and migration of unix processes in the condor. distributed processing system. Technical report, 1997. [14] Ulrich Pferschy Hans Kellerer and David Pisinger. Knapsack Problems. Springer, Berlin, 2004. [15] L. G. Khachiyan. A polynomial-time algorithm for linear programming. Doklady Akademiia Nauk SSSR 244:S, pages 1093–1096, 1979. translated in Soviet Mathematics Doklady 20:1(1979), p. 191-194. [16] N. Karmarkar. A new polynomial-time algorithm for linear programming. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, STOC ’84, pages 302–311, New York, NY, USA, 1984. ACM. [17] David B. Shmoys and ’Eva Tardos. An approximation algorithm for the generalized assignment problem. Math. Program., 62(3):461–474, December 1993. [18] Wonder shaper. http://lartc.org/wondershaper/. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/65434 | - |
| dc.description.abstract | Due to the fast-growing demand for battery-powered mobile devices, running
computing-intensive programs on these devices could be more economical with the help of migrating processes to the idle devices in the vicinity. To migrate processes, user level implementation is an engaging policy in that it minimizes the dependency with the host system. However, resource management dependency is still inevitable even in user level implementation, and it becomes an important issue on how to resolve the legacy depen-dency problems after processes are migrated to idle devices. In this paper, we consider the processes with reserved sharing resources, and propose an approach to minimize the communication cost between the migrated processes and the resources they shared. A resource augmentation algorithm with approximation bound is proposed to decide the allocation of shared resources, and an algorithm with more restricted, yet plausible con-straints is proposed to decide an optimal allocation of shared resources in polynomial time. A series of experiments was conducted, and the results were very encouraging. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T23:42:38Z (GMT). No. of bitstreams: 1 ntu-101-R99922123-1.pdf: 682371 bytes, checksum: db1f2457451b4e74fa4ffd78e92660ce (MD5) Previous issue date: 2012 | en |
| dc.description.tableofcontents | List of Figures ix
List of Tables x 1 Introduction 1 2 System Model and Problem Definition 4 2.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 Algorithm for the ICC problem 9 3.1 An Optimal Chain-Based Integration Algorithm . . . . . . . . . . . . . . 9 3.2 A 2-Approximation Resource Augmentation Algorithm . . . . . . . . . . 13 4 Performance Evaluation 16 4.1 Environment Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4.2 Evaluation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 5 Conclusions and Future Work 20 Bibliography 21 | |
| dc.language.iso | en | |
| dc.subject | 餘留資源相依性 | zh_TW |
| dc.subject | 檢查點 | zh_TW |
| dc.subject | 程序移植 | zh_TW |
| dc.subject | 名稱空間 | zh_TW |
| dc.subject | Process migration | en |
| dc.subject | legacy resource dependency | en |
| dc.subject | namespace | en |
| dc.subject | checkpointing | en |
| dc.title | 於使用者空間上考量共享資料之程序移植 | zh_TW |
| dc.title | User-Space Process Migration with Shared Data Considerations | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 100-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.coadvisor | 張原豪(Yuan-Hao Chang) | |
| dc.contributor.oralexamcommittee | 陳銘憲(Ming-Syan Chen),洪士灝(Shih-Hao Hung),施吉昇(Chi-Sheng Shih) | |
| dc.subject.keyword | 程序移植,檢查點,名稱空間,餘留資源相依性, | zh_TW |
| dc.subject.keyword | Process migration,checkpointing,namespace,legacy resource dependency, | en |
| dc.relation.page | 23 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2012-07-25 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-101-1.pdf 未授權公開取用 | 666.38 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。