CN102402401A - Method for scheduling IO (input/output) request queue of disk - Google Patents
Method for scheduling IO (input/output) request queue of disk Download PDFInfo
- Publication number
- CN102402401A CN102402401A CN2011104161969A CN201110416196A CN102402401A CN 102402401 A CN102402401 A CN 102402401A CN 2011104161969 A CN2011104161969 A CN 2011104161969A CN 201110416196 A CN201110416196 A CN 201110416196A CN 102402401 A CN102402401 A CN 102402401A
- Authority
- CN
- China
- Prior art keywords
- request
- execution
- disk
- disc driver
- priority indication
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 14
- 238000012163 sequencing technique Methods 0.000 abstract description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
Images
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention provides a method for scheduling IO request queues of a disk, which comprises the following steps: A. when the file system generates an IO request, judging whether the IO request is a high real-time IO request, if so, executing the step B, otherwise, executing the step C; B. allocating a high priority indication to the IO request, and then executing step C; C. sending the IO request to a disk drive; D. after receiving the IO request, the disk drive judges whether the IO request contains a high priority indication, if so, the step E is executed, otherwise, the step F is executed; E. sending the IO request to the forefront position of an IO request queue, and returning to the step A; F. and E, sequencing the IO requests according to the positions of the sectors, sending the IO requests into an IO request queue, and returning to the step A.
Description
Technical field
The present invention relates to the computer memory technical field, relate in particular to a kind of method of disk I request queue scheduling.
Background technology
When disc driver receive operating system read the IO operational order time; Will send the instruction of a read data to disk; And the address of the data block that will read simultaneously passes to disk; Disk can be passed to disc driver with the data that read then, and returns to operating system by disc driver, accomplishes an operation of reading IO; Same; An operation of writing IO is also similar; Disc driver is received the instruction of the IO operation of writing and the data that will write, and it is passed to disk, and disk returns the operating result transmission to disc driver after data write completion; Return to operating system by disc driver again, accomplish an operation of writing IO.What single IO operation referred to is exactly to accomplish the operation writing IO or read IO.
Disc driver may once send a series of a plurality of IO instruction to disk groups, and these a plurality of IO instructions can not be carried out immediately, but get up with the form buffer memory of formation, are referred to as the IO request queue.It all is the sequencing according to IO data sector in disk that traditional disk I formation is arranged mainly, from the IO request queue, extracts the IO instruction according to vertical order and carries out successively.But in practical application, it is different that the real-time of different I instruction requires.When a large amount of disk IO read-write request; It is so high to read and write in the general file data demand write storage device real-time; But also exist sometimes some critical data (such as metadata, configuration information) is all required to write in real time as early as possible storage system, in addition professional before guaranteeing that data in real time writes disk; Business process is in waiting status always, has had a strong impact on service feature.
Summary of the invention
The invention provides a kind of method of disk I request queue scheduling, can guarantee the demanding high priority data execution of real-time.
The embodiment of the invention provides a kind of method of disk I request queue scheduling, comprises the steps:
A, file system judge whether this IO request is high real-time IO request when generating the IO request, if, execution in step B, otherwise execution in step C;
B, request distributes high priority indication, an execution in step C then to this IO;
C, this IO request is sent to disc driver;
After D, disc driver are received the IO request, judge whether the IO request contains the high priority indication, if, execution in step E, otherwise execution in step F;
E, the front position of IO request queue is sent in this IO request, and returned steps A;
F, with this IO request according to the sector position ordering, send into the IO request queue, and return steps A.
Preferably, the said judged result of steps A then further comprises: this IO request is distributed default priority indication, execution in step C then for not.
Preferably, the said disc driver of step D further comprises after receiving the IO request: disc driver distributes a timer for each IO request, if the corresponding IO request of this timer of timer expired is not also carried out, then directly carries out this IO request.
Can find out from above technical scheme, increase a priority attribute to each IO request, for indivedual crucial IO, higher priority attribute can be set, the IO request that priority is high can be handled by relative priority.The present invention program considers the IO data importance simultaneously in the IO queue scheduling, the demanding critical data of priority processing real-time.The present invention is fewer for the data of key, but these crucial real-times, the very high service application of security requirement act on comparatively obvious.
Description of drawings
The process flow diagram that Fig. 1 dispatches for a kind of disk I request queue that the embodiment of the invention provides.
Embodiment
The present invention proposes to increase a priority attribute to each IO request, for indivedual crucial IO, higher priority attribute can be set, and the IO request that priority is high can be handled by relative priority.In the time of the business datum read-write, can indicate the priority of this IO, the IO priority attribute of acquiescence is that minimum " 0 " does not perhaps indicate priority, and the IO of level that All factors being equal, preference will be give to still sorts according to sector position.For the IO that prevents some low priority can not get handling for a long time, a time threshold can be set in addition, when some IO can not get handling for a long time, can suitably handle.
Clearer for the principle, characteristics and the technique effect that make technical scheme of the present invention, below the present invention program is set forth in detail through specific embodiment.
The flow process that a kind of disk I request queue that Fig. 1 shows the embodiment of the invention to be provided is dispatched comprises the steps:
Step 101: file system judges whether this IO request is high real-time IO request when generating the IO request, if, execution in step 102, otherwise execution in step 103.
Preferably, the IO request of critical data (such as metadata, configuration information) is asked as high real-time IO.
Step 102: this IO request is distributed a high priority indication, and execution in step 104 then;
Step 103: this IO request is distributed the default priority indication, and execution in step 104 then.Perhaps, do not distribute the default priority indication, directly execution in step 104.
Step 104: this IO request is sent to disc driver.
Step 105: after disc driver was received the IO request, the priority indication of judging the IO request was high priority indication or default priority indication, if high priority indication execution in step 106, if default priority indication execution in step 107.Said judgement also can be to judge whether the IO request has the priority indication, if then execution in step 106 is arranged, otherwise execution in step 107.
Step 106: the front position of IO request queue is sent in this IO request, and returned step 101.
Step 107: this IO request according to the sector position ordering, is sent into the IO request queue, and returned step 101.
Preferably, after disc driver is received the IO request, distribute a timer also can for each IO request,, then directly carry out this IO request if the corresponding IO request of this timer of timer expired is not also carried out.
The method of the disk I request queue scheduling that the present invention proposes is considered the IO data importance, the demanding critical data of priority processing real-time simultaneously in the IO queue scheduling.The present invention is fewer for the data of key, but these crucial real-times, the very high service application of security requirement act on comparatively obvious.
The above is merely preferred embodiment of the present invention, and is in order to restriction the present invention, not all within spirit of the present invention and principle, any modification of being made, is equal to replacement, improvement etc., all should be included within the scope that the present invention protects.
Claims (3)
1. the method for a disk I request queue scheduling is characterized in that, comprises the steps:
A, file system judge whether this IO request is high real-time IO request when generating the IO request, if, execution in step B, otherwise execution in step C;
B, request distributes high priority indication, an execution in step C then to this IO;
C, this IO request is sent to disc driver;
After D, disc driver are received the IO request, judge whether the IO request contains the high priority indication, if, execution in step E, otherwise execution in step F;
E, the front position of IO request queue is sent in this IO request, and returned steps A;
F, with this IO request according to the sector position ordering, send into the IO request queue, and return steps A.
2. method according to claim 1 is characterized in that, the said judged result of steps A then further comprises: this IO request is distributed default priority indication, execution in step C then for not.
3. method according to claim 1; It is characterized in that; The said disc driver of step D further comprises after receiving the IO request: disc driver distributes a timer for each IO request; If the IO request that this timer of timer expired is corresponding is not also carried out, then directly carry out this IO request.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011104161969A CN102402401A (en) | 2011-12-13 | 2011-12-13 | Method for scheduling IO (input/output) request queue of disk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011104161969A CN102402401A (en) | 2011-12-13 | 2011-12-13 | Method for scheduling IO (input/output) request queue of disk |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102402401A true CN102402401A (en) | 2012-04-04 |
Family
ID=45884646
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011104161969A Pending CN102402401A (en) | 2011-12-13 | 2011-12-13 | Method for scheduling IO (input/output) request queue of disk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102402401A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799487A (en) * | 2012-06-29 | 2012-11-28 | 记忆科技(深圳)有限公司 | IO (input/output) scheduling method and apparatus based on array/LUN (Logical Unit Number) |
| CN104283932A (en) * | 2013-07-12 | 2015-01-14 | 鸿富锦精密工业（深圳）有限公司 | File Synchronization System and Method |
| CN104298609A (en) * | 2014-08-14 | 2015-01-21 | 浪潮(北京)电子信息产业有限公司 | Data copying method and device |
| CN104317656A (en) * | 2014-10-14 | 2015-01-28 | 深圳市锐明视讯技术有限公司 | Block equipment input and output request dispatching method and device |
| CN104598409A (en) * | 2013-10-31 | 2015-05-06 | 华为技术有限公司 | Method and device for processing input and output requests |
| WO2016078091A1 (en) * | 2014-11-21 | 2016-05-26 | 华为技术有限公司 | Input output (io) request processing method and file server |
| CN105677744A (en) * | 2015-12-28 | 2016-06-15 | 曙光信息产业股份有限公司 | Method and apparatus for increasing service quality in file system |
| CN107133100A (en) * | 2017-04-26 | 2017-09-05 | 新华三技术有限公司 | Storage system service quality Q oS control methods and device |
| CN109582467A (en) * | 2018-12-18 | 2019-04-05 | 广东浪潮大数据研究有限公司 | Processing method, system and the relevant apparatus of I/O request in a kind of storage system |
| CN109814806A (en) * | 2018-12-27 | 2019-05-28 | 河南创新科信息技术有限公司 | I O scheduling method, storage medium and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1617100A (en) * | 2003-08-20 | 2005-05-18 | 微软公司 | Continuous media priority aware storage scheduler |
| WO2007035519A2 (en) * | 2005-09-16 | 2007-03-29 | The Research Foundation Of State University Of New York | File system having predictable real-time performance |
-
2011
- 2011-12-13 CN CN2011104161969A patent/CN102402401A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1617100A (en) * | 2003-08-20 | 2005-05-18 | 微软公司 | Continuous media priority aware storage scheduler |
| WO2007035519A2 (en) * | 2005-09-16 | 2007-03-29 | The Research Foundation Of State University Of New York | File system having predictable real-time performance |
Non-Patent Citations (3)
| Title |
|---|
| KRITHI RAMAMRITHAM等: "Scheduling algorithms and operating systems support for real-time systems", 《PROCEEDINGS OF THE IEEE》, vol. 82, no. 1, 31 January 1994 (1994-01-31) * |
| WILLIAM STALLINGS: "《操作系统精髓与设计原理》", 30 September 2010, article "操作系统精髓与设计原理（原书第六版）" * |
| 程鹏等: "基于磁盘阵列的多队列实时I/O调度算法", 《华中理工大学学报》, vol. 27, no. 4, 30 April 1999 (1999-04-30) * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799487A (en) * | 2012-06-29 | 2012-11-28 | 记忆科技(深圳)有限公司 | IO (input/output) scheduling method and apparatus based on array/LUN (Logical Unit Number) |
| CN104283932A (en) * | 2013-07-12 | 2015-01-14 | 鸿富锦精密工业（深圳）有限公司 | File Synchronization System and Method |
| CN104598409A (en) * | 2013-10-31 | 2015-05-06 | 华为技术有限公司 | Method and device for processing input and output requests |
| CN104298609B (en) * | 2014-08-14 | 2017-11-10 | 浪潮(北京)电子信息产业有限公司 | Data copying method and device |
| CN104298609A (en) * | 2014-08-14 | 2015-01-21 | 浪潮(北京)电子信息产业有限公司 | Data copying method and device |
| CN104317656A (en) * | 2014-10-14 | 2015-01-28 | 深圳市锐明视讯技术有限公司 | Block equipment input and output request dispatching method and device |
| WO2016058247A1 (en) * | 2014-10-14 | 2016-04-21 | 深圳市锐明视讯技术有限公司 | Method and apparatus for scheduling block device input/output requests |
| CN104317656B (en) * | 2014-10-14 | 2018-01-16 | 深圳市锐明技术股份有限公司 | A kind of method and device of block device input-output request scheduling |
| US10254965B2 (en) | 2014-10-14 | 2019-04-09 | Streamax Technology Co., Ltd. | Method and apparatus for scheduling block device input/output requests |
| WO2016078091A1 (en) * | 2014-11-21 | 2016-05-26 | 华为技术有限公司 | Input output (io) request processing method and file server |
| CN105677744A (en) * | 2015-12-28 | 2016-06-15 | 曙光信息产业股份有限公司 | Method and apparatus for increasing service quality in file system |
| CN107133100A (en) * | 2017-04-26 | 2017-09-05 | 新华三技术有限公司 | Storage system service quality Q oS control methods and device |
| CN107133100B (en) * | 2017-04-26 | 2020-03-13 | 新华三技术有限公司 | Quality of service (QoS) control method and device for storage system |
| CN109582467A (en) * | 2018-12-18 | 2019-04-05 | 广东浪潮大数据研究有限公司 | Processing method, system and the relevant apparatus of I/O request in a kind of storage system |
| CN109814806A (en) * | 2018-12-27 | 2019-05-28 | 河南创新科信息技术有限公司 | I O scheduling method, storage medium and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102402401A (en) | Method for scheduling IO (input/output) request queue of disk | |
| US12430073B2 (en) | Managed fetching and execution of commands from submission queues | |
| CN107977268B (en) | Task scheduling method, device and readable medium for heterogeneous hardware of artificial intelligence | |
| CN101676854B (en) | Optical drive and method for improving command execution performance of optical drive | |
| US20100262721A1 (en) | Memory controllers, memory systems, solid state drives and methods for processing a number of commands | |
| US20150253992A1 (en) | Memory system and control method | |
| CN102171649A (en) | Method and system for queuing transfers of multiple non-contiguous address ranges with a single command | |
| US9223675B2 (en) | Characterizing device performance based on user-perceivable latency | |
| JP6102032B2 (en) | Method and apparatus for efficiently increasing command queue length for accessing storage | |
| US9529651B2 (en) | Apparatus and method for executing agent | |
| EP3734458A1 (en) | Method and system for prioritizing critical data object storage during backup operations | |
| CN109766056A (en) | A kind of storage array controllers IO array dispatching method and device | |
| CN117472273A (en) | Data reading and writing method, device and storage medium | |
| CN105868121B (en) | A kind of information processing method and electronic equipment | |
| WO2023082206A1 (en) | Instruction scheduling method and apparatus | |
| CN104750547B (en) | The input and output I/O request processing method and processing device of virtual machine | |
| US8819363B2 (en) | Data copying method | |
| JP5375360B2 (en) | Cloud transcoding system and method, information processing terminal, transcoding processing contract terminal | |
| CN104182490B (en) | A kind of method and device for managing data access | |
| US20100152866A1 (en) | Information processing apparatus, information processing method and computer-readable medium having an information processing program | |
| CN115981808A (en) | Scheduling method, device, computer equipment and storage medium | |
| CN103645865B (en) | A kind of processing method of command timeout | |
| US8667188B2 (en) | Communication between a computer and a data storage device | |
| CN106155810A (en) | Workload aware I/O scheduler in a software defined hybrid storage system | |
| CN119045744B (en) | Method for scheduling flash queue and related device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 214135 Jiangsu New District of Wuxi, Taihu international science and Technology Parks Linghu Road No. 200 Chinese micro nano sensor network of International Innovation Park Building No. 1 Applicant after: Clouds creators information technology (Wuxi) Co., Ltd. Applicant after: Shenzhen Anyun Information Technology Co., Ltd. Address before: 214135 Jiangsu New District of Wuxi, Taihu international science and Technology Parks Linghu Road No. 200 Chinese micro nano sensor network of International Innovation Park Building No. 1 Applicant before: Clouds creators information technology (Wuxi) Co., Ltd. Applicant before: Shenzhen Chuangxinke Information Technology Co., Ltd. |
|
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120404 |