Distributed Operating System

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/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. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, 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, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…