GSR: A global seek-optimizing real-time disk-scheduling algorithm
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
215 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
198 | en_US |
dc.citation.volume |
80 | en_US |
dc.citation.woscount |
6 | |
dc.contributor.author |
Chang, Hsung-Pin | en_US |
dc.contributor.author |
Chang, Ray-I | en_US |
dc.contributor.author |
Shih, Wei-Kuan | en_US |
dc.contributor.author |
Chang, Ruei-Chuan | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:14:44Z | |
dc.date.available |
2014-12-08T15:14:44Z | |
dc.date.issued |
2007-02-01 | en_US |
dc.description.abstract |
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. However, it is not good enough for scheduling real-time disk tasks to achieve high disk throughput. In contrast, although SCAN can maximize disk throughput, its schedule results may violate real-time requirements. Thus, during the past few years, various approaches were proposed to combine EDF and SCAN (e.g., SCAN-EDF and RG-SCAN) to resolve the real-time disk-scheduling problem. However, in previous schemes, real-time tasks can only be rescheduled by SCAN within a local group. Such restriction limited the obtained data throughput. In this paper, we proposed a new globally rescheduling scheme for real-time disk scheduling. First, we formulate the relations between the EDF schedule and the SCAN schedule of input tasks as EDF-to-SCAN mapping (ESM). Then, on the basis of ESM, we propose a new real-time disk-scheduling algorithm: globally seek-optimizing rescheduling (GSR) scheme. Different from previous approaches, a task in GSR may be rescheduled to anywhere in the input schedule to optimize data throughput. Owing to such a globally rescheduling characteristic, GSR obtains a higher disk throughput than previous approaches. Furthermore, we also extend the GSR to serve fairly non-real-time tasks. Experiments show that given 15 real-time tasks, our data throughput is 1.1 times that of RG-SCAN. In addition, in a mixed workload, compared with RG-SCAN, our GSR achieves over 7% improvement in data throughput and 33% improvement in average response time. (C) 2006 Elsevier Inc. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.jss.2006.03.045 | en_US |
dc.identifier.issn |
0164-1212 | en_US |
dc.identifier.journal |
JOURNAL OF SYSTEMS AND SOFTWARE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.jss.2006.03.045 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11147 | |
dc.identifier.wosnumber |
WOS:000244026300005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
real-time disk scheduling | en_US |
dc.subject |
disk scheduling | en_US |
dc.subject |
operating systems | en_US |
dc.title |
GSR: A global seek-optimizing real-time disk-scheduling algorithm | en_US |
dc.type |
Article | en_US |
檔案
- 000244026300005.pdf (356.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chang, H.-P., Chang, R.-I., Shih, W.-K., & Chang, R.-C. (2007). GSR: A global seek-optimizing real-time disk-scheduling algorithm. JOURNAL OF SYSTEMS AND SOFTWARE, 80(2), 198–215. https://doi.org/10.1016/j.jss.2006.03.045
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11147