CN103970597A - Read-write balanced blocking queue implementation method and device - Google Patents
Read-write balanced blocking queue implementation method and device Download PDFInfo
- Publication number
- CN103970597A CN103970597A CN201410168357.0A CN201410168357A CN103970597A CN 103970597 A CN103970597 A CN 103970597A CN 201410168357 A CN201410168357 A CN 201410168357A CN 103970597 A CN103970597 A CN 103970597A
- Authority
- CN
- China
- Prior art keywords
- queue
- data
- synchronous
- synchrolock
- bar
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a read-write balanced blocking queue implementation method and device, and relates to the field of computer software programming. The method comprises the following steps that N data are added to a queue, and a synchronous lock of the queue is tried to obtain; whether the N data can be added to a synchronous blocking queue or not is determined, and wait is continued if the queue exceeds the maximum setting range after the N data are added until the queue allows N records to be added; the queue throws exception if the N exceeds the maximal length of the queue; after the N data are added to the synchronous blocking queue, the procedure of data adding is completed, and the synchronous lock of the queue is released; addition is continued or given up to complete the procedure of the addition; continuous addition is given up, and the addition procedure is finished. According to the read-write balanced blocking queue implementation method and device, sudden, non-continuous and non-quantitative large scale data processing pressure can be released effectively, the call logic of data queue can be simplified, risks of multithreading polling data are removed, and the stability of application programs for processing sudden large data volumes is improved.
Description
Technical field
The present invention relates to computer software programming field, specifically relate to a kind of read and write balanced obstruction queue implementing method and device.
Background technology
Along with the development of Software Industry, increasing big data quantity, high concurrent software systems produce, and along with the increase of data volume, increasing performance pressure approaches, how could, in limited hardware resource situation, carry out more high efficiency, more level and smooth process software system data?
In industry, the most frequently used method is by increasing server at present, distributed type assemblies disposes to alleviate service software processing pressure, solve problem from hardware view like this, but the economic cost of software is dropped into and just increased considerably, and after increase cluster, the synchronous safety pressure of data also increases relatively.How under limited resource, process as far as possible more thing, and the stability that ensures system not factor data amount increase and decline, this is a problem demanding prompt solution.
Summary of the invention
The object of the invention is the deficiency in order to overcome above-mentioned background technology, a kind of read and write balanced obstruction queue implementing method and device are provided, can effectively alleviate sudden, noncontinuity, non-quantitation data processing pressure in enormous quantities, reduced data queue calling logic, remove the risk of general multithreading polling data, significantly improve application program and process the stability of sudden big data quantity.
The invention provides a kind of balanced obstruction queue implementing method of reading and writing, comprise the following steps:
A, add data to synchronous obstruction queue:
Step 101, program are added N bar data in synchronous obstruction queue, and N is positive integer;
Step 102, in multithreading situation, attempt obtaining the synchrolock of queue;
Step 103, obtain after the synchrolock of queue, before data are added in the obstruction queue to synchronous, determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, and continues to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, queue throw exception;
Step 104, N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching;
Step 105, program continue to increase, circulation is added; Or abandon increasing, complete interpolation step;
Step 106, program are abandoned continuing to add, and add flow process and finish;
B, from synchronous obstruction queue reading out data:
Step 201, program are to synchronous obstruction queue reading out data;
Step 202, in multithreading situation, attempt obtaining the synchrolock of queue;
Step 203, obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, represent not have so data, continue to wait for to obtain data entrance, until add data according to steps A in synchronous obstruction queue;
Step 204, have data in synchronous obstruction queue, disposable obtaining " maximum number " bar data from this queue, described " maximum number " is the parameter of queue definitions: the maximum data entry number that disposable batch obtains; If in queue, data are less than " maximum number " bar, returns to all data of queue, bolt part is waited for minimum particle size time " minimum interval " millisecond, then discharges the synchrolock of queue; Described " minimum interval " is the parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval ", then discharges the synchrolock of queue; Described " average time interval " is the parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice;
Step 205, program continue reading out data, or abandon reading, and complete read step;
Step 206, program are abandoned continuing to read, and read flow process and finish;
Steps A before step B or afterwards.
The present invention also provides a kind of obstruction queue implement device of read-write equilibrium of applying said method, comprises adding device and reading unit, wherein:
Described adding device, for: add data to synchronous obstruction queue:
In synchronous obstruction queue, add N bar data, N is positive integer; In multithreading situation, attempt obtaining the synchrolock of queue; Obtain after the synchrolock of queue, before data are added in the obstruction queue to synchronous, determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, and continues to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, queue throw exception;
N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching; Program continues to increase, circulation is added, or abandons increasing, and completes interpolation; Program is abandoned continuing to add, and adds and finishes;
Described reading unit, for: the obstruction queue reading out data from synchronous:
To synchronous obstruction queue reading out data; In multithreading situation, attempt obtaining the synchrolock of queue; Obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, represent not have so data, continue to wait for to obtain data entrance, until add data according to adding device in synchronous obstruction queue;
Have data in synchronous obstruction queue, disposable obtaining " maximum number " bar data from this queue, described " maximum number " is the parameter of queue definitions: the maximum data entry number that disposable batch obtains; If in queue, data are less than " maximum number " bar, returns to all data of queue, bolt part is waited for minimum particle size time " minimum interval " millisecond, then discharges the synchrolock of queue; Described " minimum interval " is the parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval ", discharge again the synchrolock of queue, described " average time interval " is the parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice; Continue reading out data; Or abandon reading, complete and read; Abandon continuing to read, read end.
Compared with prior art, advantage of the present invention is as follows:
(1) the present invention is queued up and is processed by asynchronous message queue, reduces the pressure that the unexpected arriving of big data quantity brings, and can effectively alleviate sudden, noncontinuity, non-quantitation data processing pressure in enormous quantities.
(2) the present invention, by interpolation, reading out data entrance in batches, meets partition in the situation that data volume is many and processes, and aggregation process in the little situation of data volume effectively increases the smoothness of data processing.
(3) the present invention, by synchrolock and bolt part, substitutes the general implementation such as poll, thread waits, can effectively save program resource.
(4) the present invention can reduced data queue calling logic, removes the risk of general multithreading polling data, significantly improves application program and process the stability of sudden big data quantity.
Brief description of the drawings
Fig. 1 is the process flow diagram that adds data in the embodiment of the present invention to queue.
Fig. 2 is the process flow diagram from queue reading out data in the embodiment of the present invention.
Embodiment
Below in conjunction with drawings and the specific embodiments, the present invention is described in further detail.
The embodiment of the present invention provides a kind of balanced obstruction queue implementing method of reading and writing, and comprises the following steps:
A, shown in Figure 1, adds data to synchronous obstruction queue:
Step 101, program are added N bar data in synchronous obstruction queue, and N is positive integer;
Step 102, in multithreading situation, in order to ensure integrality and the correctness of data, attempt obtaining the synchrolock of queue;
Step 103, obtain after the synchrolock of queue, before adding data, the obstruction queue to synchronous needs to determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, program meeting operation exception, so need to continue to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, forever cannot add in the middle of queue queue meeting throw exception to;
Step 104, N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching;
Step 105, program can continue to increase, and circulation is added; Also can abandon increasing, complete interpolation step;
Step 106, program are abandoned continuing to add, and add flow process and finish.
B, shown in Figure 2, the obstruction queue reading out data from synchronous:
Step 201, program are to synchronous obstruction queue reading out data;
Step 202, in multithreading situation, in order to ensure integrality and the correctness of data, attempt obtaining the synchrolock of queue;
Step 203, obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, represent not have so data, continue to wait for to obtain data entrance, until add data according to steps A in synchronous obstruction queue;
Step 204, have data in synchronous obstruction queue, disposable obtaining " maximum number " from this queue (parameter of queue definitions: the maximum data entry number that disposable batch obtains) bar data, if in queue, data are less than " maximum number " bar, return to all data of queue, bolt part is waited for minimum particle size time " the minimum interval " (parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice) millisecond, then discharge the synchrolock of queue; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval " (parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice), then discharges the synchrolock of queue.
Step 205, program can continue reading out data; Also can abandon reading, complete read step;
Step 206, program are abandoned continuing to read, and read flow process and finish.
Block queue and do not distinguish and add and the priority of obtaining step, steps A front or after can.
The embodiment of the present invention also provides a kind of obstruction queue implement device of read-write equilibrium of applying said method, comprises adding device and reading unit, wherein:
Adding device, for: add data to synchronous obstruction queue:
In synchronous obstruction queue, add N bar data, N is positive integer; In multithreading situation, in order to ensure integrality and the correctness of data, attempt obtaining the synchrolock of queue;
Obtain after the synchrolock of queue, before adding data, the obstruction queue to synchronous needs to determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, program meeting operation exception, so need to continue to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, forever cannot add in the middle of queue queue meeting throw exception to;
N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching; Program can continue to increase, and circulation is added; Also can abandon increasing, complete interpolation; Program is abandoned continuing to add, and adds and finishes.
Reading unit, for: the obstruction queue reading out data from synchronous:
To synchronous obstruction queue reading out data; In multithreading situation, in order to ensure integrality and the correctness of data, attempt obtaining the synchrolock of queue; Obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, representing does not so have data, obtains data entrance and need to continue to wait for, until add data according to adding device in synchronous obstruction queue;
Have data in synchronous obstruction queue, disposable obtaining " maximum number " from this queue (parameter of queue definitions: the maximum data entry number that disposable batch obtains) bar data, if in queue, data are less than " maximum number " bar, return to all data of queue, bolt part is waited for minimum particle size time " the minimum interval " (parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice) millisecond, then discharge the synchrolock of queue; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval " (parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice), then discharges the synchrolock of queue; Can continue reading out data; Also can abandon reading, complete and read; Abandon continuing to read, read end.
The principle of the embodiment of the present invention is elaborated as follows:
In the embodiment of the present invention, relate to a synchronous obstruction queue, global synchronization object lock and ensure three prerequisites of lock, wherein:
Synchronous obstruction queue, is used for storing data and reading out data;
A global synchronization object lock, is used for ensureing the interpolation of hourglass queue, the Thread safety of deleting, obtaining;
Three prerequisites are respectively: data are that non-NULL prerequisite, data are to postpone prerequisite less than prerequisite and lock, and only, in the situation that three prerequisites all meet, lock just can discharge.
The specific implementation process of reading and writing balanced obstruction queue in the embodiment of the present invention is:
Queue individual packages is become to an object class, and its attribute kit has contained a queue, a synchrolock, three bolt parts, defines adding method and obtain removing method in class, represents respectively to add data entrance and obtains data entrance.
Increasing data entry process is: before data access method, and the legal verification of advanced row data, data exception is pointed out abnormal information, the legal synchrolock that starts to obtain queue of data; After the synchrolock of queue to be got, if the length of data has exceeded the maximum length restriction of queue, directly prompting is abnormal, if do not had, whether continue to detect queue has enough spaces to carry out data interpolation, if there is no enough spaces, and " less than the prerequisite " of the synchrolock of waiting list, and continue judgement, until add addible time; Finally wait until that the condition that can add data meets, add data, " the non-NULL prerequisite " of the synchrolock of queue is set to available, and discharge the synchrolock of queue.
Reading out data entry process is: before entering reading out data method, first obtain the synchrolock of queue; After obtaining the synchrolock of queue, check in queue whether have data, if queuing data is sky, continue to wait for, it is unavailable opening " non-NULL prerequisite ", until " non-NULL prerequisite " is available, start from queue, to obtain data, before obtaining data, first distinguish the remaining data structure of queue, if exceed the predefined maximum entry number of obtaining at every turn, carry out in batches, once obtain maximum entry number, then set interval time and wait for; If in predefined maximum entry number, directly return to the data in current queue; Obtain data complete time, from queue, remove the data that read, open " less than prerequisite ", and discharge lock, allow other processes to add or obtain and remove operation.Hourglass queue is the queue of an obstruction in principle, and in memory-resident, user determines need to call queue destroying method when exiting, reaches resource and destroys object.
In the queue of the embodiment of the present invention, max cap. restriction is followed in the preservation of data, in the license of max cap. scope, can add data manipulation by multiple threads.In queue, data acquisition is followed: when (1) does not have data, wait is blocked in queue; (2) having data is fast processing, does not delay; (3), in the situation of sudden big data quantity, queue is according to the orderly batch processing in given time interval.
The principle of the embodiment of the present invention is similar to hourglass and drips sand, and in the time that the sand of hourglass the inside is sufficient, sand can be controlled by this bottleneck of the tiny outlet of hourglass, and what sand was must be successively orderly flows down; In the time that sand is fewer, can from hourglass, pass through immediately, for the outlet of hourglass, the sand of its outflow is forever in the controlled range of bottleneck like this.
In general large software system, in the time that data volume is larger, there is the situations such as sudden, interim, often server cannot carry processing pressure, causes system crash, and industry general scheme has two classes: add processing power or queuing, hourglass queue is a kind of linear optimization solution of queuing just, it is followed: when in the situation of data congestion, the thread that adds data blocks wait in queue, and the thread of consumption data is consumption in order within the scope of controllable pressure; In the normal situation of data volume, there are data to consume; In the non-existent situation of data, queue is blocked, and reduces thread pressure.
That the present invention can effectively be alleviated is sudden, noncontinuity, non-quantitation data processing pressure in enormous quantities, and reduced data queue calling logic is removed the risk of general multithreading polling data, significantly improves application program and process the stability of sudden big data quantity.
Those skilled in the art can carry out various modifications and variations to the embodiment of the present invention, if these amendment and modification within the scope of the claims in the present invention and equivalent technologies thereof, these revise and modification also within protection scope of the present invention.
The prior art that the content of not describing in detail in instructions is known to the skilled person.
Claims (2)
1. read and write a balanced obstruction queue implementing method, it is characterized in that, comprise the following steps:
A, add data to synchronous obstruction queue:
Step 101, program are added N bar data in synchronous obstruction queue, and N is positive integer;
Step 102, in multithreading situation, attempt obtaining the synchrolock of queue;
Step 103, obtain after the synchrolock of queue, before data are added in the obstruction queue to synchronous, determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, and continues to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, queue throw exception;
Step 104, N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching;
Step 105, program continue to increase, circulation is added; Or abandon increasing, complete interpolation step;
Step 106, program are abandoned continuing to add, and add flow process and finish;
B, from synchronous obstruction queue reading out data:
Step 201, program are to synchronous obstruction queue reading out data;
Step 202, in multithreading situation, attempt obtaining the synchrolock of queue;
Step 203, obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, represent not have so data, continue to wait for to obtain data entrance, until add data according to steps A in synchronous obstruction queue;
Step 204, have data in synchronous obstruction queue, disposable obtaining " maximum number " bar data from this queue, described " maximum number " is the parameter of queue definitions: the maximum data entry number that disposable batch obtains; If in queue, data are less than " maximum number " bar, returns to all data of queue, bolt part is waited for minimum particle size time " minimum interval " millisecond, then discharges the synchrolock of queue; Described " minimum interval " is the parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval ", then discharges the synchrolock of queue; Described " average time interval " is the parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice;
Step 205, program continue reading out data, or abandon reading, and complete read step;
Step 206, program are abandoned continuing to read, and read flow process and finish;
Steps A before step B or afterwards.
2. application rights requires an obstruction queue implement device for the read-write equilibrium of method described in 1, it is characterized in that: comprise adding device and reading unit, wherein:
Described adding device, for: add data to synchronous obstruction queue:
In synchronous obstruction queue, add N bar data, N is positive integer; In multithreading situation, attempt obtaining the synchrolock of queue; Obtain after the synchrolock of queue, before data are added in the obstruction queue to synchronous, determine whether synchronous obstruction queue can increase N bar data, if increased after N bar data, queue exceeds maximum scope is set, and continues to wait for, until queue allows to add N bar record; If N exceedes queue maximum length, queue throw exception;
N bar data are added to after synchronous obstruction queue, add data step and complete, discharge the synchrolock of queue, ensure that this queue can be by other thread dispatching; Program continues to increase, circulation is added, or abandons increasing, and completes interpolation; Program is abandoned continuing to add, and adds and finishes;
Described reading unit, for: the obstruction queue reading out data from synchronous:
To synchronous obstruction queue reading out data; In multithreading situation, attempt obtaining the synchrolock of queue; Obtain after the synchrolock of queue, if the data in synchronous obstruction queue are empty, represent not have so data, continue to wait for to obtain data entrance, until add data according to adding device in synchronous obstruction queue;
Have data in synchronous obstruction queue, disposable obtaining " maximum number " bar data from this queue, described " maximum number " is the parameter of queue definitions: the maximum data entry number that disposable batch obtains; If in queue, data are less than " maximum number " bar, returns to all data of queue, bolt part is waited for minimum particle size time " minimum interval " millisecond, then discharges the synchrolock of queue; Described " minimum interval " is the parameter of queue definitions: in the unplugged situation of queue, obtain the minimum interval between data for twice; If exceed " maximum number " bar data, return to " maximum number " bar data, bolt part is waited for " average time interval ", discharge again the synchrolock of queue, described " average time interval " is the parameter of queue definitions: in the situation that queuing data is blocked up, obtain the average time interval between data for twice; Continue reading out data; Or abandon reading, complete and read; Abandon continuing to read, read end.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410168357.0A CN103970597B (en) | 2014-04-24 | 2014-04-24 | Queue implementing method and device are blocked in read-write in a balanced way |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410168357.0A CN103970597B (en) | 2014-04-24 | 2014-04-24 | Queue implementing method and device are blocked in read-write in a balanced way |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103970597A true CN103970597A (en) | 2014-08-06 |
| CN103970597B CN103970597B (en) | 2017-06-20 |
Family
ID=51240132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410168357.0A Active CN103970597B (en) | 2014-04-24 | 2014-04-24 | Queue implementing method and device are blocked in read-write in a balanced way |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103970597B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528051A (en) * | 2016-11-15 | 2017-03-22 | 国云科技股份有限公司 | High-efficiency operation method for queuing and stacking big data based on MongoDB |
| CN108089930A (en) * | 2016-11-22 | 2018-05-29 | 北京国双科技有限公司 | The sending method and device of data |
| CN112506992A (en) * | 2020-12-04 | 2021-03-16 | 中国人寿保险股份有限公司 | Fuzzy query method and device for Kafka data, electronic equipment and storage medium |
| CN115578099A (en) * | 2022-12-09 | 2023-01-06 | 浙江保融科技股份有限公司 | Preprocessing method based on foreign exchange price blocking |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102281A (en) * | 2007-08-16 | 2008-01-09 | 中兴通讯股份有限公司 | Data processing method for reporting a large number of data in mobile communication system |
| CN102117308A (en) * | 2010-01-06 | 2011-07-06 | 卓望数码技术（深圳）有限公司 | Data processing method and data processing system |
| CN102129396A (en) * | 2011-03-04 | 2011-07-20 | 中国科学院软件研究所 | Real-time and high-speed inter-thread data exchange method |
-
2014
- 2014-04-24 CN CN201410168357.0A patent/CN103970597B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102281A (en) * | 2007-08-16 | 2008-01-09 | 中兴通讯股份有限公司 | Data processing method for reporting a large number of data in mobile communication system |
| CN102117308A (en) * | 2010-01-06 | 2011-07-06 | 卓望数码技术（深圳）有限公司 | Data processing method and data processing system |
| CN102129396A (en) * | 2011-03-04 | 2011-07-20 | 中国科学院软件研究所 | Real-time and high-speed inter-thread data exchange method |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528051A (en) * | 2016-11-15 | 2017-03-22 | 国云科技股份有限公司 | High-efficiency operation method for queuing and stacking big data based on MongoDB |
| CN106528051B (en) * | 2016-11-15 | 2019-02-19 | 国云科技股份有限公司 | The method of big data queue stack manipulation based on MongoDB |
| CN108089930A (en) * | 2016-11-22 | 2018-05-29 | 北京国双科技有限公司 | The sending method and device of data |
| CN112506992A (en) * | 2020-12-04 | 2021-03-16 | 中国人寿保险股份有限公司 | Fuzzy query method and device for Kafka data, electronic equipment and storage medium |
| CN112506992B (en) * | 2020-12-04 | 2024-04-16 | 中国人寿保险股份有限公司 | Fuzzy query method and device for Kafka data, electronic equipment and storage medium |
| CN115578099A (en) * | 2022-12-09 | 2023-01-06 | 浙江保融科技股份有限公司 | Preprocessing method based on foreign exchange price blocking |
| CN115578099B (en) * | 2022-12-09 | 2023-04-18 | 浙江保融科技股份有限公司 | Preprocessing method based on foreign exchange price blocking |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103970597B (en) | 2017-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106547612B (en) | Multitasking method and device | |
| CN109784930B (en) | Block chain transaction data processing method and device, electronic equipment and medium | |
| CN1973266B (en) | Improvements in or relating to an operating system for a computing device | |
| CN108334396B (en) | Data processing method and device, and resource group creation method and device | |
| CN106569891B (en) | Method and device for scheduling and executing tasks in storage system | |
| Prakash et al. | A nonblocking algorithm for shared queues using compare-and-swap | |
| US20180150326A1 (en) | Method and apparatus for executing task in cluster | |
| WO2015157068A1 (en) | Method and device for augmenting and releasing capacity of computing resources in real-time stream computing system | |
| CN103631661A (en) | Internal storage management method and device | |
| CN103970597A (en) | Read-write balanced blocking queue implementation method and device | |
| CN105337896A (en) | Message processing method and device | |
| US10884667B2 (en) | Storage controller and IO request processing method | |
| EP3376381A1 (en) | Resource management method and system, and computer storage medium | |
| US7984439B2 (en) | Efficient mechanism for preventing starvation in counting semaphores | |
| EP2420930A2 (en) | Apparatus and method for thread scheduling and lock acquisition order control based on deterministic progress index | |
| CN104461707A (en) | Locking request processing method and device | |
| CN109857612A (en) | A kind of monitoring method and its terminal of data write operation | |
| CN104932933A (en) | Spin lock acquisition method and apparatus | |
| CN108139938A (en) | For assisting the device of main thread executing application task, method and computer program using secondary thread | |
| CN111190541B (en) | Flow control method of storage system and computer readable storage medium | |
| EP3702911B1 (en) | Hardware for supporting os driven load anticipation based on variable sized load units | |
| CN111782378A (en) | Adaptive processing performance adjusting method, server and readable storage medium | |
| CN115562840A (en) | Task processing method, device and medium | |
| US11360702B2 (en) | Controller event queues | |
| EP3550421B1 (en) | Storage controller and io request processing method |
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 |