AI 使用規則: 本課程無涉及AI使用 Not applicable
<br>先修課程: 資料結構 (data structures), 計算方法 (algorithms)
<br>
<br> 一、課程說明(Course Desc<x>ription)
<br>PART I
<br>1. Introduction
<br>  .Classification of parallel computers                
<br>  .Performance of parallel algorithms
<br>2. Shared-memory computers, basic techniques, and Brent Theorem
<br>
<br>PART II
<br>
<br>3. Tree Machine                                                
<br>4. Linear-processor array
<br>5. Mesh-connected computers                          
<br>6. Hypercubes
<br>7. Perfect shuffles                                             
<br>8. Mesh-connected computers with multiple broadcasting
<br>9. Processor arrays with reconfigurable bus systems
<br>
<br>PART III
<br>
<br>10. Systolic architectures                                               
<br>11. Fault-tolerance, randomized algorithms, P-completeness
<br>
<br>
<br> 二、指定用書(Text Books)
<br>
<br>無 (上課時發給講義)
<br>
<br>
<br> 三、參考書籍(References)
<br>
<br>[1] J. JaJa, An introduction to parallel algorithms, Addison Wesley, 1992.
<br>[2] S. G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, 1989.
<br>[3] Selected papers from journals and proceedings.
<br>
<br>
<br>
<br> 四、教學方式(Teaching Method)
<br>
<br>
<br>
<br>
<br> 五、教學進度(Syllabus)
<br>
<br>
<br>
<br>
<br> 六、成績考核(Evaluation)
<br>
<br>midterm exam: 50%
<br>final exam: 50%
<br>extra: discussion (+) absence (-)
<br>
<br>
<br>
<br>
<br>
<br> 七、可連結之網頁位址
<br>
<br>上課時發給
<br>
<br>
<br>
<br>
<br>
<br>