CN104252347A - Task waiting-time processing system and method - Google Patents
Task waiting-time processing system and method Download PDFInfo
- Publication number
- CN104252347A CN104252347A CN201310263338.1A CN201310263338A CN104252347A CN 104252347 A CN104252347 A CN 104252347A CN 201310263338 A CN201310263338 A CN 201310263338A CN 104252347 A CN104252347 A CN 104252347A
- Authority
- CN
- China
- Prior art keywords
- task
- time
- particular type
- type
- estimated wait
- 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
Abstract
The invention relates to a task waiting-time processing method. The method comprises the following steps of calculating the estimated waiting time of a specific-type task processed by a current data center; sending the estimated waiting time of the specific-type task to a client end, and displaying the estimated waiting time on the client end; after the processing for the specific-type task is finished, calculating the actual waiting time of the specific-type task; counting the estimated waiting time and the actual waiting time of the specific-type task in a certain period, calculating a correction coefficient, and correcting the estimated waiting time of the specific-type task according to the correction coefficient. By utilizing the method, the required waiting time for processing the task can be estimated in advance, and the waiting time is dynamically updated according to actual situations; thus, a user can determine whether to continue to wait or firstly process other works according to the length of time after seeing the time, so that the user is facilitated.
Description
Technical field
The present invention relates to a kind of virtual machine control system and method, especially about a kind of task waiting time disposal system and method.
Background technology
At present, task process (such as, patent application document turns shelves) all adopt the mode of background service to process, user is after the process of related pages initiating task, system can provide a prompting, and (case is turning in shelves, please after a while), but, user very intuitively can not arrive task process also will wait for the time how long, and user also cannot estimate the time that task process probably needs to wait for, this just brings very large puzzlement to user, do not know it is continue to wait for, or the work that first can complete other processes this task again, if continue to wait for, likely just waste the unnecessary stand-by period, if processed again after a while, do not know again how long process again.
Summary of the invention
In view of above content, be necessary to provide a kind of task waiting time disposal system, it can be the time needing wait for estimation tasks process in advance, and the time of wait is dynamically updated according to actual conditions, thus, user just can go decision to be continue wait for or first process other work according to duration after seeing the time, facilitates user.
In view of above content, there is a need to provide a kind of task waiting time disposal route, it can be the time needing wait for estimation tasks process in advance, and the time of wait is dynamically updated according to actual conditions, thus, user just can go decision to be continue wait for or first process other work according to duration after seeing the time, facilitates user.
A kind of task waiting time disposal system, this system cloud gray model is in monitoring server, and this system comprises: computing module, for calculating the estimated wait time of the task of current data center processing particular type; Display module, the estimated wait time for the task by this particular type sends to client, and shows on the client; Update module, for the estimated wait time of the task of this particular type that upgrades in time; Described display module, the estimated wait time also for the task by this particular type after renewal sends to client, and shows on the client; Described computing module, also for after completing when the task process of this particular type, calculates the actual stand-by period of the task of this particular type; Correcting module, for adding up the estimated wait time of the task of this particular type of regular period and actual stand-by period, and calculates a correction factor, according to the estimated wait time of the task of this particular type of correction factor correction.
A kind of task waiting time disposal route, the method applies in monitoring server, and the method comprises: the estimated wait time calculating the task of current data center processing particular type; The estimated wait time of the task of this particular type is sent to client, and shows on the client; The estimated wait time of the task of this particular type that upgrades in time; The estimated wait time of the task of this particular type after renewal is sent to client, and shows on the client; After the task process of this particular type completes, calculate the actual stand-by period of the task of this particular type; The estimated wait time of the task of this particular type of statistics regular period and actual stand-by period, and calculate a correction factor, according to the estimated wait time of the task of this particular type of correction factor correction.
Compared to prior art, task waiting time disposal system provided by the invention and method, its can estimation tasks process in advance need wait for time, and the time of wait is dynamically updated according to actual conditions, thus, user just can go decision to be continue wait for or first process other work according to duration after seeing the time, facilitates user.
Accompanying drawing explanation
Fig. 1 is the applied environment figure of task waiting time disposal system of the present invention preferred embodiment.
Fig. 2 is the structural representation of supervisory control comuter preferred embodiment of the present invention.
Fig. 3 is the process flow diagram of task waiting time disposal route of the present invention preferred embodiment.
Main element symbol description
| Client | 10 |
| Supervisory control comuter | 20 |
| Database | 30 |
| Network | 40 |
| Data center | 50 |
| Server | 500 |
| Task waiting time disposal system | 200 |
| Computing module | 210 |
| Display module | 220 |
| Update module | 230 |
| Correcting module | 240 |
| Storer | 250 |
| Processor | 260 |
Following embodiment will further illustrate the present invention in conjunction with above-mentioned accompanying drawing.
Embodiment
Consulting shown in Fig. 1, is the applied environment figure of task waiting time disposal system 200 of the present invention preferred embodiment.This task waiting time disposal system 200 is applied in supervisory control comuter 20.This supervisory control comuter 20 is communicated to connect by network 40 with data center (Data Center) 50.
Described network 40 can be internet, LAN (Local Area Network) or other communication network.
Described data center 50 comprises in multiple server 500(figure for four), described server 500 is blade server.Described server 500 is for the treatment of task, described task can be a file turn shelves (such as, the patent application document of WORD form being converted to the form of the patent application document of official regulations), the download of file or file the task that server processes automatically such as to upload.
Described supervisory control comuter 20, for the ruuning situation of the server 500 at monitor data center 50, calculates with in the heart 50 in the data the stand-by period processing each task, and presents to client 10.The stand-by period of described each task comprises the estimated wait time of each task and the actual stand-by period of each task.The account form of the stand-by period of each task will be described in detail in Fig. 2 and Fig. 3.
This supervisory control comuter 20 is also provided with DynamicHost and arranges agreement (Dynamic Host Configuration Protocol, DHCP) serve, by agreement (the Internet Protocol that DHCP service can interconnect between distribution network, IP) address is to each server 500 in data center 50, and supervisory control comuter 20 can be communicated with each server 500 of data center 50.This supervisory control comuter 20 can be personal computer, the webserver, can also be any computing machine that other is suitable for.In addition, it is inner that this supervisory control comuter 20 can also be placed on data center 50, and namely this supervisory control comuter 20 also can be the station server in data center 50.User only need be undertaken operating the monitoring that just can realize the server 500 in data center 50 by client 10.
Described supervisory control comuter 20 is connected with database 30 by a DataBase combining.Wherein, described DataBase combining can be an open database inter connection (Open Database Connectivity, ODBC), or Java DataBase combining (Java Database Connectivity, JDBC).Described database 30 is for storing the data sent from each server 500 of data center 50, and these data comprise the information such as estimated wait time and actual stand-by period of each task.
It should be noted that at this, database 30 independent of supervisory control comuter 20, also can be positioned at supervisory control comuter 20.In the hard disk that described database 30 can be stored in supervisory control comuter 20 or flash disk.Consider from the angle of security of system, the database 30 in the present embodiment is independent of supervisory control comuter 20.
Described client 10 provides the login interface of a data center 50, can start the process to some tasks by this login interface user, and such as, user by login interface upload file to data center 50, can start and turn shelves to this file afterwards.This client 10 can be personal computer, notebook computer, mobile phone, panel computer and other equipment that can be connected with supervisory control comuter 20 arbitrarily.
Consulting shown in Fig. 2, is the structural representation of supervisory control comuter 20 of the present invention preferred embodiment.This supervisory control comuter 20 comprises task waiting time disposal system 200.This task waiting time disposal system 200 comprises computing module 210, display module 220, update module 230, correcting module 240.Module alleged by the present invention has been the computer program code segments of a specific function, is more suitable for describing software implementation in a computer, therefore all describes with module in software description below the present invention than program.
Described computing module 210 processes the estimated wait time of the task of a certain type for calculating current data center 50.The estimated wait time of the task of described a certain type comprises the queuing time (i.e. the queuing time sum of the expected processing time of the task of the type and the task of the type) of the expected processing time of the task of the type and the task of the type.Specifically, the expected processing time of the task of described the type calculates in the following way: the average handling time in advance task of a certain type being tested to the task of drawing the type, this average handling time is the expected processing time of the task of the type.When there being a task start, directly obtaining the average handling time of this task according to the type (as new application case or reply case) of this task, being the expected processing time of this task.For example, supervisory control comuter 20 sends instruction in advance to data center 50, and require that data center 50 passes through the mode of test repeatedly (such as, 100 times) process the task of a certain type, record processes the time of the task of the type each time, described computing module 210 calculates the average handling time of the task of the type and is saved to database 30 afterwards, when there being the task start an of the type, from database 30, the average handling time of this task is directly obtained according to the type (as new application case or reply case) of this task, namely the expected processing time of this task is obtained.
The account form of the queuing time of the task of described the type is as follows: first calculate the T.T. that data center 50 processes all tasks, then divided by the quantity of server 500 in data center 50, thus draw the queuing time of each task.The account form that data center 50 processes the T.T. of all tasks is as follows: the quantity of the often kind of task type comprised in statistics center 50, and obtain the expected processing time of the task of every type, sue for peace after the quantity of often kind of task type is multiplied by the expected processing time of the task of every type.For example, tentation data center 50 comprises the task of two types, adds up the quantity of the task of this two type, and sues for peace to the time of the task of every type, show that data center 50 processes the T.T. of all tasks.
It should be noted that, because task quantity handled in data center 50 is dynamic change (such as, after some task process complete, task quantity reduces one), draw thus, the queuing time of task is dynamic change.Further, the estimated wait time of described task is also dynamic change.
Described display module 220 sends to client 10 for the estimated wait time of the task by the type, and shows in client 10.
Described update module 230 is for the estimated wait time of the task of the type that upgrades in time.Specifically, described update module 230 at regular intervals (such as, five seconds) calculate task quantity (namely comprising all types of task quantity in data center 50) in data center 50, thus calculate the estimated wait time of the task of up-to-date the type.
Described display module 220 also sends to client 10 for the estimated wait time of the task by the type after renewal, and shows in client 10.
Described computing module 210, for after completing when the task process of the type, calculates the actual stand-by period of the task of the type.Specifically, computing module 210 timing from during the task start of the type, the task process to the type completes, and records the actual stand-by period that this task process completes.
Described correcting module 240 for adding up the estimated wait time of the task of the type of regular period (such as, three days) and actual stand-by period, and calculates a correction factor, according to the estimated wait time of the task of correction factor correction the type.Specifically, through accumulation after a while, the estimated wait time of the task of the type of described correcting module 240 statistical study and actual stand-by period, as shown in the table:
| Time | Estimated wait time T1 | Actual stand-by period T2 | Mistiming T2-T1 |
| Monday | 90S | 95S | 5S |
| Tuesday | 90S | 96S | 6S |
| Wednesday | 90S | 94S | 4S |
As can be seen from above table, because there is various uncertain factor, actual stand-by period and estimated wait time are differentiated, count this mistiming, then the mean value of mistiming is calculated, task difference averaging time that can calculate the type in above table is 5 seconds (S), so within 5 seconds, is the correction factor S of the task of the type, using the estimated wait time of the time T1+S calculated as display.That is, the estimated wait time of revised each task is T1+5.
It should be noted that, described correcting module 240 at set intervals (such as, a week) needs to recalculate correction factor, makes follow-up result of calculation accuracy higher.
(daily record of the reason operating system of mistake is all on the books for the producing cause of described correcting module 240 when also analyzing and processing task sends mistake and probability, can read from daily record, probability just can calculate according to the task quantity and total task quantity that occur mistake).
As shown in Figure 3, be the process flow diagram of task waiting time disposal route of the present invention preferred embodiment.
Step S10, computing module 210 processes the estimated wait time of the task of a certain type for calculating current data center 50.The estimated wait time of the task of described a certain type comprises the queuing time (i.e. the queuing time sum of the expected processing time of the task of the type and the task of the type) of the expected processing time of the task of the type and the task of the type.Specifically, the expected processing time of the task of described the type calculates in the following way: the average handling time in advance task of a certain type being tested to the task of drawing the type, this average handling time is the expected processing time of the task of the type.When there being a task start, directly obtaining the average handling time of this task according to the type (as new application case or reply case) of this task, being the expected processing time of this task.For example, supervisory control comuter 20 sends instruction in advance to data center 50, and require that data center 50 passes through the mode of test repeatedly (such as, 100 times) process the task of a certain type, record processes the time of the task of the type each time, described computing module 210 calculates the average handling time of the task of the type and is saved to database 30 afterwards, when there being the task start an of the type, from database 30, the average handling time of this task is directly obtained according to the type (as new application case or reply case) of this task, namely the expected processing time of this task is obtained.
The account form of the queuing time of the task of described the type is as follows: first calculate the T.T. that data center 50 processes all tasks, then divided by the quantity of server 500 in data center 50, thus draw the queuing time of each task.The account form that data center 50 processes the T.T. of all tasks is as follows: the quantity of the often kind of task type comprised in statistics center 50, and obtain the expected processing time of the task of every type, sue for peace after the quantity of often kind of task type is multiplied by the expected processing time of the task of every type.For example, tentation data center 50 comprises the task of two types, adds up the quantity of the task of this two type, and sues for peace to the time of the task of every type, show that data center 50 processes the T.T. of all tasks.
It should be noted that, because task quantity handled in data center 50 is dynamic change (such as, after some task process complete, task quantity reduces one), draw thus, the queuing time of task is dynamic change.Further, the estimated wait time of described task is also dynamic change.
Step S20, the estimated wait time of the task of the type is sent to client 10 by display module 220, and shows in client 10.
Step S30, update module 230 upgrades in time the estimated wait time of task of the type.Specifically, described update module 230 at regular intervals (such as, five seconds) calculate task quantity (namely comprising all types of task quantity in data center 50) in data center 50, thus calculate the estimated wait time of the task of up-to-date the type.
Step S40, the estimated wait time of the task of the type after renewal is sent to client 10 by display module 220, and shows in client 10.
Step S50, after the task process of the type completes, computing module 210 calculates the actual stand-by period of the task of the type.Specifically, computing module 210 timing from during the task start of the type, the task process to the type completes, and records the actual stand-by period that this task process completes.
Step S60, correcting module 240 adds up the estimated wait time of the task of the type of regular period (such as, three days) and actual stand-by period, and calculates a correction factor, according to the estimated wait time of the task of correction factor correction the type.Specifically, through accumulation after a while, the estimated wait time of the task of the type of described correcting module 240 statistical study and actual stand-by period, as shown in the table:
| Time | Estimated wait time T1 | Actual stand-by period T2 | Mistiming T2-T1 |
| Monday | 90S | 95S | 5S |
| Tuesday | 90S | 96S | 6S |
| Wednesday | 90S | 94S | 4S |
As can be seen from above table, because there is various uncertain factor, actual stand-by period and estimated wait time are differentiated, count this mistiming, then the mean value of mistiming is calculated, task difference averaging time that can calculate the type in above table is 5 seconds (S), so within 5 seconds, is the correction factor S of the task of the type, using the estimated wait time of the time T1+S calculated as display.That is, the estimated wait time of revised each task is T1+5.
It should be noted that, described correcting module 240 at set intervals (such as, a week) needs to recalculate correction factor, makes follow-up result of calculation accuracy higher.
(daily record of the reason operating system of mistake is all on the books for the producing cause of described correcting module 240 when also analyzing and processing task sends mistake and probability, can read from daily record, probability just can calculate according to the task quantity and total task quantity that occur mistake).
It should be noted last that, above embodiment is only in order to illustrate technical scheme of the present invention and unrestricted, although with reference to above preferred embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that, can modify to technical scheme of the present invention or equivalent replacement, and not depart from the spirit and scope of technical solution of the present invention.
Claims (10)
1. a task waiting time disposal system, this system cloud gray model, in monitoring server, is characterized in that, this system comprises:
Computing module, for calculating the estimated wait time of the task of current data center processing particular type;
Display module, the estimated wait time for the task by this particular type sends to client, and shows on the client;
Update module, for the estimated wait time of the task of this particular type that upgrades in time;
Described display module, the estimated wait time also for the task by this particular type after renewal sends to client, and shows on the client;
Described computing module, also for after completing when the task process of this particular type, calculates the actual stand-by period of the task of this particular type; And
Correcting module, for adding up the estimated wait time of the task of this particular type of regular period and actual stand-by period, and calculates a correction factor, according to the estimated wait time of the task of this particular type of correction factor correction.
2. task waiting time disposal system as claimed in claim 1, it is characterized in that, the scheduled time of the task of described particular type comprises the queuing time of the expected processing time of the task of this particular type and the task of this particular type.
3. task waiting time disposal system as claimed in claim 2, it is characterized in that, the expected processing time of the task of this particular type described calculates in the following way: the average handling time task of this particular type being tested to the task of drawing this particular type, and the average handling time of the task of this particular type is the expected processing time of the task of this particular type.
4. task waiting time disposal system as claimed in claim 2, it is characterized in that, the account form of the queuing time of the task of this particular type described is as follows: first calculate the T.T. that data center processes all tasks, again divided by the quantity of server in data center, thus draw the queuing time of the task of this particular type.
5. task waiting time disposal system as claimed in claim 4, it is characterized in that, the account form that described data center processes the T.T. of all tasks is as follows: the quantity of the often kind of task type comprised in the heart in statistics, and obtain the expected processing time of the task of every type, sue for peace after the quantity of often kind of task type is multiplied by the expected processing time of the task of every type.
6. a task waiting time disposal route, the method applies to, in monitoring server, it is characterized in that, the method comprises:
Calculate the estimated wait time of the task of current data center processing particular type;
The estimated wait time of the task of this particular type is sent to client, and shows on the client;
The estimated wait time of the task of this particular type that upgrades in time;
The estimated wait time of the task of this particular type after renewal is sent to client, and shows on the client;
After the task process of this particular type completes, calculate the actual stand-by period of the task of this particular type; And
The estimated wait time of the task of this particular type of statistics regular period and actual stand-by period, and calculate a correction factor, according to the estimated wait time of the task of this particular type of correction factor correction.
7. task waiting time disposal route as claimed in claim 6, it is characterized in that, the scheduled time of the task of described particular type comprises the queuing time of the expected processing time of the task of this particular type and the task of this particular type.
8. task waiting time disposal route as claimed in claim 7, it is characterized in that, the expected processing time of the task of this particular type described calculates in the following way: the average handling time task of this particular type being tested to the task of drawing this particular type, and the average handling time of the task of this particular type is the expected processing time of the task of this particular type.
9. task waiting time disposal route as claimed in claim 7, it is characterized in that, the account form of the queuing time of the task of this particular type described is as follows: first calculate the T.T. that data center processes all tasks, again divided by the quantity of server in data center, thus draw the queuing time of the task of this particular type.
10. task waiting time disposal route as claimed in claim 9, it is characterized in that, the account form that described data center processes the T.T. of all tasks is as follows: the quantity of the often kind of task type comprised in the heart in statistics, and obtain the expected processing time of the task of every type, sue for peace after the quantity of often kind of task type is multiplied by the expected processing time of the task of every type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310263338.1A CN104252347A (en) | 2013-06-27 | 2013-06-27 | Task waiting-time processing system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310263338.1A CN104252347A (en) | 2013-06-27 | 2013-06-27 | Task waiting-time processing system and method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104252347A true CN104252347A (en) | 2014-12-31 |
Family
ID=52187294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310263338.1A Pending CN104252347A (en) | 2013-06-27 | 2013-06-27 | Task waiting-time processing system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104252347A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108171549A (en) * | 2017-12-28 | 2018-06-15 | 创通票科技有限公司 | Big data analysis observation system |
| CN109543988A (en) * | 2018-11-16 | 2019-03-29 | 中国银行股份有限公司 | The method, apparatus and storage medium of optimization transaction overtime threshold |
| US10482551B2 (en) | 2015-08-10 | 2019-11-19 | Google Llc | Systems and methods of automatically estimating restaurant wait times using wearable devices |
| CN113326170A (en) * | 2021-06-09 | 2021-08-31 | 深圳前海微众银行股份有限公司 | Task delay risk detection method, electronic device and storage medium |
| CN113886187A (en) * | 2021-10-19 | 2022-01-04 | 北京达佳互联信息技术有限公司 | Method and device for determining waiting time before task processing |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1533663A (en) * | 2001-05-30 | 2004-09-29 | �����ɷ� | Method and apparatus for individually estimating time required to download applicaton programs to remote modules over wireless network |
| US20060080433A1 (en) * | 2004-10-11 | 2006-04-13 | Umberto Caselli | Method and system for delivering information with optimized pre-fetching |
| CN102111422A (en) * | 2009-12-25 | 2011-06-29 | 中兴通讯股份有限公司 | Method for estimating download time and device-side |
| CN102110015A (en) * | 2009-12-29 | 2011-06-29 | 北大方正集团有限公司 | Method and device for determining task progress and task processing time |
| CN102792235A (en) * | 2011-03-15 | 2012-11-21 | 欧姆龙株式会社 | Controller support device, controller support program to be executed in said device, recording medium storing said program, and method for estimating execution duration of control program |
-
2013
- 2013-06-27 CN CN201310263338.1A patent/CN104252347A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1533663A (en) * | 2001-05-30 | 2004-09-29 | �����ɷ� | Method and apparatus for individually estimating time required to download applicaton programs to remote modules over wireless network |
| US20060080433A1 (en) * | 2004-10-11 | 2006-04-13 | Umberto Caselli | Method and system for delivering information with optimized pre-fetching |
| CN102111422A (en) * | 2009-12-25 | 2011-06-29 | 中兴通讯股份有限公司 | Method for estimating download time and device-side |
| CN102110015A (en) * | 2009-12-29 | 2011-06-29 | 北大方正集团有限公司 | Method and device for determining task progress and task processing time |
| CN102792235A (en) * | 2011-03-15 | 2012-11-21 | 欧姆龙株式会社 | Controller support device, controller support program to be executed in said device, recording medium storing said program, and method for estimating execution duration of control program |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10482551B2 (en) | 2015-08-10 | 2019-11-19 | Google Llc | Systems and methods of automatically estimating restaurant wait times using wearable devices |
| CN107924548B (en) * | 2015-08-10 | 2020-03-20 | 谷歌有限责任公司 | System and method for automatically monitoring real-time activity at a location using a wearable device to determine latency |
| CN108171549A (en) * | 2017-12-28 | 2018-06-15 | 创通票科技有限公司 | Big data analysis observation system |
| CN109543988A (en) * | 2018-11-16 | 2019-03-29 | 中国银行股份有限公司 | The method, apparatus and storage medium of optimization transaction overtime threshold |
| CN113326170A (en) * | 2021-06-09 | 2021-08-31 | 深圳前海微众银行股份有限公司 | Task delay risk detection method, electronic device and storage medium |
| CN113886187A (en) * | 2021-10-19 | 2022-01-04 | 北京达佳互联信息技术有限公司 | Method and device for determining waiting time before task processing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9137130B2 (en) | Dynamic network load forecasting | |
| CN104252347A (en) | Task waiting-time processing system and method | |
| US8856739B2 (en) | Method of updating list of software-as-a-service and system for the same | |
| US9935893B2 (en) | Systems and methods for dynamically allocating computing tasks to computer resources in a distributed processing environment | |
| CN102668456A (en) | Method and system for adapting a session timeout period | |
| US10896198B2 (en) | Scaling for elastic query service system | |
| US20180322442A1 (en) | Systems and methods for dynamically scheduling tasks across an enterprise | |
| CN108830177A (en) | Farming operations behavior checking method and device | |
| WO2019148728A1 (en) | Electronic device, execution task assignment method for distributed system, and storage medium | |
| US9184994B2 (en) | Downtime calculator | |
| US10033737B2 (en) | System and method for cross-cloud identity matching | |
| CN105450737B (en) | A kind of data processing method, device and system | |
| WO2023125435A1 (en) | Directional network detection method and apparatus based on tf-idf algorithm, device and medium | |
| CN112346846A (en) | Method and device for analyzing and arranging cloud resources and storage medium | |
| CN115270013A (en) | Method and device for evaluating emission reduction measures during activities and electronic equipment | |
| CN104394198A (en) | A global scheduling method based on an ESB | |
| CN113837569A (en) | IT service personnel matching method, system, electronic device and medium | |
| CN105933368A (en) | User behavior data uploading method and device | |
| US20160210170A1 (en) | Computing CPU Time Usage of Activities Serviced by CPU | |
| CN111045823A (en) | Context data load distribution method, device, equipment and storage medium | |
| WO2019169696A1 (en) | Platform client data backflow method, electronic apparatus, device, and storage medium | |
| CN111327486B (en) | Flow table issuing method, device and system and computer readable storage medium | |
| CN114281849B (en) | Data query method and device | |
| CN110197367B (en) | Large data volume automatic settlement method based on E-commerce platform | |
| TW201512806A (en) | System and method for handling waiting time of task |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20141231 |
|
| WD01 | Invention patent application deemed withdrawn after publication |