Skip to main content



First Come First Serve

  In my previous publish titled “Disk Scheduling”, I tried to provide an explanation for approximately the fundamentals of disk scheduling. In this & upcoming posts, we will look a number of the extensively used disk preparation algorithms. In this pole, I will start with the most easy and normally used disk scheduling algorithm called fcfs .   First Come First Serve (FCFS) This is the most effective shape of preparation. It is similar the FIFO CPU scheduling set of rules. According to FCFS algorithm, all requests might be serviced inside the equal order wherein they come. In other words, request will be serviced within the sequential manner. It does not offer the fastest get entry to and it is also now not most fulfilling. It has higher are trying to find time examine to other algorithms. For instance, A disk queue with request of input, output of two blocks on cylinders are as ninety eight, 183, 37, 122, 14, 124, 65, 67. If disk head is first of all at cylin

Latest posts

New Material Can Generate Hydrogen From Fresh, Salt, or Polluted Water by Exposure to Sunlight

Dive Deep Into Hidden World of Quantum States to Find Silicon’s Successor in Race Against Moore’s Law

Titanate Nanowire Mask Filter Can Kill Bacteria and Viruses Including SARS-CoV-2COVID-19

New Heat Conduction Technology a Game Changer for Server Farms and Aircraft

Transparent Solar Panels for Windows Hit New Efficiency Record – Could Help Enable Skyscrapers to Serve As Power Sources

Energy-Efficient Tuning of Spintronic Neurons to Imitate the Non-linear Oscillatory Neural Networks of the Human Brain

New “Cyborg” Technology Could Enable Merger of Humans and AI

Solar Energy Isn’t Available in the Dark, So Researchers Designed an Efficient Low-Cost System for Producing Power at Night

Scientists Build a Better Nanoscale LED – A Tiny, Bright Light That Can Transform Into a Laser

Scientists Discover Simple Innovation to Make Quantum States Last 10,000 Times Longer