Types of Multiprocessing Operating System

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/operating-system/introduction-to-os/os-types-evolution/asset-types-of-multiprocessing-operating-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive overview of multiprocessing systems, specifically distinguishing between Symmetric and Asymmetric multiprocessing architectures. The lecture begins by defining Symmetric Multiprocessing (SMP), highlighting that a single operating system instance manages multiple identical processors sharing a common main memory. It emphasizes the peer-to-peer nature of SMP where no boss-worker hierarchy exists. The session then transitions to Asymmetric Multiprocessing, characterized by a master-slave relationship where a single master processor controls the system and assigns tasks to slave processors. Finally, the instructor outlines the advantages, such as increased throughput and reliability, and disadvantages, including complexity and memory requirements, concluding with a brief mathematical note on the screen.

Chapters

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

    The instructor introduces Symmetric Multiprocessing (SMP) using a slide titled 'Multiprocessing can be of two types'. He underlines key phrases like 'single OS instance' and 'identical processors' to emphasize that SMP involves multiple processors controlled by one OS instance connected to a single shared main memory. The diagram illustrates four processors, each with its own cache, connected via a 'Bus or Crossbar Switch' to shared memory and I/O. The instructor stresses that in SMP, all processors are peers with no boss-worker relationship, a concept common in Windows, Mac OS, and Linux. He specifically underlines 'peers' and 'no boss-worker relationship' to reinforce the equal status of processors in this architecture. He also notes that most multi-processing PC motherboards utilize this.

  2. 2:00 – 5:00 02:00-05:00

    The lecture shifts to Asymmetric Multiprocessing, defined as a master-slave relationship where one processor acts as a master controlling others that behave as slaves. The instructor underlines 'master-slave' and explains that specific tasks, like responding to hardware interrupts or executing kernel-mode code, may be restricted to a particular CPU. The diagram depicts a 'Boss' processor controlling 'Worker' processors, illustrating the boss-worker relationship. He notes that while such restrictions make systems easier to design, they tend to be less efficient than systems where all CPUs are utilized equally. He underlines 'easier to design' and 'less efficient' to contrast the trade-offs. He also mentions that user-mode code may be executed in any combination of processors.

  3. 5:00 – 6:27 05:00-06:27

    The final section covers the 'Advantage of multiprocessing' and 'Disadvantages'. Advantages listed include Increased Throughput, Economy of Scale, Increased Reliability (fault tolerance), and less battery consumption. The instructor explains that if one processor fails, the system slows down rather than halting, citing an example where ten processors mean a 10% slowdown if one fails. The disadvantages slide lists complexity, context switching overhead, and the need for large main memory. During this segment, the instructor writes '23 x 4 = 92' on the screen, possibly as a side note or calculation example. He also underlines 'Increased Throughput' and 'Increased Reliability'. He mentions that multiprocessing systems can cost less due to shared peripherals.

The video effectively contrasts Symmetric and Asymmetric multiprocessing, moving from architectural definitions to practical implications. It establishes that SMP offers efficiency through peer processors, while Asymmetric offers design simplicity through hierarchy. The final discussion on pros and cons provides a balanced view of why multiprocessing is used despite its added complexity.

Loading lesson…