Suzuki Kasami Algorithm

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/distributed-systems/distributed-communication/asset-suzuki-kasami-algorithm after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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

  1. 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. 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'.

  3. 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.

Loading lesson…