Philadelphia University Faculty of –Information technology Department of Applied Computer Science

Philadelphia University Faculty of –Information technology Department of Applied Computer Science First Semester, 2010/2011 Course Syllabus Course Title:…

Please download to get full document.

View again

of 3
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.


Publish on:

Views: 4 | Pages: 3

Extension: PDF | Download: 0

Philadelphia University Faculty of –Information technology Department of Applied Computer Science First Semester, 2010/2011 Course Syllabus Course Title: Concurrent and Distributed Programming Code: 0721321 Course Level: 3 Prerequisite: 0711232 Lecture Time: Credit hours: 4 Academic Staff Specifics Name Rank Office Office Hours E-mail Address Course module description: The course will focus on the major problems specific to Concurrent and Distributed programming (synchronization, communication, mutual exclusion), and on the means by which such problems can be avoided or overcome (hardware support, semaphores, monitors…). Language features for Concurrent and Distributed Programming, and a set of selected Concurrent and Distributed algorithms are also presented. Students will be given an experience in concurrent and distributed programming. Course module objectives: The aim of this course is to introduce and detail the main concepts and practices in concurrent and distributed programming. Course/ module components  Books (title , author (s), publisher, year of publication) Principles of Concurrent and Distributed Programming, M. Ben-Ari, Addisson Wesley, Second edition, 2006.  Support material (s): Textbook slides Teaching methods: Lectures, tutorials, problem solving, practical works Page 1 of 3 Learning outcomes:  Knowledge and understanding 1. Understand and discuss the main concepts of concurrency and distribution 2. Understand and discuss the problems specific to concurrency and distribution and the means by which these problems are overcome. 3. Understand and discuss some known distributed algorithms.  Cognitive skills (thinking and analysis). 1. Analyze and Design simple concurrent programs using threads, semaphores and monitors 2. Analyze and Design simple distributed programs using channels, RPC,..  Communication skills (personal and academic).  Practical and subject specific skills (Transferable Skills). 1. 1.Program concurrent programs with Java Threads 2. Program simple distributed programs suing Linda, RPC.. Assessment instruments  Quizzes.  Home works: Practical projects  Final examination: 50 marks Allocation of Marks Assessment Instruments Mark First examination 15 Second examination 15 Final examination: 50 marks 50 Quizzes, Home works 20 Total 100 Documentation and academic honesty  Documentation style (with illustrative examples)  Protection by copyright  Avoiding plagiarism. Page 2 of 3 Course/module academic calendar Homework/reports Week Basic and support material to be covered and their due dates Introduction: What is concurrent programming? (1) The Concurrent Programming Abstraction (1) (2) The Concurrent Programming Abstraction (2) – Tutorial (3) The Critical Section Problem The Advanced Algorithms for the Critical Section (4) Problem (5) Semaphores (1) (6) Semaphores (2) – Tutorial First examination Critical regions (7) Monitors (1) (8) Monitors (2) – Tutorial (9) Channels (1) (10) Channels (2) – Tutorial (11) Spaces First homework due Second examination (12) Distributed Algorithms (1) (13) Distributed Algorithms (2) – Tutorial (14) Global properties (15) Consensus (1) Second homework due Specimen examination (Optional) (16) Consensus (2) – Tutorial Final Examination Expected Workload: On average students need to spend 2 hours of study and preparation for each 50-minute lecture/tutorial. Attendance policy: Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit without a medical or emergency excuse acceptable to and approved by the Dean of the relevant college/faculty shall not be allowed to take the final examination and shall receive a mark of zero for the course. If the excuse is approved by the Dean, the student shall be considered to have withdrawn from the course. Module references Books Concurrent Systems: An integrated approach to Operating Systems, Distributed Systems and Data Base, Jean Bacon, Addison Wesley, 2003 Page 3 of 3
Related Search
Similar documents
View more...
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks

We need your sign to support Project to invent "SMART AND CONTROLLABLE REFLECTIVE BALLOONS" to cover the Sun and Save Our Earth.

More details...

Sign Now!

We are very appreciated for your Prompt Action!