|
|
| BILI5080 | Computer Networks and Parallel Computing | 3+0+0 | ECTS:7.5 | | Year / Semester | Spring Semester | | Level of Course | Second Cycle | | Status | Elective | | Department | DEPARTMENT of COMPUTER ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Prof. Dr. Cemal KÖSE | | Co-Lecturer | None | | Language of instruction | | | Professional practise ( internship ) | None | | | | The aim of the course: | | The course aims to introduce theory of parallel computing techniques, parallel programming on cluster of workstations, and the internet as the parallel programming environment. |
| Programme Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | PO - 1 : | implement internet, computer networks and network applications. | 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - 11 - 13 - 14 - 15 | 1 | | PO - 2 : | develop programs for networked multi-computers.
| 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - 11 - 13 - 14 - 15 | 1 | | PO - 3 : | compare and evaluate parallel applications on different multi computers systems. | 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - 11 - 13 - 14 - 15 | 1 | | PO - 4 : | develop pipeline, synchronous and asynchronous computations on shared and virtually shared memory multiple computer system. | 1 - 2 - 3 - 4 - 5 - 6 - 8 - 9 - 10 - 11 - 13 - 14 - 15 | 1 | | PO - 5 : | develop parallel software for various numerical algorithms.
değişik sayısal algoritmalar için paralel yazılımlar geliştirebilecekler.
| 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - 11 - 12 - 13 - 14 - 15 | 1,3 | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), PO : Learning Outcome | | |
| The Internet; network applications. Client server interactions. The socket interface and socket programming. Remote procedure call. Parallel computers and networked computers as a multi-computer platform. Message passing computing; Using workstation clusters (PVM and MPI) . Debugging and evaluating parallel programs. Ideal (embarrassingly) parallel computations. Partitioning and divide-and-conquer strategies. Pipilene techniques. Synchronous computations. Load balancing and termination detection. Programming with shared and virtually shared memory. Multi processing and Pthreads. Algorithms and parallel applications; sorting algorithms, numerical algorithms, image processing, searching and optimization. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | The Internet, network applications, client server interactions
| | | Week 2 | The socket interface and socket programmingi and Remote procedure call | | | Week 3 | Parallel computers and networked computers as a multi-computer platform
| | | Week 4 | Message passing computing | | | Week 5 | Using workstation clusters (PVM and MPI)
| | | Week 6 | Debugging and evaluating parallel programs
| | | Week 7 | Ideal (embarrassingly) parallel computations
| | | Week 8 | Partitioning and divide-and-conquer strategies | | | Week 9 | Mid-term exam | | | Week 10 | Pipilene techniques | | | Week 11 | Synchronous computations | | | Week 12 | Load balancing and termination detection | | | Week 13 | Programming with shared and virtually shared memory
| | | Week 14 | Multi processing and Pthreads
| | | Week 15 | Algorithms and parallel applications; sorting algorithms, numerical algorithms, image processing, searching and optimization | | | Week 16 | End-of-term exam | | | |
| 1 | Barry Wilkinson (1999), Parallel Programming; Techniques and applications using networked workstations and parallel computers, Prentice Hall. | | | |
| 1 | Douglas E. Comer, (2001), Computer Networks and Internets with Internet application, Prentice Hall. | | | 2 | Alan Chalmers (1996), Practical parallel processing, Thomson Computer Press.
| | | 3 | Kai Hwang (1993), Advanced computer architecture; parallelism, scalability and programmability, McGraw Hill. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 16/04/2025 | 2 | 50 | | End-of-term exam | 16 | 08/06/2025 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Diğer 1 | 10 | 1 | 10 | | Diğer 2 | 10 | 1 | 10 | | Total work load | | | 20 |
|