Types of Multiprocessing Operating System

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…