Lecture Distributed Systems - Lecture 4: Deadlock-free Packet Switching
Số trang: 14
Loại file: pdf
Dung lượng: 81.80 KB
Lượt xem: 16
Lượt tải: 0
Xem trước 2 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Lecture Distributed Systems - Lecture 4: Deadlock-free Packet Switching. In this chapter, students will be able to understand: Store and forward deadlock, model, requirements, solutions, buffer graph, suitable buffer and guaranteed path, the buffer-graph controller, the destination scheme, the hops-so-far scheme, acyclic orientation based scheme, forward and backward-count controllers, forward and backward-state controllers, forward-state versus forward-count.
Nội dung trích xuất từ tài liệu:
Lecture Distributed Systems - Lecture 4: Deadlock-free Packet Switching
Nội dung trích xuất từ tài liệu:
Lecture Distributed Systems - Lecture 4: Deadlock-free Packet Switching
Tìm kiếm theo từ khóa liên quan:
Distributed Systems Lecture Distributed Systems Deadlock Packet Switching Deadlock-free Packet Switching Buffer graph Suitable bufferTài liệu liên quan:
-
Lecture Distributed systems (3/E) - Chapter 3: Processes
62 trang 211 0 0 -
Lecture Distributed systems (3/E) - Chapter 6: Coordination
71 trang 35 0 0 -
distributed systems - concepts and design (5th edition): part 1
480 trang 34 0 0 -
Lecture Distributed Systems - Lecture 11: Commit Protocols
14 trang 33 0 0 -
Operating System Concepts - Appendix A: UnixBSD
64 trang 31 0 0 -
Lecture Distributed Systems - Lecture 9: Distributed Deadlock Detection
14 trang 30 0 0 -
Lecture Distributed systems (3/E) - Chapter 2: Architectures
40 trang 29 0 0 -
Lecture Distributed Systems - Lecture 1: Introduction
10 trang 29 0 0 -
Operating System Concepts - Chapter 9: Virtual Memory
70 trang 28 0 0 -
Lecture Distributed Systems - Lecture 3: Routing Algorithms
15 trang 27 0 0