నైరూప్య

Priority Based Disk Scheduling Algorithm

C.Mallikarjuna, K. Sudheer Babu, Dr. P. Chitti Babu

Processor speed and memory size are increasing day by day several times faster than disk speed. The difference between these two identifies that disk I/O performance could become a very important factor concerning system performance. In operating systems, seek time is very crucial. Since all device I/O requests are linked in queues, if the seek time increases the system performance gets degraded. So we need certain algorithms for serving disk requests more efficiently. These algorithms are used for scheduling the various requests regarding the disks with less time and finally the system shows the better performance. In this paper we proposed a new algorithm for disk scheduling which is quite new when compared with the existing disk scheduling algorithms.

ఇండెక్స్ చేయబడింది

Academic Keys
ResearchBible
CiteFactor
కాస్మోస్ IF
RefSeek
హమ్దార్డ్ విశ్వవిద్యాలయం
వరల్డ్ కేటలాగ్ ఆఫ్ సైంటిఫిక్ జర్నల్స్
విద్వాంసుడు
ఇంటర్నేషనల్ ఇన్నోవేటివ్ జర్నల్ ఇంపాక్ట్ ఫ్యాక్టర్ (IIJIF)
ఇంటర్నేషనల్ ఇన్స్టిట్యూట్ ఆఫ్ ఆర్గనైజ్డ్ రీసెర్చ్ (I2OR)
కాస్మోస్

మరిన్ని చూడండి