4-Request-First-Come-First-Serve-Arbiter

4 request first come first serve arbiter design using verilog HDL

Table Of Content

• Requirements
• Architecture
• FSM
• Simulation
• Verification
• Synthesis

Requirements

First Come First Serve (FCFS) is an scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation first. This is managed with a FIFO queue. The full form of FCFS is First Come First Serve. Allows atomic operation in CPU i.e., when there is source sharing happens in between instructions then it should have some kind of locking/unlocking system to avoid overriding.

Architecture

FSM

Simulation

Verification

Synthesis