Sorting is one of the frequent used operations in computer science. Due to highly parallel computing nature of GPU architecture; it can be utilized for sorting purpose. We have considered the input array that is to be sorted in a 2D matrix form and applied a modified version of merge sort on that matrix. This modification leads to a much efficient sorting algorithm with reduced complexity. Therefore a lot of work has already been done to improve the efficiency of sorting algorithms. In this paper We have used the GPU architecture for solving the sorting problem.
As the hard-disk technology has been improved considerably. A significant amount of work also has been done to reduce the seek time of the disk. With the increased speed of processor, faster RAM compatible disk scheduling algorithms had been proposed and some of them are really implemented. The main focus of most of the proposed algorithms is to reduce head movement. In this paper a new disk scheduling algorithm has been proposed ie. Simple Sequence Oriented Disk Scheduling Algorithm (SSOD) which significantly reduces the head movement when compared to some famous already existing disk scheduling algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.