| Course title | |||||
| ディペンダブルコンピューティング特論 [Selected Topics in Dependable Computing] | |||||
| Course category | courses for doctoral programs | Requirement | Credit | 2 | |
| Department | Year | ～ | Semester | 1st | |
| Course type | 1st | Course code | 1080445 | ||
| Instructor(s) | |||||
| 金子 敬一 [KANEKO Keiichi] | |||||
| Facility affiliation | Faculty of Engineering | Office | afjgxte/L1151 | Email address | |
| Course description |
| By taking interconnection networks as examples, we discuss them with respect to their classification, basic concepts, design metrics, deadlock and starvation, routing algorithms from the technical and engineering aspects. |
| Expected Learning |
| The students are requested to understand classification, basic concepts, design metrics, deadlock and starvation, and routing algorithms of interconnection networks from the technical and engineering aspects. |
| Course schedule |
|
Lesson 1 (Introduction) Parallel computation and networks, Parallel computer architecture, Considerations in network design, Classification of interconnection networks Lesson 2 (Basic Concepts) Direct networks Lesson 3 (Basic Concepts) Indirect networks Lesson 4 (Basic Concepts) Indirect networks Lesson 5 (Basic Concepts) Hybrid networks, Summary Lesson 6 (Message exchange layer) Networks and router model, Basic concepts, Switching technique Lesson 7 (Message exchange layer) Virtual channels, Hybrid switching technique Lesson 8 (Message exchange layer) Optimization of switching technique, Summary Lesson 9 Theory of deadlock avoidance and its extension (Deadlock) Lesson 10 Theory of deadlock avoidance and its extension (Livelock) Lesson 11 Theory of deadlock avoidance and its extension (Starvation) Lesson 12 Alternative method, Deadlock detection Lesson 13 Deadlock prevention and recovery, Livelock recovery, Summary Lesson 14 Basic concepts, Deterministic routing algorithms Lessond 15 Adaptive algorithms, Non-minimal routing algorithms, Summary |
| Prerequisites |
| Required Text(s) and Materials |
| English materials are distributed during the classes. |
| References |
| Reference books are introduced in the first lesson. |
| Assessment/Grading |
| Assessment is based on contribution to classes (60%) and presentation (40%). NOTE THAT IN EACH LESSON, THE STUDENT MUST MAKE REMARKS TO GIVE SOME CONTRIBUTION TO THE CLASSES. Just staying in the classroom without contribution is not considered to be attendance. Understanding classification, basic concepts, design metrics, deadlock and starvation, and routing algorithms of interconnection networks from the technical and engineering aspects is evaluated. In case of the online classes, the grade evaluation premises all attendances, and the attitude to learn and the presentation are comprehensively evaluated. Standard study time set by the our university is required to get the grade. |
| Message from instructor(s) |
| Course keywords |
| Interconnection Network, Parallel Computer, Message Exchange, Deadlock |
| Office hours |
| As needed. E-mail communication is welcome. k1kaneko@cc.tuat.ac.jp |
| Remarks 1 |
| Remarks 2 |
| Related URL |
| Lecture Language |
| English |
| Language Subject |
| Last update |
| 5/7/2020 1:25:40 PM |