跳到主要內容

臺灣博碩士論文加值系統

(3.90.139.113) 您好!臺灣時間:2022/01/16 17:45
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:謝盛全
研究生(外文):Sheng-Chnan Hsieh
論文名稱:從電腦稽核角度探討資訊系統錯誤即時復原之問題
論文名稱(外文):Failure Recovery in the Multiprocessor Real-Time Systems from the Perspective of Computer Auditing
指導教授:徐立群徐立群引用關係賴秀卿賴秀卿引用關係
指導教授(外文):LihChyun ShuSyou-Ching Lai
學位類別:碩士
校院名稱:國立成功大學
系所名稱:會計學系碩博士班
學門:商業及管理學門
學類:會計學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:38
中文關鍵詞:即時系統骨牌效應錯誤擴散錯誤復原容錯
外文關鍵詞:real-time systemsdomino effectfault propogationfailure recoveryfault-tolerance
相關次數:
  • 被引用被引用:0
  • 點閱點閱:575
  • 評分評分:
  • 下載下載:148
  • 收藏至我的研究室書目清單書目收藏:1
許多國家都要求企業管理當局建立並維持一適當的內部控制系統,以確保企業資料與資訊系統的正確性與可靠性。今天絕大多數的企業活動都已電腦化,要達到內部控制的目的,資訊系統的容錯能力是十分重要的一環。
在此篇論文中,我們探討在多CPU且具有工作間通訊(interprocess communication)之即時系統下,系統容錯(fault-tolerance)之問題。工作間的通訊將使錯誤復原的問題複雜化,因為在正常的執行期間,訊息傳遞將導致系統中不同的工作產生資料相依性(data dependencies),當錯誤產生時,資料相依性將導致錯誤擴散(fault propagation),在最糟的情況下,將引起骨牌效應(the domino effect)。
我們提出了一個容錯方法-在各個工作中加入domino-free checkpoints,可以有效地解決錯誤擴散與骨牌效應的問題。在我們的容錯方法下,系統的錯誤復原可以控制在一個checkpoint interval之內完成,大大地縮短了錯誤復原所需的運算時間。此外,我們也提供了一組可排程性測試(schedulability tests),可以用來檢驗使用我們容錯方法的工作是否可以達到即時系統時效性的要求。最後,我們透過模擬實驗來比較我們的容錯方法與完全錯誤復原(full failure recovery)在效率上的差異。
In many countries, it is required for the management of the corporation to establish and maintain an adequate system of internal control to ensure the accuracy and reliability of corporate data. Today, most of the corporate operations have been computerized. To achieve the objective of internal control, fault-tolerant capability of information systems is very important.
In this thesis, we investigate the problem of fault tolerance in multiprocessor real-time systems where tasks may exchange information via interprocess communication. Interprocess communication complicates fault recovery because it induces data dependencies among tasks during normal operation. When a fault occurs, such dependencies could lead to fault propagation or the domino effect in the worst case.
We present a checkpoint scheme that forces domino-free checkpoints to tasks and effectively addresses the problem of fault propagation and the domino effect. Under our checkpoint scheme, the rollback recovery is bounded to at most one checkpoint interval of the faulty task, which has greatly reduced the execution time needed to recover from a fault. Furthermore, a set of schedulability tests is provided for tasks that employ our checkpoint scheme for failure recovery. And, we compare the performance of our checkpoint scheme with that of full failure recovery via simulation experiments.
Abstract (Chinese)------------------------------I
Abstract----------------------------------------II
Acknowledgement (Chinese)-----------------------III
Table of Contents-------------------------------IV
List of Figures---------------------------------V
List of Tables----------------------------------VI
Chapter 1. Introduction-------------------------1
Chapter 2. Background and Assumptions-----------4
2.1. Computation Model----------------------4
2.2. Domino Effect--------------------------9
2.3. Fault Model and Assumptions------------12
2.4. Checkpointing--------------------------12
Chapter 3. Checkpoint Scheme--------------------14
3.1. Domino-Free Checkpoints----------------14
3.2. Schedulability Analysis----------------20
Chapter 4. Performance Evaluation---------------22
4.1. Simulation Parameters------------------22
4.2. Simulation Results---------------------25
Chapter 5. Related Works------------------------33
Chapter 6. Conclusion---------------------------35
References--------------------------------------36
Vita (Chinese)----------------------------------38
1. S. Ghosh, R. Melhem, D. Mosse, and J. Sansarma, “Fault Tolerant Rate Monotonic Scheduling,” Real-Time System Journal, vol. 15, pp.149-181, 1998.
2. M. Pandya, and M. Malek, “Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks,” IEEE Trans. Computers, vol. 47, no. 10, pp. 1102-1112, 1998.
3. C.L. Liu, and J.W. Layland, “Scheduling Algorithm for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
4. S. Punnekkat, A. Burns, and R. Davis, “Analysis of Checkpointing for Real-Time Systems,” Real-Time System Journal, vol. 20, pp. 105-106, 2001.
5. J.F. Chiu, and G.M. Chiu, “Placing Forced Checkpoints in Distributed Real-Time Embedded Systems,” IEEE Real-Time Embedded System Workshop, Dec. 3, 2001.
6. L. Sha, R. Rajkumar, and J. P. Lehoczky, “Real-Time Synchronization Protocols for Multiprocessors,” Proceedings of the IEEE Real-Time System Symposium, 1988.
7. L. Sha, R. Rajkumar, and J. P. Lehoczky, “Priority Inheritance Protocols: an Approach to Real-Time Synchronization,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1175-1185, 1990.
8. J.W.S. Liu, “Real-Time Systems,” Prentice Hall, 2000.
9. R. Rajkumar, “Dealing with Suspending Periodic Tasks,” Technical Report RC 16971(# 75261), IBM T. J. Watson Research Center, 1991.
10. R.H.B. Netzer and J. Xu, “Necessary and Sufficient Conditions for Consistent Global Snapshots,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 165-169, 1995.
11. D. Manivannan, R.H.B. Netzer and M. Singhal, “Finding Consistent Global Checkpoints in a Distributed Computation,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 6, pp. 623-627, 1997.
12. J.S. Plank, “An Overview of Checkpointing in Uniprocessor and Distributed Systems, Focusing on Implementation and Performance”, Technical Report UT-CS-97-372. Dept. of Computer Science, Univ. of Tennessee, Jul. 1997.
13. L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” Commun. ACM, vol. 21, no. 7, pp. 558-565, 1978.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top