先修課程: 資料結構 (data structures), 計算方法 (algorithms)

一、課程說明(Course Description)
PART I
1. Introduction
.Classification of parallel computers
.Performance of parallel algorithms
2. Shared-memory computers, basic techniques, and Brent Theorem

PART II

3. Tree Machine
4. Linear-processor array
5. Mesh-connected computers
6. Hypercubes
7. Perfect shuffles
8. Mesh-connected computers with multiple broadcasting
9. Processor arrays with reconfigurable bus systems

PART III

10. Systolic architectures
11. Fault-tolerance, randomized algorithms, P-completeness


二、指定用書(Text Books)




三、參考書籍(References)

[1] J. JaJa, An introduction to parallel algorithms, Addison Wesley, 1992.
[2] S. G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, 1989.
[3] Selected papers from journals and proceedings.



四、教學方式(Teaching Method)




五、教學進度(Syllabus)




六、成績考核(Evaluation)

midterm exam: 50%
final report: 50%
extra: discussion (+) absence (-)





七、可連結之網頁位址

上課時發給