CN104182490A - Data access management method and device - Google Patents
Data access management method and device Download PDFInfo
- Publication number
- CN104182490A CN104182490A CN201410392257.6A CN201410392257A CN104182490A CN 104182490 A CN104182490 A CN 104182490A CN 201410392257 A CN201410392257 A CN 201410392257A CN 104182490 A CN104182490 A CN 104182490A
- Authority
- CN
- China
- Prior art keywords
- request
- queue
- requests
- total number
- label
- 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.)
- Granted
Links
- 238000007726 management method Methods 0.000 title abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 62
- 230000004927 fusion Effects 0.000 claims description 15
- 238000012163 sequencing technique Methods 0.000 claims description 12
- 238000005516 engineering process Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/1737—Details of further file system functions for reducing power consumption or coping with limited storage space, e.g. in mobile devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2219—Large Object storage; Management thereof
Abstract
The invention discloses a data access management method and device which are applied to a heterogeneous converged architecture. The data access management method comprises the following steps: when a request arrives, acquiring a total number of valid requests in a request queue; judging whether the acquired total number of the valid requests is larger than or equal to a preset request number threshold value or not; when the acquired total number of the valid requests is larger than or equal to the preset request number threshold value, adopting a poll method to process the all requests in the request queue; when the total number of the valid requests is smaller than or equal to the preset request number threshold value, continuously waiting the arriving of the requests and performing the step of acquiring the total number of the valid requests in the request queue. According to the technical scheme, the method can reduce influence on big data processing, caused by difference of the total amount of the requests, so that the processing efficiency of the big data requests is improved, and system overhead is reduced.
Description
Technical field
The present invention relates to large data dispatch administrative skill, espespecially a kind of method and device of management data access.
Background technology
Develop rapidly along with computer technology, data volume also increases thereupon, the speed issue of large data processing is more outstanding, ageing in order to guarantee it, at present, industry proposes to adopt the instant method of processing to process large data, when large data processing request is come, just this request is processed.
But, when request concentrates on some moment while arriving together, existingly to the method for the instant processing of large data, can be with the problem of serving, such as: due to the very large server process inefficiency that causes of total quantity of need request to be processed, and when large data processing request amount is less, server also will be processed these a small amount of large data processing request, and this will cause server always in low-power consumption running, has wasted system overhead.
Summary of the invention
In order to solve the problems of the technologies described above, the invention provides a kind of method and device of management data access, can reduce the impact on large data processing bringing due to the difference of request total amount, thereby promote the efficiency to large data processing request, save system overhead.
In order to reach the object of the invention, the invention provides a kind of method of management data access, be applied to isomery fusion architecture, comprising: when request arrives, obtain total number of effectively asking in request queue;
Whether total number of effective request that judgement obtains is more than or equal to the request number threshold value setting in advance;
When total number of the effective request obtaining is more than or equal to the request number threshold value setting in advance, adopt the method for poll to process all requests in request queue; When effectively total number of request is less than the request number threshold value setting in advance in request queue, continue to wait until that request arrives and carries out the step of obtaining total number of effectively asking in request queue.
Further, before the method, also comprise: set in advance request queue;
When request arrives, obtain in request queue and effectively before total number of request, also comprise: request is added in request queue according to time sequencing.
And,
Setting in advance request name is called: data name--attribute--label;
Wherein, the initial value of label is set to 0, and request is every processed once complete, and the label of request is increased progressively to processing;
Attribute comprises: read data request or write data requests.
Further, after in the method that adopts poll, all requests process in to request queue, the method also comprises: queue has been set;
After processed the completing of request in request queue, according to time sequencing, request has been transferred to queue from request queue.
Further, adopt the method for poll to process all requests in request queue, comprising:
Obtain the label of each request in request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
Further, according to the order that the label of each request is descending, each request is processed, being comprised:
According to the descending order of the label of each request, obtain successively the attribute of each request;
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete;
Ask after processed completing, the label of request is increased progressively to processing.
Further, before total number of effectively asking in obtaining request queue, the method also comprises:
Obtain total number of asking in request queue;
Determine that total number of effectively asking in request queue comprises:
According to the corresponding request of different time in request queue, judge whether two adjacent requests are same requests, if same request is merged into a request by these two requests;
Total number that in request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
Further, judge in such a way whether two adjacent requests are same requests:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
The present invention also provides a kind of device of management data access, is applied to isomery fusion architecture, comprising: request queue administration module, judge module and poll Coordination module; Wherein,
Request queue administration module, for when request arrives, obtains total number of effectively asking in request queue;
Judge module, for judging whether total number of effective request of acquisition is more than or equal to the request number threshold value setting in advance;
Poll Coordination module, while being more than or equal to for total number of the effective request when obtaining the request number threshold value setting in advance, adopts the method for poll to process all requests in request queue;
Request queue administration module, while being also less than for total number of the effective request when obtaining the request number threshold value setting in advance, continues to wait until that request arrives.
Further, this device also comprises module is set, for: set in advance request queue;
When request arrives, request is added in request queue according to different time sequencings.
And,
Setting in advance request name is called: data name--attribute--label;
Wherein, the initial value of label is set to 0, and request is every processed once complete, and the label of request is increased progressively to processing;
Attribute comprises: read data request or write data requests.
Further, poll Coordination module specifically for:
Obtain the label of each request in request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
Further, poll Coordination module is processed each request according to the descending order of the label of each request, comprising:
According to the descending order of the label of each request, obtain successively the attribute of each request;
This device also comprises request access module for reading and writing, for:
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete.
Further, poll Coordination module also for: in the method that adopts poll, after all requests are processed to request queue, queue has been set;
After processed the completing of request in request queue, according to time sequencing, request has been transferred to queue from request queue;
Label to request increases progressively processing.
Further, request queue administration module also for:
Obtain total number of asking in request queue;
Determine that total number of effectively asking in request queue comprises:
According to the corresponding request of different time in request queue, judge whether two adjacent requests are same requests, if same request is merged into a request by these two requests;
Total number that in request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
Further, request queue administration module judges whether two adjacent requests are same requests in such a way:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
Technical solution of the present invention comprises: be applied to isomery fusion architecture, comprise: when request arrives, obtain total number of effectively asking in request queue; Whether total number of effective request that judgement obtains is more than or equal to the request number threshold value setting in advance; When total number of the effective request obtaining is more than or equal to the request number threshold value setting in advance, adopt the method for poll to process all requests in request queue; When in request queue, effectively total number of request is less than the request number threshold value setting in advance, continue the request of waiting until arrives and carries out described in obtain the step of effective total number of asking in request queue.Technical scheme of the present invention has reduced the impact on large data processing bringing due to the difference of request total amount, thereby has promoted the efficiency to large data processing request, thereby has saved system overhead.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms the application's a part, and schematic description and description of the present invention is used for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is the process flow diagram of the method for a kind of management data access of the present invention;
Fig. 2 is the structural representation of the device of a kind of management data access of the present invention.
Embodiment
Below in conjunction with drawings and the specific embodiments, the present invention will be described in detail.
Fig. 1 is the process flow diagram that the present invention is based on the buffer memory management method of isomery fusion architecture, and as shown in Figure 1, the method is applied to isomery fusion architecture, comprises the following steps:
Step 101, when request arrives, obtains total number of effectively asking in request queue.
Before this step, also comprise: set in advance request queue;
Wherein, when request arrives, in obtaining request queue, effectively before total number of request, also comprise: request is added in request queue according to time sequencing.
And,
Setting in advance request name is called: data name--attribute--label;
Wherein, the initial value of label is set to 0; Also initial value that can label is set to other numerical value, is not used for limiting the scope of the invention; Request is every processed once complete, and the label of described request is increased progressively to processing
Attribute comprises: read data request or write data requests.
Further, before total number of effectively asking in obtaining request queue, the method also comprises: obtain total number of asking in request queue.
In this step, determine that total number of effectively asking in request queue specifically comprises:
According to the corresponding request of different time in request queue, judge whether two adjacent requests are same requests, if same request can be merged into a request by these two requests;
Total number that in request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
Wherein, judge in such a way whether two adjacent requests are same requests:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
It should be noted that, be conventional techniques means well-known to those skilled in the art about how obtaining total number of asking in request queue, do not repeat them here.
Step 102, judges whether total number of effectively asking in request queue is more than or equal to the request number threshold value setting in advance.
Step 103, when total number of the effective request obtaining is more than or equal to the request number threshold value setting in advance, adopts the method for poll to process all requests in request queue; When in request queue, effectively total number of request is less than the request number threshold value setting in advance, continue the request of waiting until arrives and carries out described in obtain the step of effective total number of asking in request queue.
Here, when in request queue, effectively total number of request is less than the request number threshold value setting in advance, all requests are not processed, the request of being about to lies over, and waits for the arrival of next request.
In this step, adopt the method for poll to process all requests in request queue, comprising:
Obtain the label of each request in request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
Further, after in the method that adopts poll, all requests process in to request queue, the method also comprises: queue has been set;
After processed the completing of request in described request queue, according to time sequencing, request has been transferred to queue from request queue.
Wherein, according to the order that the label of each request is descending, each request is processed, being comprised:
According to the descending order of the label of each request, obtain successively the attribute of each request;
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete;
Ask, after processed completing, the label of described request to be increased progressively to processing.
In method of the present invention, it should be noted that, request queue, complete queue and file system all leaves in the hardware layer in isomery fusion architecture.
Fig. 2 is the structural representation of the device of a kind of management data access of the present invention, and as shown in Figure 2, this application of installation, in isomery fusion architecture, comprising: request queue administration module, judge module and poll Coordination module.Wherein,
Request queue administration module, for when request arrives, obtains total number of effectively asking in request queue.
Further, request queue administration module also for:
Obtain total number of asking in request queue;
Determine that total number of effectively asking in request queue comprises:
According to the corresponding request of different time in request queue, judge whether two adjacent requests are same requests, if same request can be merged into a request by these two requests;
Total number that in request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
Wherein, request queue administration module judges whether two adjacent requests are same requests in such a way:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
Judge module, for judging whether total number of effective request of acquisition is more than or equal to the request number threshold value setting in advance.
Poll Coordination module, while being more than or equal to for total number of the effective request when obtaining the request number threshold value setting in advance, adopts the method for poll to process all requests in request queue.
Further, poll Coordination module specifically for:
Obtain the label of each request in request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
Further, poll Coordination module also for: in the method for described employing poll, after all requests are processed to request queue, queue has been set;
After processed the completing of request in request queue, according to time sequencing, request has been transferred to queue from request queue;
Label to described request increases progressively processing.
Wherein, poll Coordination module is processed each request according to the descending order of the label of each request, comprising:
According to the descending order of the label of each request, obtain successively the attribute of each request;
Request queue administration module, while being also less than for total number of the effective request when obtaining the request number threshold value setting in advance, continues to wait until that request arrives.
Here, when in request queue, effectively total number of request is less than the request number threshold value setting in advance, all requests are not processed, the request of being about to lies over, and waits for the arrival of next request.
This device also comprises request access module for reading and writing, for:
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete.
This device also comprises module is set, for: set in advance request queue;
When request arrives, request is added in request queue according to different time sequencings.
And,
Setting in advance request name is called: data name--attribute--label, and request is every processed once complete, and the label of described request is increased progressively to processing;
Wherein, the initial value of label is set to 0; Initial value that herein also can label is set to other numerical value, is not used for limiting the scope of the invention.
Attribute comprises: read data request or write data requests.
One of ordinary skill in the art will appreciate that all or part of step in said method can come instruction related hardware to complete by program, described program can be stored in computer-readable recording medium, as ROM (read-only memory), disk or CD etc.Alternatively, all or part of step of above-described embodiment also can realize with one or more integrated circuit.Correspondingly, each the module/unit in above-described embodiment can adopt the form of hardware to realize, and also can adopt the form of software function module to realize.The application is not restricted to the combination of the hardware and software of any particular form.
The above, be only preferred embodiments of the present invention, is not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of making, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (16)
1. a method for management data access, is applied to isomery fusion architecture, it is characterized in that, comprising: when request arrives, obtain total number of effectively asking in request queue;
Whether total number of effective request that judgement obtains is more than or equal to the request number threshold value setting in advance;
When total number of the effective request obtaining is more than or equal to the request number threshold value setting in advance, adopt the method for poll to process all requests in request queue; When in request queue, effectively total number of request is less than the request number threshold value setting in advance, continue the request of waiting until arrives and carries out described in obtain the step of effective total number of asking in request queue.
2. method according to claim 1, is characterized in that, also comprises: set in advance described request queue before the method;
Described when request arrives, described in obtain in request queue and effectively before total number of request, also comprise: request is added in described request queue according to time sequencing.
3. method according to claim 1, is characterized in that, before the method, also comprises:
Setting in advance request name is called: data name--attribute--label;
Wherein, the initial value of label is set to 0, and request is every processed once complete, and the label of described request is increased progressively to processing;
Attribute comprises: read data request or write data requests.
4. method according to claim 1 and 2, is characterized in that, after in the method for described employing poll, all requests process in to request queue, the method also comprises: queue has been set;
After processed the completing of request in described request queue, according to time sequencing, request has been transferred to queue from request queue.
5. method according to claim 3, is characterized in that, the method for described employing poll is processed all requests in request queue, comprising:
Obtain the label of each request in described request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
6. method according to claim 5, is characterized in that, describedly according to the descending order of the label of each request, each request is processed, and comprising:
According to the descending order of the label of each request, obtain successively the attribute of each request;
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete;
Ask, after processed completing, the label of described request to be increased progressively to processing.
7. method according to claim 2, is characterized in that, described obtain request queue in effectively before total number of request, the method also comprises:
Obtain total number of asking in described request queue;
In described definite request queue, effectively total number of request comprises:
According to the corresponding request of different time in described request queue, judge whether two adjacent requests are same requests, if same request is merged into a request by these two requests;
Total number that in described request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
8. method according to claim 7, is characterized in that, judges in such a way whether two adjacent requests are same requests:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
9. a device for management data access, is applied to isomery fusion architecture, it is characterized in that, comprising: request queue administration module, judge module and poll Coordination module; Wherein,
Request queue administration module, for when request arrives, obtains total number of effectively asking in request queue;
Judge module, for judging whether total number of effective request of acquisition is more than or equal to the request number threshold value setting in advance;
Poll Coordination module, while being more than or equal to for total number of the effective request when obtaining the request number threshold value setting in advance, adopts the method for poll to process all requests in request queue;
Described request queue management module, while being also less than for total number of the effective request when obtaining the request number threshold value setting in advance, continues to wait until that request arrives.
10. device according to claim 9, is characterized in that, this device also comprises module is set, for: set in advance request queue;
When request arrives, request is added in request queue according to different time sequencings.
11. devices according to claim 9, is characterized in that, this device also comprises module is set, for: set in advance request name and be called: data name--attribute--label;
Wherein, the initial value of label is set to 0, and request is every processed once complete, and the label of described request is increased progressively to processing;
Attribute comprises: read data request or write data requests.
12. devices according to claim 11, is characterized in that, described poll Coordination module specifically for:
Obtain the label of each request in described request queue, the label of each request obtaining is sorted according to descending order;
Descending order according to the label of each request is processed each request.
13. devices according to claim 12, is characterized in that, described poll Coordination module is processed each request according to the descending order of the label of each request, comprising:
According to the descending order of the label of each request, obtain successively the attribute of each request;
This device also comprises request access module for reading and writing, for:
When the attribute display of request is while being write data requests, these data are write in the file system in isomery fusion architecture, and this write operation is back to operating system and records this request and complete; When the attribute display of request is while being read data request, read the desired data of read data request and this read operation be back to operating system and record this request to complete.
14. according to the device described in claim 9 or 10, described poll Coordination module also for: in the method for described employing poll, after all requests are processed to request queue, queue has been set;
After processed the completing of request in described request queue, according to time sequencing, request has been transferred to queue from request queue;
Label to described request increases progressively processing.
15. devices according to claim 10, is characterized in that, described request queue management module also for:
Obtain total number of asking in described request queue;
In described definite request queue, effectively total number of request comprises:
According to the corresponding request of different time in described request queue, judge whether two adjacent requests are same requests, if same request is merged into a request by these two requests;
Total number that in described request queue, effectively total number of request equals to ask in request queue deducts the number that merges request.
16. devices according to claim 15, is characterized in that, described request queue management module judges whether two adjacent requests are same requests in such a way:
If the data name in the request title of two adjacent requests is identical with attribute, judging two adjacent requests is same requests.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410392257.6A CN104182490B (en) | 2014-08-11 | 2014-08-11 | A kind of method and device for managing data access |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410392257.6A CN104182490B (en) | 2014-08-11 | 2014-08-11 | A kind of method and device for managing data access |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104182490A true CN104182490A (en) | 2014-12-03 |
| CN104182490B CN104182490B (en) | 2018-06-19 |
Family
ID=51963530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410392257.6A Active CN104182490B (en) | 2014-08-11 | 2014-08-11 | A kind of method and device for managing data access |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104182490B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016192572A1 (en) * | 2015-06-01 | 2016-12-08 | 华为技术有限公司 | Method, device and system for improving concurrent processing ability of wireless local area network |
| CN109117284A (en) * | 2018-07-20 | 2019-01-01 | 深圳乐信软件技术有限公司 | Processing method, device, equipment and the storage medium of solicited message |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499017A (en) * | 2009-03-02 | 2009-08-05 | 南京联创科技股份有限公司 | Method for real-time tracing projects |
| CN102117308A (en) * | 2010-01-06 | 2011-07-06 | 卓望数码技术（深圳）有限公司 | Data processing method and data processing system |
| CN103116634A (en) * | 2012-06-12 | 2013-05-22 | 上海雷腾软件有限公司 | System for supporting high concurrent cache task queue and asynchronous batch operation method thereof |
| CN103685381A (en) * | 2012-09-12 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method, system and device for downloading webpage resources |
-
2014
- 2014-08-11 CN CN201410392257.6A patent/CN104182490B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499017A (en) * | 2009-03-02 | 2009-08-05 | 南京联创科技股份有限公司 | Method for real-time tracing projects |
| CN102117308A (en) * | 2010-01-06 | 2011-07-06 | 卓望数码技术（深圳）有限公司 | Data processing method and data processing system |
| CN103116634A (en) * | 2012-06-12 | 2013-05-22 | 上海雷腾软件有限公司 | System for supporting high concurrent cache task queue and asynchronous batch operation method thereof |
| CN103685381A (en) * | 2012-09-12 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method, system and device for downloading webpage resources |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016192572A1 (en) * | 2015-06-01 | 2016-12-08 | 华为技术有限公司 | Method, device and system for improving concurrent processing ability of wireless local area network |
| US10356841B2 (en) | 2015-06-01 | 2019-07-16 | Huawei Technologies Co., Ltd. | Method, apparatus, and system for enhancing concurrent processing capability of wireless local area network |
| CN109117284A (en) * | 2018-07-20 | 2019-01-01 | 深圳乐信软件技术有限公司 | Processing method, device, equipment and the storage medium of solicited message |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104182490B (en) | 2018-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9501318B2 (en) | Scheduling and execution of tasks based on resource availability | |
| US20100082855A1 (en) | Associating process priority with i/o queuing | |
| US8352946B2 (en) | Managing migration ready queue associated with each processor based on the migration ready status of the tasks | |
| US20150253992A1 (en) | Memory system and control method | |
| CN102402401A (en) | Method for scheduling input output (IO) request queue of disk | |
| CN104011680A (en) | Scheduling virtual central processing units of virtual machines among physical processing units | |
| CN102981944B (en) | A kind of log storing method based on file system | |
| US10089266B2 (en) | Power saving feature for storage subsystems | |
| WO2017041638A1 (en) | Log data processing method and device | |
| US20150378782A1 (en) | Scheduling of tasks on idle processors without context switching | |
| CN102750257A (en) | On-chip multi-core shared storage controller based on access information scheduling | |
| US11010094B2 (en) | Task management method and host for electronic storage device | |
| CN107391295A (en) | The processing method and processing device of application exception | |
| CN103346902A (en) | Method and system for data collection and scheduling | |
| CN103064636B (en) | A kind of solid state disk read-write method and a kind of solid state hard disc | |
| CN106681660A (en) | IO (input/output) scheduling method and IO scheduling device | |
| CN108667740B (en) | Flow control method, device and system | |
| CN104182490A (en) | Data access management method and device | |
| CN103399832A (en) | Ordering method of out-of-order return data between buses | |
| CN110020305A (en) | Webpage loading method, device, computer equipment and storage medium | |
| US20150100745A1 (en) | Method and apparatus for efficiently processing storage commands | |
| CN107851076A (en) | Memory access controls | |
| CN102495817A (en) | High-speed data transmission method based on PCI (Peripheral Component Interconnect) bus | |
| CN103607451A (en) | Client terminal and server terminal document operation synchronization method supporting concurrence | |
| CN109710187A (en) | Read command accelerated method, device, computer equipment and the storage medium of NVMe SSD main control chip |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180817 Address after: 200436 Room 411, No. three, JIANGCHANG Road, Jingan District, Shanghai, 411 Patentee after: Shanghai wave Cloud Computing Service Co., Ltd. Address before: 100085 floor 1, C 2-1, No. 2, Shang Di Road, Haidian District, Beijing. Patentee before: Electronic information industry Co.,Ltd of the tide (Beijing) |
|
| TR01 | Transfer of patent right |