Distributed Operating System

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/introduction-to-os/os-types-evolution/asset-distributed-operating-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…