1 / 5

COMP 3320 Distributed Systems

COMP 3320 Distributed Systems. Equivalent to: COMP3050 Distributed Computing Systems Pre-requisite: COMP 2320 Operating Systems and COMP 2330 Data Communications and Networking Name: Prof. Joseph Kee-Yin NG TA: Miss. Hui Chui Ying, Phoebe (cyhui@comp.hkbu.edu.hk)

kiri
Download Presentation

COMP 3320 Distributed Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. COMP 3320 Distributed Systems Equivalent to: COMP3050 Distributed Computing Systems Pre-requisite: COMP 2320 Operating Systems and COMP 2330 Data Communications and Networking Name: Prof. Joseph Kee-Yin NG TA: Miss. Hui Chui Ying, Phoebe (cyhui@comp.hkbu.edu.hk) Office: R730 (Run Run Shaw Building) Phone: 3411-7864 Email: jng@comp.hkbu.edu.hk ICQ: 113034029 HomePage: http://www.comp.hkbu.edu.hk/~jng Class Page: http://www.comp.hkbu.edu.hk/~jng/comp3320.html http://www.comp.hkbu.edu.hk/~comp3320 http://www.comp.hkbu.edu.hk/~comp3050

  2. Subject Outline Description: • This course introduces the needs, key concepts, and techniques underlying the design and engineering of distributed computing systems. The discussion will be emphasis on communications, synchronization and concurrency control, process management, distributed file services, and case studies. Also included is an introduction to clustering computing and parallel algorithms. Objectives: • This objective of this subject is to examine techniques underlying the design and engineering of distributed computing systems, and compares distributed solutions with traditional designs. Also included is an introduction to clustering computing and parallel algorithms. References: • A.S. Tanenbaum, and Maarten van Steen, Distributed Systems Principles and Paradigms, Prentice Hall, 2002. • A.S. Tanenbaum, Distributed Operating Systems, Prentice Hall International Editions, 1995. • C. Brown, UNIX Distributed Programming, Prentice Hall, 1994. • G. Coulouris, J. Dollimore and T. Kindberg, Distributed Systems: Concepts and Design, 3rd Edition, 2001 • Doreen L. Galli, Distributed Operating Systems: Concepts and Practice, Prentice Hall, 2000 Assessment • Continuous Assessment (20%) • Examination (80%)

  3. Subject Outline (continue) Passing grade and Grade Distribution (Guidelines) • A (0% - 20%) • A+B (40% - 75%) • C, D, E, F (25% - 60%) • Average of this class should be either B- or C+. • To pass this subject, the final exam should be >= 30. • To pass this subject, the overall score should be >= 35. • To get the “A” grade, the overall score should be at least 68. • Each person, each semester can have one supplementary exam. • The highest grade for supplementary exam is “D”. A warning for those copy cats • Whoever get caught in copying homework and other assignments, the instructor has the right to penalize his/her grade when necessary. • By default, both the copier and the one who provide the copy will get a zero mark for the assignment.

  4. Subject Contents I. Introduction to Distributed Systems (Chapter 1) • Review on what you have learnt • Advantages / Disadvantages over Centralized Systems C. Design issues - Transparency, Flexibility, Reliability, Performance, Scalability II. Communications (Chapter 2) A. IPC & Client-Server Computing B. Remote Procedure Call (Sun RPC & Java RMI) & Socket Programming C. Group Communication - Broadcasting, Multicasting, Unicasting III. Synchronization & Concurrency Control (Chapter 3) A. Clock Synchronization B. Mutual Exclusion & Election Algorithms C. Deadlocks in Distributed Systems D. Concurrency Control in Distributed Systems E. Transaction Management

  5. Subject Contents IV. Processes & Processors (Chapter 4) A. System Models & Scheduling in Distributed Systems B. Fault Tolerance V. File Services (Chapter 5) A. Distributed File System Design and Implementation B. Distributed File Systems Case Studies VI. Cluster Computing A. Introduction to Cluster Computing B. Parallel Algorithms

More Related