Interprocessor Arbitration

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/compiler-design-it-specialist/multiprocessors/interprocessor-communication-unit/asset-interprocessor-arbitration after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): 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
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): 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
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on interprocessor arbitration in computer systems, explaining the need for a mechanism to manage access to shared resources like a system bus. The first part introduces the problem: only one of the CPU, IOP, or Memory can use the bus at a time, necessitating an arbitration mechanism to resolve contention. The second part details several arbitration methods. It begins with a diagram of a 'Serial Arbitration Procedure' showing a chain of arbiters. It then lists and explains four specific rules for selecting a request: Time Slice (round-robin), Polling (unit address polling), LRU (Least Recently Used), and FIFO (First In, First Out). The final segment covers the 'Rotating Daisy Chain' method, explaining that the PO output of the last device connects to the PI of the first, and the unit that most recently accessed the bus becomes the new bus controller, giving it the highest priority.

Chapters

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

    The video begins with a slide titled '3. Interprocessor Arbitration'. The text on the slide explains that only one of the CPU, IOP, and Memory can be granted to use the bus at a time, and an arbitration mechanism is needed to handle multiple requests and resolve contention. The instructor, visible in a small window, discusses this fundamental concept of resource sharing in a multiprocessor system, emphasizing the need for a fair and efficient way to grant access to the shared bus.

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

    The lecture transitions to a slide titled 'Rules for Selection of Request'. It lists four methods: Time Slice, Polling, LRU, and FIFO. The instructor explains that Time Slice uses a fixed-length, round-robin fashion. Polling involves the bus controller advancing an address to identify a requesting unit. LRU gives priority to the device that has not used the bus for the longest time. FIFO serves requests in the order they are received, using a queue. The final slide, 'Rotating Daisy Chain', describes a hardware-based method where the PO output of the last device connects to the PI of the first, and the unit that most recently accessed the bus becomes the new bus controller, giving it the highest priority.

The video provides a structured overview of interprocessor arbitration, starting with the fundamental problem of shared resource access and the necessity of an arbitration mechanism. It then systematically presents a range of solutions, from simple software-based rules like round-robin and polling to more complex hardware-based schemes like the rotating daisy chain. The progression moves from general principles to specific, detailed methods, illustrating the different trade-offs in fairness, complexity, and performance in managing contention for a shared system bus.

Loading lesson…