Optimized Two Head Disk Scheduling Algorithm (OTHDSA)

Singh, Karishma; Nidhi, Nidhi; Rastogi, Divya; Singh, Dayashankar

doi:10.1109/acct.2015.70

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A new disk model MHPR (Multi-head Parallelism and Redundancy), represented by Yang [14], reduced the access time of a single I/O request and increased the response time. In [6], the authors inspired by [14], proposed optimized disk scheduling based on two heads disk. As the name suggests, the first disk head is at the position of track number zero (0), named as "HL," which moves from left to right.…”

Section: Optimized Two Head Disk Scheduling Algorithm (Othdsa)mentioning

confidence: 99%

“…Literature review is in section II, accompanied by an explanation of current disk scheduling algorithms such as FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK [2][3] along with their pros and cons in Section III. Section IV focuses on the recent algorithms such as Updated C-LOOK, OTHDSA, ZONE Focused [4][5][6][7]. Finally, the results of all algorithms are discussed in section V.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

Bamboat

Khuhro

Kumar

et al. 2021

QUEST Research Journal

View full text Add to dashboard Cite

This review paper compares the various disk scheduling algorithms that are used to schedule processes in a queue, such as FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK, OTHDSA, and Zone Base Disk Scheduling, and then applies all of these techniques to two data sets to assess the performance of each algorithm. The comparison includes updated and improved techniques that show promising results in collecting data from the digital store. The comparison results were also contrasted with supporting the statement that all disk scheduling algorithms' technique offers much better performance. The comparison shows that among all disk scheduling algorithms, OTHDSA has excellent performance and takes a search time of 250 to complete all requests in a queue.

show abstract

Section: Optimized Two Head Disk Scheduling Algorithm (Othdsa)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

Bamboat

Khuhro

Kumar

et al. 2021

QUEST Research Journal

View full text Add to dashboard Cite

show abstract

“…Kitae and Heonshik [16] have proposed two disk scheduling algorithms SRLF and SATF for decreasing the rotational latency and access time respectively. Karishma et al [17] have developed a new disk scheduling algorithm "OTHDSA" (Optimized Two Headed Disk Scheduling Algorithm). This algorithm works on the hard-disk with two read/write heads for each side of platter.…”

Section: Introductionmentioning

confidence: 99%

An Optimized Disk Scheduling Algorithm with Bad-Sector Management

Dash¹,

Sahu²,

Kewal³

2019

IJCSEA

View full text Add to dashboard Cite

In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster and efficient working of computers. But a process needs both CPU bound and I/O bound for completion of its execution. With modernization of computers the speed of processor, hard-disk, and I/O devices increases gradually. Still the data access speed of hard-disk is much less than the speed of the processor. So when processor receives a data from secondary memory it executes immediately and again it have to wait for receiving another data. So the slowness of the hard-disk becomes a bottleneck in the performance of processor. Researchers try to develop and optimize the traditional disk scheduling algorithms for faster data transfer to and from secondary data storage devices. In this paper we try to evolve an optimized scheduling algorithm by reducing the seek time, the rotational latency, and the data transfer time in runtime. This algorithm has the feature to manage the bad-sectors of the hard-disk. It also attempts to reduce power consumption and heat reduction by minimizing bad sector reading time.

show abstract

Optimized Universal Disk Scheduling Algorithm

Dash,

Sahu

et al. 2024

J. Inst. Eng. India Ser. B

View full text Add to dashboard Cite

Optimized Two Head Disk Scheduling Algorithm (OTHDSA)

Cited by 5 publications

References 6 publications

Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

An Optimized Disk Scheduling Algorithm with Bad-Sector Management

Optimized Universal Disk Scheduling Algorithm

Contact Info

Product

Resources

About