CN113127208A - Method for limiting user access service based on thread - Google Patents
Method for limiting user access service based on thread Download PDFInfo
- Publication number
- CN113127208A CN113127208A CN202110489976.XA CN202110489976A CN113127208A CN 113127208 A CN113127208 A CN 113127208A CN 202110489976 A CN202110489976 A CN 202110489976A CN 113127208 A CN113127208 A CN 113127208A
- Authority
- CN
- China
- Prior art keywords
- value
- user
- time
- users
- thread
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/504—Resource capping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/508—Monitor
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for limiting user access service based on thread, which comprises the steps of obtaining all users using target service; the administrator distributes the authority according to the identity of the user, particularly endows corresponding weight values, and sequentially borrows corresponding numerical values from high authority to low authority to sequentially represent from high to low; correspondingly marking the identity authority values of different users as Qi; the method comprises the steps of acquiring a comprehensive utilization value Zi, a deduction value Ki and an identity authority value Qi of a user Yi; calculating the sequence value Xi according to a formula; then acquiring the maximum thread of the target service; then at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users; and when the thread is free, continuously serving the rest users Yi.
Description
Technical Field
The invention belongs to the field of service access, relates to a thread limiting technology, and particularly relates to a method for limiting a user to access a service based on a thread.
Background
The patent with publication number CN103516536A discloses a method and system for parallel processing of server service requests based on thread number limitation, which adopts a control scheme for classifying and processing service requests according to different processing durations, and limits the upper limit of the number of threads that the server calls for parallel processing of each class of service requests, so as to avoid the situation that long-processing-duration service requests occupy the server threads, ensure that all part of threads in the server are used for parallel processing of short-processing-duration service requests, so that the distribution balance of server service request processing threads is enhanced, thereby improving the overall service request processing execution efficiency and user service efficiency of the server, and simultaneously reducing the possibility that the server performs parallel processing on a large number of long-processing-duration service requests with complicated operations to form "monopoly occupy" for the server system resources for a long time, thereby improving the reasonable performance of the system resource allocation of the server.
But for the condition that the thread limits the service of the user, the authority is given without the help of the comprehensive evaluation of personal habits, identities and the like of the user, and the service is stopped according to different conditions; to solve this problem, a solution is now provided.
Disclosure of Invention
The invention aims to provide a method for limiting a user to access a service based on a thread.
The purpose of the invention can be realized by the following technical scheme:
a method for limiting user access service based on thread includes the following steps:
step 1): acquiring a comprehensive value Zi, a deduction value Ki and an identity authority value Qi of a user Yi; calculating the order value Xi according to a formula, wherein the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
in the formula, 0.481 and 0.519 are preset weights;
step 2): acquiring a maximum thread of a target service;
step 3): at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users;
step 4): when the thread is free, continuing to serve the rest users Yi;
step 5): meanwhile, the real-time thread number of all users and the accumulated time are calculated, and the accumulated time is specifically represented as the total time of the corresponding user for using the target service;
step 6): and calculating the real-time value by using a formula, wherein the specific calculation formula is as follows:
real-time use value of 0.455 real-time number of threads +0.545 cumulative time;
and when the real-time value exceeds the comprehensive value of the corresponding user and the difference value is kept to be more than or equal to X2, X2 is a preset value, and the access of the user is completely limited at the moment.
Further, the identity confirmation processing steps in the third step specifically include:
s1: firstly, acquiring habit data of a user for thirty times before the user logs in, wherein the habit data comprises the interval time between every two keys when the user inputs the keys;
s2: the interval time is marked as Toj, o 1.., 30, j 1.., m; toj denotes the time interval between the jth key and the j +1 th key at the o time;
s3: let j equal 1; obtaining the interval To1, o 1.. and 30;
s4: obtaining an average Tp of the To 1;
s5: calculating the deviation value according to a formula, wherein the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, sequentially according to | To1-TpRemoving the interval value in a mode of increasing the | value to a smaller value;
s7: calculating a deviation value after each removal until the deviation value is less than or equal to X1; x1 is a preset value;
s8: then calculating the average value of the remaining interval time, and marking the value as the time interval Rj, j-1.
S9: repeating steps S3-S9 with j being j +1 to obtain all the asserted intervals, thereby forming an asserted interval group;
s10: acquiring each real-time interval value when the user inputs the secret key, namely acquiring the interval time between the secret keys corresponding to the key input; it is labeled Pj, j 1.·, m;
s11: calculating an approach value by using a formula, specifically:
s12: calibrating a deduction value according to the approach value, and expressing the deduction value of each user as Ki, wherein i is 1. Ki corresponds to Qi and Yi one to one.
Further, the specific way of calibrating the deduction value according to the approach value is as follows:
when approaching the value < X3, let the deduction value be zero;
when the approximate value of X3 is less than or equal to X4, the deduction value is 0.25;
when approaching the value > X4, let the deduction value be 0.55; x3 and X4 are preset values.
Further, before the operation of the first step, the following steps are also required to be performed, specifically:
the method comprises the following steps: acquiring all users using the target service, and marking the users as Yi, i-1, n;
step two: the administrator distributes the authority according to the identity of the user, particularly endows corresponding weight values, and sequentially borrows corresponding numerical values from high authority to low authority to sequentially represent from high to low; correspondingly, the identity authority values of different users are marked as Qi, i is 1, i, n, and Qi and Yi are in one-to-one correspondence;
step three: when a user needs to operate service, identity confirmation processing is automatically carried out, and a deduction value Ki is processed according to a confirmation process, wherein i is 1, n; ki corresponds to Qi and Yi one by one;
step four: acquiring the number of threads used by a user in nearly half a month every time, calculating the average value of the threads, and marking the average value as the number of average threads;
step five: acquiring the thread time of each use of a user in nearly half a month, wherein the thread time is specifically the sum of the time of each use of the threads in one use; calculating the average value of the thread duration, and marking the average value as an average line;
step six: when the average mark stroke number and the average mark are obtained, after dimensions are removed, a comprehensive value is calculated, and the specific calculation formula is as follows:
when the integrated value is 0.455 × average mark number +0.545 × average mark;
step seven: a composite usage value is obtained for each user that needs to initiate a service, which is labeled as Zi, i 1.
Further, the air conditioner is provided with a fan,
after the operation of step 6), the following steps are carried out:
deleting users with completely limited target service access from the sequence of Ai from large to small; and sequentially operating the services of the users Yi according to the rest sequence of Ai for the users Yi after the elimination.
The invention has the beneficial effects that:
the method comprises the steps of acquiring a comprehensive utilization value Zi, a deduction value Ki and an identity authority value Qi of a user Yi; calculating the sequence value Xi according to a formula; then acquiring the maximum thread of the target service; then at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users; when the thread is free, continuing to serve the rest users Yi;
meanwhile, the real-time thread number of all users and the accumulated time are calculated, and the accumulated time is specifically represented as the total time of the corresponding user for using the target service; calculating a real-time value by using a formula, and when the real-time value exceeds the comprehensive value of the corresponding user and the difference value is kept to be more than or equal to X2, completely limiting the access of the user; the method and the device can better evaluate the service condition of the user on the target service and provide a reasonable restriction scheme.
Detailed Description
A method for limiting user access service based on thread includes the following steps:
the method comprises the following steps: acquiring all users using the target service, and marking the users as Yi, i-1, n;
step two: the administrator distributes the authority according to the identity of the user, particularly endows corresponding weight values, and sequentially borrows corresponding numerical values from high authority to low authority to sequentially represent from high to low; correspondingly, the identity authority values of different users are marked as Qi, i is 1, i, n, and Qi and Yi are in one-to-one correspondence;
step three: when the user needs to operate the service, the identity confirmation processing can be automatically carried out, and a deduction value is processed according to the confirmation process, and the specific identity confirmation processing steps are as follows:
s1: firstly, acquiring habit data of a user for thirty times before the user logs in, wherein the habit data comprises the interval time between every two keys when the user inputs the keys;
s2: the interval time is marked as Toj, o 1.., 30, j 1.., m; toj denotes the time interval between the jth key and the j +1 th key at the o time;
s3: let j equal 1; obtaining the interval To1, o 1.. and 30;
s4: obtaining an average Tp of the To 1;
s5: calculating the deviation value according to a formula, wherein the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, sequentially according to | To1-TpRemoving the interval value in a mode of increasing the | value to a smaller value;
s7: calculating a deviation value after each removal until the deviation value is less than or equal to X1; x1 is a preset value;
s8: then calculating the average value of the remaining interval time, and marking the value as the time interval Rj, j-1.
S9: repeating steps S3-S9 with j being j +1 to obtain all the asserted intervals, thereby forming an asserted interval group;
s10: acquiring each real-time interval value when the user inputs the secret key, namely acquiring the interval time between the secret keys corresponding to the key input; it is labeled Pj, j 1.·, m;
s11: calculating an approach value by using a formula, specifically:
s12: calibrating a deduction value according to the approach value, and expressing the deduction value of each user as Ki, wherein i is 1. Ki corresponds to Qi and Yi one by one; the specific deduction value calibration mode is as follows:
when approaching the value < X3, let the deduction value be zero;
when the approximate value of X3 is less than or equal to X4, the deduction value is 0.25;
when approaching the value > X4, let the deduction value be 0.55; x3 and X4 are preset values;
step four: acquiring the number of threads used by a user in nearly half a month every time, calculating the average value of the threads, and marking the average value as the number of average threads;
step five: acquiring the thread time of each use of a user in nearly half a month, wherein the thread time is specifically the sum of the time of each use of the threads in one use; calculating the average value of the thread duration, and marking the average value as an average line;
step six: when the average mark stroke number and the average mark are obtained, after dimensions are removed, a comprehensive value is calculated, and the specific calculation formula is as follows:
when the integrated value is 0.455 × average mark number +0.545 × average mark;
step seven: obtaining a comprehensive utilization value of each user needing to initiate service, and marking the comprehensive utilization value as Zi, i-1, n;
step eight: calculating the order value Xi according to a formula, wherein the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
in the formula, 0.481 and 0.519 are preset weights;
step nine: acquiring a maximum thread of a target service;
step ten: at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users;
step eleven: when the thread is free, continuing to serve the rest users Yi;
step twelve: meanwhile, the real-time thread number of all users and the accumulated time are calculated, and the accumulated time is specifically represented as the total time of the corresponding user for using the target service;
step thirteen: and calculating the real-time value by using a formula, wherein the specific calculation formula is as follows:
real-time use value of 0.455 real-time number of threads +0.545 cumulative time;
when the real-time value exceeds the comprehensive value of the corresponding user and the difference value is kept to be more than or equal to X2, X2 is a preset value, and the access of the user is completely limited at the moment;
fourteen steps: deleting the corresponding users from the sequence of Ai from big to small; and sequentially operating the services of the users Yi according to the rest sequence of Ai for the users Yi after the elimination.
A method for limiting a user to access a service based on a thread comprises the steps of firstly obtaining a comprehensive use value Zi, a deduction value Ki and an identity authority value Qi of a user Yi when the method works; calculating the sequence value Xi according to a formula; then acquiring the maximum thread of the target service; then at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users; when the thread is free, continuing to serve the rest users Yi;
meanwhile, the real-time thread number of all users and the accumulated time are calculated, and the accumulated time is specifically represented as the total time of the corresponding user for using the target service; calculating a real-time value by using a formula, and when the real-time value exceeds the comprehensive value of the corresponding user and the difference value is kept to be more than or equal to X2, completely limiting the access of the user; the method and the device can better evaluate the service condition of the user on the target service and provide a reasonable restriction scheme.
The foregoing is merely exemplary and illustrative of the present invention and various modifications, additions and substitutions may be made by those skilled in the art to the specific embodiments described without departing from the scope of the invention as defined in the following claims.
Claims (8)
1. A method for restricting a user from accessing a service based on a thread is characterized by specifically comprising the following steps:
step 1): acquiring a comprehensive value Zi, a deduction value Ki and an identity authority value Qi of a user Yi; calculating the order value Xi according to a formula, wherein the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
in the formula, 0.481 and 0.519 are preset weights;
step 2): acquiring a maximum thread of a target service;
step 3): at the same time, sequentially serving the threads initiated by the user Yi according to the sequence from Ai to Ai, and stopping the subsequent user initiation for serving when the threads run fully, and limiting the access of other users;
step 4): when the thread is free, continuing to serve the rest users Yi;
step 5): meanwhile, the real-time thread number of all users and the accumulated time are calculated, and the accumulated time is specifically represented as the total time of the corresponding user for using the target service;
step 6): calculating a real-time utilization value by using a formula;
and when the real-time value exceeds the comprehensive value of the corresponding user and the difference value is kept to be more than or equal to X2, X2 is a preset value, and the access of the user is completely limited at the moment.
2. The method for restricting user access to services based on threads as claimed in claim 1, wherein the identity confirmation processing step in step three is specifically:
s1: firstly, acquiring habit data of a user for thirty times before the user logs in, wherein the habit data comprises the interval time between every two keys when the user inputs the keys;
s2: the interval time is marked as Toj, o 1.., 30, j 1.., m; toj denotes the time interval between the jth key and the j +1 th key at the o time;
s3: let j equal 1; obtaining the interval To1, o 1.. and 30;
s4: obtaining an average Tp of the To 1;
s5: calculating the deviation value according to a formula, wherein the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, removing the interval value, otherwise, not operating;
s7: then calculating the average value of the remaining interval time, and marking the value as the time interval Rj, j-1.
S8: repeating steps S3-S9 with j being j +1 to obtain all the asserted intervals, thereby forming an asserted interval group;
s9: acquiring each real-time interval value when the user inputs the secret key, namely acquiring the interval time between the secret keys corresponding to the key input; it is labeled Pj, j 1.·, m;
s10: calculating an approach value by using a formula, specifically:
s11: calibrating a deduction value according to the approach value, and expressing the deduction value of each user as Ki, wherein i is 1. Ki corresponds to Qi and Yi one to one.
3. The method for restricting user access to services based on threads as claimed in claim 2, wherein the specific way of calibrating the deduction value according to the proximity value is:
when approaching the value < X3, let the deduction value be zero;
when the approximate value of X3 is less than or equal to X4, the deduction value is 0.25;
when approaching the value > X4, let the deduction value be 0.55; x3 and X4 are preset values.
4. The method according to claim 2, wherein the step S6 of removing the interval value comprises:
in turn according to | To1-TpRemoving the interval value in a mode of increasing the | value to a smaller value;
calculating a deviation value after each removal until the deviation value is less than or equal to X1; x1 is a predetermined value.
5. The method for restricting user access to services based on threads as claimed in claim 1, wherein before performing the operation of the first step, the following steps are further performed, specifically:
the method comprises the following steps: acquiring all users using the target service, and marking the users as Yi, i-1, n;
step two: the administrator distributes the authority according to the identity of the user, particularly endows corresponding weight values, and sequentially borrows corresponding numerical values from high authority to low authority to sequentially represent from high to low; correspondingly, the identity authority values of different users are marked as Qi, i is 1, i, n, and Qi and Yi are in one-to-one correspondence;
step three: when a user needs to operate service, identity confirmation processing is automatically carried out, and a deduction value Ki is processed according to a confirmation process, wherein i is 1, n; ki corresponds to Qi and Yi one by one;
step four: acquiring the number of threads used by a user in nearly half a month every time, calculating the average value of the threads, and marking the average value as the number of average threads;
step five: acquiring the thread time of each use of a user in nearly half a month, wherein the thread time is specifically the sum of the time of each use of the threads in one use; calculating the average value of the thread duration, and marking the average value as an average line;
step six: when the average line stroke number and the average line are obtained, the comprehensive value is calculated after dimensions are removed;
step seven: a composite usage value is obtained for each user that needs to initiate a service, which is labeled as Zi, i 1.
6. The method of claim 1, wherein after the step 6), the following steps are further performed:
deleting users with completely limited target service access from the sequence of Ai from large to small; and sequentially operating the services of the users Yi according to the rest sequence of Ai for the users Yi after the elimination.
7. The method of claim 5, wherein the combined value is calculated by the following formula:
the integrated value is 0.455 average mark number +0.545 average mark.
8. The method of claim 1, wherein the real-time value-based calculation formula is:
real-time value 0.455 real-time number of threads +0.545 accumulated time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110489976.XA CN113127208B (en) | 2021-05-06 | 2021-05-06 | Method for limiting user to access service based on thread |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110489976.XA CN113127208B (en) | 2021-05-06 | 2021-05-06 | Method for limiting user to access service based on thread |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113127208A true CN113127208A (en) | 2021-07-16 |
| CN113127208B CN113127208B (en) | 2023-08-04 |
Family
ID=76781523
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110489976.XA Active CN113127208B (en) | 2021-05-06 | 2021-05-06 | Method for limiting user to access service based on thread |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113127208B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8214446B1 (en) * | 2009-06-04 | 2012-07-03 | Imdb.Com, Inc. | Segmenting access to electronic message boards |
| CN102855293A (en) * | 2012-08-10 | 2013-01-02 | 广东电网公司电力科学研究院 | Mass data processing method of electric vehicle and charging/battery swap facility system |
| CN103516536A (en) * | 2012-06-26 | 2014-01-15 | 重庆新媒农信科技有限公司 | Server service request parallel processing method based on thread number limit and system thereof |
| CN107203715A (en) * | 2016-03-18 | 2017-09-26 | 阿里巴巴集团控股有限公司 | The method and device that execution system is called |
| CN109684066A (en) * | 2018-12-27 | 2019-04-26 | 杭州铭展网络科技有限公司 | A kind of thread scheduling method |
| CN110389838A (en) * | 2019-07-24 | 2019-10-29 | 北京邮电大学 | A kind of Real-Time Scheduling suitable for virtual resource and online migration management-control method |
| US20200204459A1 (en) * | 2018-12-21 | 2020-06-25 | Servicenow, Inc. | Integrated analysis and reclamation of remote service resources |
| CN111538967A (en) * | 2020-05-07 | 2020-08-14 | 安徽龙讯信息科技有限公司 | Data management platform based on information resource library |
| CN112163130A (en) * | 2020-10-28 | 2021-01-01 | 河北时代电子有限公司 | Access processing method for social security data query |
-
2021
- 2021-05-06 CN CN202110489976.XA patent/CN113127208B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8214446B1 (en) * | 2009-06-04 | 2012-07-03 | Imdb.Com, Inc. | Segmenting access to electronic message boards |
| CN103516536A (en) * | 2012-06-26 | 2014-01-15 | 重庆新媒农信科技有限公司 | Server service request parallel processing method based on thread number limit and system thereof |
| CN102855293A (en) * | 2012-08-10 | 2013-01-02 | 广东电网公司电力科学研究院 | Mass data processing method of electric vehicle and charging/battery swap facility system |
| CN107203715A (en) * | 2016-03-18 | 2017-09-26 | 阿里巴巴集团控股有限公司 | The method and device that execution system is called |
| US20200204459A1 (en) * | 2018-12-21 | 2020-06-25 | Servicenow, Inc. | Integrated analysis and reclamation of remote service resources |
| CN109684066A (en) * | 2018-12-27 | 2019-04-26 | 杭州铭展网络科技有限公司 | A kind of thread scheduling method |
| CN110389838A (en) * | 2019-07-24 | 2019-10-29 | 北京邮电大学 | A kind of Real-Time Scheduling suitable for virtual resource and online migration management-control method |
| CN111538967A (en) * | 2020-05-07 | 2020-08-14 | 安徽龙讯信息科技有限公司 | Data management platform based on information resource library |
| CN112163130A (en) * | 2020-10-28 | 2021-01-01 | 河北时代电子有限公司 | Access processing method for social security data query |
Non-Patent Citations (3)
| Title |
|---|
| DIMAKOPOULOU M,ET AL.: "Reliable and efficient performance monitoring in linux", 《IEEE》 * |
| SZÁRNYAS G, ET AL.: "An early look at the LDBC social network benchmark\'s business intelligence workload", 《GRADES-NDA \'18》 * |
| 郭诚欣,等: "基于现代硬件的并行内存排序方法综述", 《计算机学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113127208B (en) | 2023-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111385299B (en) | Multi-mode arbitration system based on time iteration and negative feedback mechanism | |
| CN107247651B (en) | Cloud computing platform monitoring and early warning method and system | |
| CN102541858B (en) | Based on mapping and the data balancing processing method of stipulations, Apparatus and system | |
| CN110555785A (en) | monthly plan safety and stability checking method and system | |
| WO2014094495A1 (en) | Cloud scheduling method and system thereof | |
| CN110933147A (en) | Information technology analysis system based on cloud computing | |
| 谢志强 et al. | Time-selective integrated scheduling algorithm considering the compactness of serial processes | |
| WO2021164265A1 (en) | Crowdsourcing task allocation method and apparatus, and electronic device and storage medium | |
| Mandal et al. | Data oblivious genome variants search on Intel SGX | |
| Ge et al. | Cloud computing task scheduling strategy based on improved differential evolution algorithm | |
| Langhnoja et al. | Multi-objective based integrated task scheduling in cloud computing | |
| CN113127208A (en) | Method for limiting user access service based on thread | |
| CN103218326B (en) | Comprehensive arbiter device | |
| CN104281636A (en) | Concurrent distributed processing method for mass report data | |
| CN105763636B (en) | The selection method and system of optimal host in a kind of distributed system | |
| CN1949177A (en) | Virtual machine system and method of dynamically distributing UPNP equipment | |
| Weerapurage et al. | Parallel vertex cover: A case study in dynamic load balancing | |
| CN113138838B (en) | Virtual machine placement method based on artificial bee colony algorithm | |
| CN111080081B (en) | Power online customer service reception distribution method and system and power online customer service system | |
| CN112529732B (en) | Method and device for controlling charge and discharge of energy storage unit, computer equipment and storage medium | |
| CN102253861A (en) | Method for executing stepwise plug-in computation | |
| CN1819688A (en) | Network layer performance simulation of G3 mobile communication system | |
| CN1223226C (en) | Control and processing method for access probing | |
| Tong et al. | An efficient dynamic load balancing scheme for heterogenous processing system | |
| CN108124763A (en) | A kind of cloud computing resource scheduling method and system based on hybrid rice algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |