1. | Distributed System Architectures & Models-1 | 1.System Architecture 2.Standardization 3.Software s 4.s 5.Hardware Organization 6.Software Organization |
||
2. | Distributed System Architectures & Models-2 | 1.System Architectures 2.Multiple-Client/Single Server 3.Advantages of Client/Server Computing 4.Client-Server Communication 5.Client-Server Timing 6.Problems with Multiple-Client/Single Server 7.Multiple Client/Multiple Servers 8.Multiple Client/Multiple Server Communication 9.Service across Multiple Servers 10.Mobile computing 11.Thin Client 12.Multitier Systems 13.Multitier System Alternatives 14Communication in Multitier Systems 15.Peer-to-Peer Systems |
||
3. | Distributed System Architectures & Models-3 | 1.Example Client/Server Middleware 2.OMA Modules 3.OMG Model 4.CORBA Features 5.OMAs Client-Server Structure 6.ORB Functions 7.ORB Structure 8.CORBA Method Invocations 9.Design Requirements of Distributed Systems 10.Changing Network Characteristics 11.Scalability |
||
4. | Distributed System Architectures & Models-4 | 1.Guiding Performance Principles 2.Quality of Service(QoS) 3.Dependability 4.How to Improve Dependability 5.Hardware Redundancy 6.Software Redundancy |
||
5. | Overview of Computer Networks | 1.Networks and Communication 2.What is a protocol? 3.ed Protocols 4.Message Format 5.Message Transmission 6.OSI Protocol Summary |
||
6. | Data RepresentationData Transmission Format | 1.Data Representation 2.Data Transmission Format 3.RPC in Presence of Failures 4.Lost Request Message 5.Lost Reply Message 6.Server Crashes 7.Client Crashes 8.Asynchronous RPC |
||
7. | Network ApplicationsApplication Process | 1.RMI Implementation 2.CORBA Stub & Skeleton Generation 3.Some More RMI components 4.Binding a Client to an 5.Parameter Passing 6.Message-d Communication 7.Synchronous/Asynchronous Messaging 8.Transient/Persistent Messaging 9.Persistent Messaging Alternatives 10.Transient Messaging Alternatives 11.Message Brokers |
||
8. | Internet Transport Protocol Services | 1.Internet Transport Protocol Services 2.Internet Apps: Their Protocols and Transport 3.Protocols 4.How to Transfer Data Through the Network 5.Circuit Switching 6.Packet Switching 7.Packet Switching vs Circuit Switching 8.Delays in Packet Switching |
||
9. | Distributed Naming-1 | 1.Name, Addresses, etc. 2.Composed Naming Domains 3.Requirements on Name Services 4.Name Spaces 5.Naming Graph with Single Root 6.Name Space Distribution |
||
10. | Distributed Naming-2 | 1.Name Resolution 2.Navigation 3.Iterative Navigation Example 4.Recursive Navigation Example 5.Recursive Name Resolution 6.Communication Cost Comparison of Iterative vs Recursive 6.Name & Directory Services 7.Domain Name System(DNS) 8.DNS Types 9.DNS:Root Name Servers 10.Simple DNS Example 11.DNS: iterated queries 12.DNS Records 13.DNS Record Types 14.DNS Protocol & Messages 15.X500 Directory Service |
||
11. | Distributed Naming-3 | 1.DNS Protocol & Messages 2.X500 Directory Service 3.X500 Name Tree 4.Example X500 DIB Entry 5.X500 Directory Accesses 6.Discovery Services 7.JINI Discovery Related Services 8.JINI Discovery Scenario 9.CORBA References 10.Naming graph in CORBA Nameing Service 11.CORBA Naming Context Interface(Partial) |
||
12. | Distributed Naming-4 | 1.Access Control/Authentication 2.Communication 3.Mounting of File Systems 4.Naming 5.Automounting 6.Caching in Sun NFS 7.Semantics of File Sharing |
||
13. | Distributed Naming-5 | 1.File Locking in NFS 2.Andrew File System(AFS) 3.AFS Architecture 4.File Name Space 5.AFS System Call Intercept 6.Implementation of System Calls 7.Callback Mechanism 8.File Semantics 9.File Semantics in AFSv2 10.Cashe Consistency & Concurrency Control |
||
14. | Synchronization | 1.Synchronization Problem 2.Clock Synchronization 3.Clocks 4.Logical vs Physical Clocks 5.Physical Clocks 6.Universal Coordinated Time 7.Physical Clock Synchronization 8.Cristians Algorithm 9.Berkeley Algorithm 10.Averaging Algorithm |
||
15. | SynchronizationGlobal State and Election Algorithms-1 | 1.Logical Clock Synchronization 2.Totally-Ordered Multicast 3.Vector Clocks 4.Causally-Ordered Multicasting 5.Enforcing Causal Communication |
||
16. | SynchronizationGlobal State and Election Algorithms-2 | 1.Serializable History 2.Inconsistent Retrievals Problem 3.Resolving Inconsistent Retrievals Problem 4.Distributed Transaction Serializability 5.Global Non-serializability 6.Concurrency Control 7.Locking-d Algorithms 8.Two-Phase Locking(2PL) 9.Strict 2PL 10.Locking Example with Strict 2PL 11.Locking Rules for Strict 2PL 12.Centralized 2PL 13.Distributed 2PL 14.Deadlock |