AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS - SSTF, SCAN, AND N-STEP SCAN
| dc.citation.epage | 558 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 546 | en_US |
| dc.citation.volume | 32 | en_US |
| dc.citation.woscount | 16 | |
| dc.contributor.author | CHEN, TS | en_US |
| dc.contributor.author | YANG, WP | en_US |
| dc.contributor.author | LEE, RCT | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:05:02Z | |
| dc.date.available | 2014-12-08T15:05:02Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | The amortized analysis is a useful tool for analyzing the time-complexity of performing a sequence of operations. The disk scheduling problem involves a sequence of requests in general. In this paper, the performances of representative disk scheduling algorithms, SSTF, SCAN, and N-StepSCAN, are analyzed in the amortized sense. A lower bound of the amortized complexity for the disk scheduling problem is also derived. According to our analysis, SCAN is not only better than SSTF and N-StepSCAN, but also an optimal algorithm. Various authors have studied the disk scheduling problem based on some probability models and concluded that the most acceptable performance is obtained from SCAN. Our result therefore supports their conclusion. | en_US |
| dc.identifier.doi | 10.1007/BF01994839 | en_US |
| dc.identifier.issn | 0006-3835 | en_US |
| dc.identifier.journal | BIT | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF01994839 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3567 | |
| dc.identifier.wosnumber | WOS:A1992KF96300001 | |
| dc.language.iso | en_US | en_US |
| dc.subject | AMORTIZED ANALYSIS | en_US |
| dc.subject | DISK SCHEDULING | en_US |
| dc.subject | ONLINE PROBLEM | en_US |
| dc.title | AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS - SSTF, SCAN, AND N-STEP SCAN | en_US |
| dc.type | Article | en_US |