Types of Multiprocessing Operating System
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- 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
- SQL (Technical): SQL
- 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
- 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
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
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: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.
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.