A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Optimized Universal Disk Scheduling Algorithm
https://orcid.org/https://orcid.org/0000-0002-5204-641X
https://orcid.org/https://orcid.org/0000-0002-9754-1027
https://orcid.org/https://orcid.org/0000-0001-8554-4848
For efficient and faster working of computer, researchers tries to optimize different scheduling algorithms of operating system. Along with modernization of computer, the speed of hardware (like processor, RAM, and hard disk) gradually increases. But till now processor works in nanoseconds per instruction execution, where as hard disk works in microseconds per memory access. During execution, process needs both CPU bound and I/O bound time. The slowness of hard disk may detain the speed of processor, as due to its sluggishness it is unable to provide the needed data on time. For high-performance computing, the disk scheduling algorithms also need to be optimized along with optimization of CPU scheduling. The proposed scheduling algorithm improves the performance measure of the disk scheduling algorithm by reducing the seek time, the rotational latency, and the platter selection time. Proposed algorithm decreases the space complexity of the kernel as it is able to deal with different situation like difference in partition table, file system, number of hard disk, and RAID technology. The proposed algorithm also able to detect and manage physical bit bad sector of the hard disk.
Optimized Universal Disk Scheduling Algorithm
https://orcid.org/https://orcid.org/0000-0002-5204-641X
https://orcid.org/https://orcid.org/0000-0002-9754-1027
https://orcid.org/https://orcid.org/0000-0001-8554-4848
For efficient and faster working of computer, researchers tries to optimize different scheduling algorithms of operating system. Along with modernization of computer, the speed of hardware (like processor, RAM, and hard disk) gradually increases. But till now processor works in nanoseconds per instruction execution, where as hard disk works in microseconds per memory access. During execution, process needs both CPU bound and I/O bound time. The slowness of hard disk may detain the speed of processor, as due to its sluggishness it is unable to provide the needed data on time. For high-performance computing, the disk scheduling algorithms also need to be optimized along with optimization of CPU scheduling. The proposed scheduling algorithm improves the performance measure of the disk scheduling algorithm by reducing the seek time, the rotational latency, and the platter selection time. Proposed algorithm decreases the space complexity of the kernel as it is able to deal with different situation like difference in partition table, file system, number of hard disk, and RAID technology. The proposed algorithm also able to detect and manage physical bit bad sector of the hard disk.
Optimized Universal Disk Scheduling Algorithm
https://orcid.org/https://orcid.org/0000-0002-5204-641X
https://orcid.org/https://orcid.org/0000-0002-9754-1027
https://orcid.org/https://orcid.org/0000-0001-8554-4848
For efficient and faster working of computer, researchers tries to optimize different scheduling algorithms of operating system. Along with modernization of computer, the speed of hardware (like processor, RAM, and hard disk) gradually increases. But till now processor works in nanoseconds per instruction execution, where as hard disk works in microseconds per memory access. During execution, process needs both CPU bound and I/O bound time. The slowness of hard disk may detain the speed of processor, as due to its sluggishness it is unable to provide the needed data on time. For high-performance computing, the disk scheduling algorithms also need to be optimized along with optimization of CPU scheduling. The proposed scheduling algorithm improves the performance measure of the disk scheduling algorithm by reducing the seek time, the rotational latency, and the platter selection time. Proposed algorithm decreases the space complexity of the kernel as it is able to deal with different situation like difference in partition table, file system, number of hard disk, and RAID technology. The proposed algorithm also able to detect and manage physical bit bad sector of the hard disk.
Optimized Universal Disk Scheduling Algorithm
J. Inst. Eng. India Ser. B
Dash, Amar Ranjan (author) / Dash, Baishnobi (author) / Sahu, Sandipta Kumar (author) / Sahu, Neha Kumari (author) / Panda, Srinibash (author)
Journal of The Institution of Engineers (India): Series B ; 106 ; 31-101
2025-02-01
71 pages
Article (Journal)
Electronic Resource
English
Optimized Universal Disk Scheduling Algorithm
| Springer Verlag | 2025
OPTIMIZED ACCELERATION IN LINEAR SCHEDULING
| TIBKAT | 2020
Optimized Scheduling of Linear Projects
| Online Contents | 2003
Optimized Scheduling of Linear Projects
| British Library Online Contents | 2003