0% found this document useful (0 votes)
48 views

Ce763: Distributed System & Applications (Pe - I) : Teaching Scheme Theory Practical Total Credit

This document outlines a course on distributed systems and applications. The course is worth 4 credits over 5 hours per week. It introduces students to distributed computing fundamentals and techniques for writing distributed programs. Topics include distributed systems, inter-process communication, and developing distributed applications using modern technologies. The course involves both theory and lab work, with students expected to complete 10 experiments related to distributed systems concepts.

Uploaded by

paku
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views

Ce763: Distributed System & Applications (Pe - I) : Teaching Scheme Theory Practical Total Credit

This document outlines a course on distributed systems and applications. The course is worth 4 credits over 5 hours per week. It introduces students to distributed computing fundamentals and techniques for writing distributed programs. Topics include distributed systems, inter-process communication, and developing distributed applications using modern technologies. The course involves both theory and lab work, with students expected to complete 10 experiments related to distributed systems concepts.

Uploaded by

paku
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

CE763: DISTRIBUTED SYSTEM & APPLICATIONS (PE - I)

Credits and Hours:

Teaching Scheme Theory Practical Total Credit

Hours/week 3 2 5
4
Marks 100 50 150

A. Objective of the Course:


 The objective of this course is to introduce students to the fundamentals and techniques
of distributed computing and provide them with the basic skills of how to write
distributed programs.
 Topics to be covered include: distributed computing, distributed programming,
distributed systems, distributed computing paradigms, inter-process communications,
group communications.
 Students are expected to develop distributed applications using latest technologies.

B. Outline of the course:


Sr. Minimum number of
Title of the unit
No. hours
1 Fundamentals of Distributed System 06
2 Interprocess Communication 10
3 Synchronization 10
4 XML and XML Web services 03
5 Enterprise Application Integration, Web Services 10
Introduction to Cluster Computing , Grid Computing and
6 04
Cloud Computing
7 Advanced Research Topics 02

Total hours (Theory): 45


Total hours (Lab): 30
Total hours: 75
C. Detailed Syllabus:
1 Fundamentals of Distributed System 06 Hours 13%
Architectures for Distributed Systems, Distributed Computing ,Models,
Workstation Model, Workstation-Server Model , Processor-pool Model
,Comparison of the Distributed Computing Models, Advantages of
Distributed Systems , Disadvantages of Distributed Systems ,Software
Concepts ,Network Operating System , Distributed Operating System ,
Multiprocessor Time-Sharing System ,Comparison of Different
Operating Systems ,Transparency ,Flexibility , Reliability ,
Performance , Scalability , Security , Fault Tolerance , Client-Server
Model , Client-Server Addressing , Client-Server Implementation ,
Client-Server Architecture
2. Interprocess Communication 10 Hours 23%
Message Passing ,Introduction to Message Passing ,Advantages and
Features of Message-Passing Systems ,IPC Message Format , IPC
Synchronization , Message Buffering Strategies , Multidatagram
Messaging , Process Addressing Techniques Failure Handling
Mechanism, Group Communication , Typesof Group Communication ,
Group Management ,Group Addressing and Message Delivery
,Reliability Mechanism , Message Ordering.
3. Synchronization 10 Hours 23%
Clock Synchronization, Physical Clocks, Clock Synchronization
Algorithms ,Use of Synchronized Clocks ,Logical Clocks, Event
Ordering, Implementation of Logical Clocks, Lamport’s Timestamps,
Vector Timestamps, Global State, Mutual Exclusio, Centralized
Algorithm, Distributed Algorithm, Token Ring Algorithm,
Comparison of Various Algorithms, Election Algorithms, Bully
Election Algorithm, Ring Election Algorithm, Election in a Wireless
Network, Deadlocks in Distributed Systems, Deadlock Modelling,
Handling Deadlocks in Distributed Systems, Distributed Deadlock
Prevention, Distributed Deadlock Detection, Distributed Deadlock
Recovery.
4. XML and XML Web services 03 Hours 06%
Introduction to XML, APIs for XML Processing, XML Web services
5. Enterprise Application Integration, Web Services 10 Hours 23%
Web services: Concepts, Protocols: SOAP, WSDL, UDDI,
Development of Web services, J2EE and .Net Interoperability
6. Introduction to Cluster Computing , Grid Computing and Cloud 04 Hours 08%
Computing
Overview of Cluster Computing: The Role of Clusters, Definition and
Taxonomy, Distributed Computing, Limitations, Cluster Planning,
Architecture and Cluster Software, Design Decisions, Network
Hardware, Network Software, Protocols, Distributed File Systems,
Virtualization technologies, Benchmarks.
Introduction: What is a grid?, Infrastructure of hardware and software,
Main Projects and Applications, The Open Grid Forum, International
Grid Trust Federation, Grid Architecture: Overview of Resource
Managers, Overview of Grid Systems, Application Management, Grid
Application Description Languages, Application Partitioning, Meta-
scheduling, Mapping, Monitoring, Web Services, Grid Portals.
What is Cloud computing and its history and evolution? Cloud
Computing architecture and industry frameworks such as Map
Reduce, Cloud computing infrastructure requirements and limitations,
Practical applications of cloud computing for various industries,
including a case study.
7. Advanced Research Topics 02 Hours 04%
Advanced Research Topics & Issues

D. Instructional Method and Pedagogy:


 At the start of course, the course delivery pattern, prerequisite of the subject will
be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board,
OHP etc.
 Faculty would use coached problem solving method as it is class format in which
faculty provide a structured, guided context for students working collaboratively to solve
problems.
 Attendance is compulsory in lectures and laboratory which carries 5% component
of the overall evaluation.
 Minimum two internal exams will be conducted and average of two will be
considered as a part of 15% overall evaluation.
 Assignments based on course content will be given to the students at the end of
each unit/topic and will be evaluated at regular interval. It carries a weight age of 5%.
 Surprise tests/Quizzes will be conducted which carries 5% component of the
overall evaluation.
 The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
 Minimum 10 experiments are suggested in the laboratory related to course
content.

E. Student Learning Outcomes:


 The course will allow students to apply problem solving (analysis, design, and
development ) skills to distributed applications
 Student will be able to identify and decompose complex systems into its components
parts
 Students will be able to integrate OS and programming language concepts to
solve/implement the (distributed) components of the systems
 Students will be able to develop suites of networking protocols for implementing the
communicating components
 Students will be able to evaluate or validate their implementations via simulations and/or
realistic projects

F. Recommended Study Material:


 Text Books:
1. Sunita Mahajan & Seema Shah, “Distributed Computing”, Oxford University Press
 Reference Books:
1. Karanjit S. Siyan, “Inside TCP/IP”, third edition, New Riders Publishing , ISBN: 1-
56205-714-6
2. Marko Boger “Java in Distributed System” , John Wiley and Sons Ltd.
3. David Reilly and Michael Reilly “ Java Network Programming and Distributed
Computing” , Addison-Wesley

You might also like