Interprocessor Arbitration

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-c-computer-architecture/multiprocessors/interprocessor-communication-unit/asset-interprocessor-arbitration after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: 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
  12. MOCK TEST:
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…