Model of Threading

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/operating-system/threads-process-creation/threading-models/asset-model-of-threading after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, 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 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces the concept of multithreading models, specifically distinguishing between user threads and kernel threads. It details the Many-to-One model, highlighting its limitations regarding blocking calls and CPU utilization. The presentation then transitions to the One-to-One model, explaining its advantages in concurrency and overhead trade-offs. Finally, it covers the Many-to-Many model as a hybrid approach combining the best features of the previous two.

Chapters

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

    The lecture begins with a slide titled "Multithreading Models," defining user threads as application-level and kernel threads as OS-supported. The focus shifts to the "Many-To-One Model," where many user-level threads are mapped onto a single kernel thread. A diagram illustrates this with multiple wavy lines connecting to one 'k'. The instructor explains that if a blocking system call occurs, the entire process blocks, even if other threads could continue. He writes "T1L" and "T2L" on the diagram to label specific user threads and "P1" to denote the process. He notes that because a single kernel thread operates on only one CPU, this model cannot split processes across multiple CPUs. He mentions Green threads for Solaris as a historical example.

  2. 2:00 – 3:14 02:00-03:14

    The presentation transitions to the "One-To-One Model," creating a separate kernel thread for each user thread. The diagram changes to show four distinct 'k' circles, each linked to a wavy line. The instructor highlights that this model overcomes blocking system call issues and allows splitting across multiple CPUs. However, he points out the significant overhead involved in managing these threads. He cites Linux and Windows 95 to XP as implementations. The final segment introduces the "Many-To-Many Model," which multiplexes user threads onto an equal or smaller number of kernel threads. The diagram shows multiple user threads mapping to three kernel threads. This approach combines the best features of previous models, allowing variable allocation of kernel threads based on CPU count.

The lecture provides a comprehensive overview of multithreading architectures. It starts by establishing the fundamental difference between user and kernel threads. The Many-to-One model is critiqued for its inability to handle parallelism and blocking calls effectively. The One-to-One model is presented as a robust alternative that enables true parallelism but suffers from high overhead. Finally, the Many-to-Many model is described as a hybrid solution that balances flexibility and performance by allowing the kernel to manage a pool of threads for user-level execution efficiently and effectively. This progression illustrates the evolution of threading strategies to optimize system performance and resource management.

Loading lesson…