Distributed Operating System

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/operating-system/introduction-to-os/os-types-evolution/asset-distributed-operating-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the fundamental concepts of a Distributed Operating System (OS). The instructor defines it as software running over a collection of independent, networked, and loosely coupled nodes that are physically separate. A key characteristic highlighted is that these nodes do not share memory or a clock; instead, they possess local memory and communicate via networks like high-speed buses or the Internet. The lecture presents an architectural diagram showing distributed applications and services running across multiple machines (Machine A, B, C), each with its own kernel. Finally, the instructor outlines four major reasons for building distributed systems: resource sharing, computation speedup, reliability, and communication, citing examples like Plan 9 and Inferno.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with a slide titled 'Distributed OS'. The instructor reads and underlines the definition: 'A distributed operating system is a software over a collection of independent, networked, communicating, loosely coupled nodes and physically separate computational nodes.' He emphasizes the terms 'independent', 'networked', 'communicating', and 'loosely coupled' by underlining them. To illustrate the concept of nodes communicating, he draws a rough diagram of four squares connected by lines, representing a network topology. He explains that these modes do not share memory or a clock, meaning each node has its own local memory.

  2. 2:00 – 3:20 02:00-03:20

    The instructor moves to the architectural diagram showing 'Machine A', 'Machine B', and 'Machine C'. The diagram displays layers: 'Distributed applications' at the top, 'Distributed operating system services' in the middle, and 'Kernel' at the bottom for each machine, all connected by a 'Network'. He explains that jobs are serviced by multiple CPUs and each node holds a specific software subset. He then lists four major reasons for building distributed systems, underlining 'resource sharing', 'computation speedup', 'reliability', and 'communication'. He concludes this section by mentioning examples such as 'Plan 9 from Bell Labs' and 'Inferno'.

The lecture progresses from a textual definition of a Distributed OS to a visual architectural representation. It establishes that distributed systems consist of physically separate nodes communicating over a network without shared memory. The lesson concludes by justifying the use of such systems through four key benefits: resource sharing, speedup, reliability, and communication, providing historical context with examples like Plan 9.

Loading lesson…