Suzuki Kasami Algorithm
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces the Suzuki-Kasami algorithm as a token-based distributed mutual exclusion mechanism. The instructor presents four core properties: the system maintains one unique token, only the process holding that token may enter the critical section, each process keeps information about requests, and a process requesting the critical section broadcasts a request message to all others. The presentation then moves to the working of the algorithm, summarized in five steps: request, broadcast request, token sent, enter critical section, and pass token. A diagram with processes P1 through P4, a yellow token circle, dashed request arrows, and a red token-passing arrow illustrates the message flow. The final segment addresses message complexity: if the requesting process already holds the token, it needs 0 messages; otherwise, acquiring the token from another process requires approximately N messages. The instructor reinforces this by drawing a graph with nodes P1 to P5 on the whiteboard.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the Suzuki-Kasami algorithm as a token-based distributed mutual exclusion method. The slide lists four properties: 'A UNIQUE TOKEN IS MAINTAINED IN THE SYSTEM', 'ONLY THE PROCESS HOLDING THE TOKEN CAN ENTER THE CS', processes maintain request information, and a requesting process broadcasts a request message. The instructor circles 'token-based' and points to the unique-token rule, establishing that exclusive critical-section access depends on holding the single token.
2:00 – 5:00 02:00-05:00
The lecture continues with the same four-property slide, emphasizing how processes track requests and communicate via broadcast. The instructor points to a request-queue/information table and a diagram showing a process sending a request message to all other nodes. The view then switches to 'WORKING OF SUZUKI-KASAMI ALGORITHM', listing five steps: REQUEST, BROADCAST REQUEST, TOKEN SENT, ENTER CS, and PASS TOKEN. A legend defines the yellow token, dashed request arrows, red token-passing arrow, and process states 'WANTS CS / IN CS / EXIT CS'.
5:00 – 7:19 05:00-07:19
The final segment focuses on message complexity. The slide states 'Token already with requesting process -> 0 messages', meaning no communication is needed if the requester holds the token. The instructor explains that when a process must obtain the token from another, it requires approximately N messages. To illustrate message passing among processes, the instructor draws a graph with nodes P1 to P5 on the whiteboard while referring back to the five-step algorithm diagram.
The lecture builds from abstract properties to operational steps and then to performance analysis. First, the four rules define the token-based model: a single unique token grants exclusive critical-section entry, processes maintain request information, and requests are broadcast. Second, the five-step working sequence—request, broadcast request, token sent, enter CS, pass token—shows how the token circulates among processes P1-P4. Third, message complexity is quantified: 0 messages when the requester already holds the token, and about N messages otherwise. The whiteboard graph with P1-P5 nodes helps visualize the broadcast/token-passing communication pattern.

