English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 10916073      Online Users : 81
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS: SSTF, SCAN, AND N-STEP SCAN


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80793


    Title: AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS: SSTF, SCAN, AND N-STEP SCAN
    Authors: Chen, T. S.;Yang, W. P.;Lee, R. C. T.
    教師: 李家同
    Date: 1992
    Publisher: Springer Verlag
    Relation: BIT, Springer Verlag, Volume 32, Issue 4, 1992, Pages 546-558
    Keywords: AMORTIZED ANALYSIS
    DISK SCHEDULING
    ONLINE PROBLEM
    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.
    Relation Link: http://www.springerlink.com/?MUD=MP
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80793
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML487View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback