簡易檢索 / 詳目顯示
| 研究生： |
王耀輝 Wang, Yao Huei |
|---|---|
| 論文名稱： |
分散系統中的飢餓，臨界競賽，死結及終止 Starvation, Critical Race, Deadlock and Termination in Distributed Systems |
| 指導教授： |
張宏慶
Jang, Hung Chin |
| 學位類別： |
碩士
Master |
| 系所名稱： |
理學院 - 應用數學系 Department of Mathematical Sciences |
| 論文出版年： | 1994 |
| 畢業學年度： | 82 |
| 語文別： | 英文 |
| 論文頁數： | 47 |
| 中文關鍵詞： | 分散式系統 、行程 、死結 、終止 、饑餓 、臨界競賽 |
| 外文關鍵詞： | distributed systems, provcess, deadlock, termination, starvation, critical race |
| 相關次數： | 點閱：439 下載：0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
分散式系統具有資源共享及運算更有效率等優點，使得分散式系統的應用越來越廣泛，有關分散式系統的研究也越受重視。一些存在分散式系統中的不正常現象，如：死結(deadlock)，饑餓(stravation)，及臨界競賽(critical race)往往會抵消掉資源共享的好處並且容易產生通訊(communication)的錯誤，另外，保證一分散系統中行程(process)均能正確的執行終止(termination)也是一項值得研究的重要課題。
本篇論文將就分散系統中的死結、饑餓、臨界競賽及中止等問題之過去的文獻提出討論，並分別比較優、缺點，最後列出一些尚未解決及值得深入研究的問題。
There are some addvantages of distributed systems, such as resources sharing and computing efficiency. Thus, the applications of distributed systems are more prevalent. The research of distributed systems had got great worth. Some undesired or abcdrmal behaviors such as deadlock, starvation, and critical race exist in distributed systems, which often offset the advantages of resources sharing and are prone to communication errors. It is very important to guarantee the processes of a distributed system which can terminate finitely.
In this thesis, we'll have thorough discussions and comparisons of those four properties through literature survey and then point out some unsolved problems at last.
中文摘要
Abstract
Contents-----i
List of Figures-----iii
List of Tables-----iv
0 Motivation-----1
1 Deadlock of Distributed Systems-----4
1.1 Related Works-----8
1.1.1 Graph-Oriented Approach-----8
1.1.2 Temporal Logic-Based Approach-----9
1.1.3 Priority-Based Approach-----11
1.1.4 Transaction-Control Approach-----13
1.1.5 Object-Oriented Approach-----14
1.2 Comparisons-----15
2 Termination of Distributed Systems-----21
2.1 Re1ated Works-----22
2.1.1 Rooted Spanning Tree-Based Approach-----22
2.1.2 Message Counting-Based Approach-----23
2.1.3 Distributed Snapshots-Based Approach-----25
2.2 Comparisons-----26
3 Critical Race and Starvation of Distributed Systems-----29
3.1 Related Works-----30
3.1.1 CRF Language-Based Approach: Karam et al. (1989)-----30
3.1.2 PSA-Tree-Based Approach: Karam and Buhr (1990)-----32
3.2 Comparisons-----33
4 Conclusions and Future Works-----36
List of Figures
1.1 Resource allocation graphs-----7
1.2 New program with benign cycles by added FIXP-----10
1.3 Example of undetected deadlock-----18
1.4 Example of false deadlock-----18
List of Tables
1.1 Table of comparisons-----19
2.1 Comparisonsof system characteristics-----26
2.2 Perfromance comparisons-----28
3.1 Comparison of critical and starvation analysis approaches-----34
(限達賢圖書館四樓資訊教室A單機使用)