Types of Multiprocessing Operating System

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/operating-systems/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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…