Distributed Operating System

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-os/introduction-to-os/os-types-evolution/asset-distributed-operating-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. 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…