CN113127208B - Method for limiting user to access service based on thread - Google Patents
Method for limiting user to access service based on thread Download PDFInfo
- Publication number
- CN113127208B CN113127208B CN202110489976.XA CN202110489976A CN113127208B CN 113127208 B CN113127208 B CN 113127208B CN 202110489976 A CN202110489976 A CN 202110489976A CN 113127208 B CN113127208 B CN 113127208B
- Authority
- CN
- China
- Prior art keywords
- value
- time
- user
- 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.)
- Active
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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a method for limiting a user to access a service based on a thread, which comprises the steps of acquiring all users using a target service; the administrator allocates rights according to the identity of the user, specifically gives corresponding weights, and sequentially borrows corresponding values from high rights to low rights to sequentially represent the values from high to low; correspondingly marking the identity authority values of different users as Qi; the comprehensive utilization value Zi, the buckling value Ki and the identity authority value Qi of the user Yi are obtained; then calculating the sequence value Xi according to a formula; then obtaining the maximum thread of the target service; then at the same time, sequentially servicing the threads initiated by the users Yi according to the sequence from the big to the small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users; and if the thread is free, continuing to serve 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 server service request parallel processing method and system based on thread quantity limitation, the service request parallel processing method and system adopt a control scheme for classifying and processing service requests according to different processing time lengths, limit the upper limit of the thread quantity of the service requests of each class called by the server for parallel processing, so as to avoid the situation that the service requests with long processing time length occupy the threads of the server in a monopoly manner, ensure that part of the threads in the server are always used for parallel processing the service requests with short processing time length, ensure that the distribution balance of the service request processing threads of the server 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 service requests with long processing time length and complicated operation form monopoly occupation on the system resources of the server, thereby improving the reasonable distribution performance of the system resources of the server.
However, for the situation that the thread limits the service of the user, the user does not comprehensively evaluate personal habit, identity and the like of the user, the permission is given, and the service is stopped according to different situations; to solve this problem, a solution is now provided.
Disclosure of Invention
The invention aims to provide a method for limiting user access to services based on threads.
The aim of the invention can be achieved by the following technical scheme:
a method for restricting user access to a service based on threads, the method comprising:
step 1): acquiring a comprehensive value Zi, a buckling value Ki and an identity authority value Qi of a user Yi; according to the formula, the sequence value Ai is calculated, and the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
wherein 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 servicing the threads initiated by the users Yi according to the sequence from big to small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users;
step 4): if the thread is free, continuing to serve the rest users Yi;
step 5): meanwhile, the real-time thread number of all users and the time accumulation time are calculated, wherein the time accumulation time is specifically expressed as the total time of the corresponding user in using the target service at the time;
step 6): the real-time value is calculated by using a formula, and the specific calculation formula is as follows:
real-time value=0.455×real-time number of threads+0.545×current time accumulation;
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 at the moment, the access of the user is completely limited.
Further, the identity confirmation processing step in the third step specifically includes:
s1: firstly, acquiring habit data of a user, which is acquired by the user for thirty times when the user logs in, wherein the habit data comprises interval time between each key when the user inputs the key;
s2: the interval time was marked Toj, o=1,..30, j=1,..m; toj is the time interval between the jth key and the j+1th key at the nth time;
s3: let j=1; the interval time To1, o=1,..30 at this time was obtained;
s4: calculating an average value Tp of To 1;
s5: the deviation value is calculated according to a formula, and the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, the steps are sequentially carried out according to the absolute value T o1 -T p Removing interval values in a mode of large-to-small values;
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: calculating the average value of the remaining interval time, and marking the average value as the identification interval time Rj, j=1, & gt, m;
s9: let j=j+1, repeat steps S3-S9, get all and confirm the interval, form and confirm the interval group;
s10: acquiring each real-time interval value of the user when inputting the key, namely, the interval time between the keys when the user inputs the key; labeled Pj, j=1,..m;
s11: calculating a proximity value by using a formula, specifically:
s12: calibrating the buckling value according to the approach value, and expressing the buckling value of each user as Ki, i=1, & gt, n; ki corresponds to Qi and Yi uniformly.
Further, the specific way of calibrating the buckling value according to the approach value is as follows:
when the approach value is less than X3, the buckling value is set to be zero;
when X3 is less than or equal to the approach value and less than or equal to X4, the buckling value is set to be 0.25;
when the approach value is > X4, the buckling value is set to be 0.55; x3 and X4 are both preset values.
Further, before the operation of the first step, the following steps are further performed, specifically:
step one: all users using the target service were acquired, marked Yi, i=1,..n;
step two: the administrator allocates rights according to the identity of the user, specifically gives corresponding weights, and sequentially borrows corresponding values from high rights to low rights to sequentially represent the values from high to low; correspondingly marking the identity authority values of different users as Qi, wherein i=1, i, n, qi and Yi are in one-to-one correspondence;
step three: when a user needs to run a service, identity confirmation processing is automatically performed, and buckling values Ki, i=1, i, n are processed according to the confirmation process; ki corresponds to Qi and Yi uniformly;
step four: obtaining the thread number of each use of a user in the near half month, calculating the average value of the thread number, and marking the average value as the average thread number;
step five: acquiring the time length of each thread used by a user in the near half month, wherein the time length of each thread is specifically the sum of the time lengths of each thread used in one use process; solving a mean value of the thread time length, and marking the mean value as a mean mark;
step six: when the number of the uniform mark and the uniform mark are obtained, the dimension is removed, and then the comprehensive value is calculated, wherein the specific calculation formula is as follows:
when the combined value=0.455×average number of graticules+0.545×average graticule;
step seven: the composite value for each user that needs to initiate a service is obtained and labeled Zi, i=1.
Further, the method comprises the steps of,
after the operation of step 6) is completed, the following steps are further performed:
deleting the users with complete limitation on the access of the target service from the rank from big to small of Ai; and sequentially operating the services of the users Yi according to the rest sequences of the Ai for the users Yi after the elimination.
The invention has the beneficial effects that:
the comprehensive utilization value Zi, the buckling value Ki and the identity authority value Qi of the user Yi are obtained; then calculating a sequence value Ai according to a formula; then obtaining the maximum thread of the target service; then at the same time, sequentially servicing the threads initiated by the users Yi according to the sequence from the big to the small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users; if the thread is free, continuing to serve the rest users Yi;
meanwhile, the real-time thread number of all users and the time accumulation time are calculated, wherein the time accumulation time is specifically expressed as the total time of the corresponding user in using the target service at the time; calculating a real-time value by using a formula, and completely limiting the access of the user 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; the invention can better evaluate the service condition of the user for the target service and provide a reasonable limiting scheme.
Detailed Description
A method for restricting user access to a service based on threads, the method comprising:
step one: all users using the target service were acquired, marked Yi, i=1,..n;
step two: the administrator allocates rights according to the identity of the user, specifically gives corresponding weights, and sequentially borrows corresponding values from high rights to low rights to sequentially represent the values from high to low; correspondingly marking the identity authority values of different users as Qi, wherein i=1, i, n, qi and Yi are in one-to-one correspondence;
step three: when the user needs to run the service, identity confirmation processing is automatically performed, and a deduction value is processed according to the confirmation process, wherein the specific identity confirmation processing steps are as follows:
s1: firstly, acquiring habit data of a user, which is acquired by the user for thirty times when the user logs in, wherein the habit data comprises interval time between each key when the user inputs the key;
s2: the interval time was marked Toj, o=1,..30, j=1,..m; toj is the time interval between the jth key and the j+1th key at the nth time;
s3: let j=1; the interval time To1, o=1,..30 at this time was obtained;
s4: calculating an average value Tp of To 1;
s5: the deviation value is calculated according to a formula, and the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, the steps are sequentially carried out according to the absolute value T o1 -T p Removing interval values in a mode of large-to-small values;
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: calculating the average value of the remaining interval time, and marking the average value as the identification interval time Rj, j=1, & gt, m;
s9: let j=j+1, repeat steps S3-S9, get all and confirm the interval, form and confirm the interval group;
s10: acquiring each real-time interval value of the user when inputting the key, namely, the interval time between the keys when the user inputs the key; labeled Pj, j=1,..m;
s11: calculating a proximity value by using a formula, specifically:
s12: calibrating the buckling value according to the approach value, and expressing the buckling value of each user as Ki, i=1, & gt, n; ki corresponds to Qi and Yi uniformly; the specific buckling value calibration mode is as follows:
when the approach value is less than X3, the buckling value is set to be zero;
when X3 is less than or equal to the approach value and less than or equal to X4, the buckling value is set to be 0.25;
when the approach value is > X4, the buckling value is set to be 0.55; x3 and X4 are preset values;
step four: obtaining the thread number of each use of a user in the near half month, calculating the average value of the thread number, and marking the average value as the average thread number;
step five: acquiring the time length of each thread used by a user in the near half month, wherein the time length of each thread is specifically the sum of the time lengths of each thread used in one use process; solving a mean value of the thread time length, and marking the mean value as a mean mark;
step six: when the number of the uniform mark and the uniform mark are obtained, the dimension is removed, and then the comprehensive value is calculated, wherein the specific calculation formula is as follows:
when the combined value=0.455×average number of graticules+0.545×average graticule;
step seven: obtaining a comprehensive value of each user needing to initiate service, and marking the comprehensive value as Zi, i=1, & gt, n;
step eight: according to the formula, the sequence value Ai is calculated, and the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
wherein 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 servicing the threads initiated by the users Yi according to the sequence from big to small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users;
step eleven: if the thread is free, continuing to serve the rest users Yi;
step twelve: meanwhile, the real-time thread number of all users and the time accumulation time are calculated, wherein the time accumulation time is specifically expressed as the total time of the corresponding user in using the target service at the time;
step thirteen: the real-time value is calculated by using a formula, and the specific calculation formula is as follows:
real-time value=0.455×real-time number of threads+0.545×current time accumulation;
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;
step fourteen: deleting the corresponding user from the rank of Ai from big to small; and sequentially operating the services of the users Yi according to the rest sequences of the Ai for the users Yi after the elimination.
A method for limiting user access to service based on thread includes obtaining comprehensive utilization value Zi, deduction value Ki and identity authority value Qi of user Yi when working; then calculating a sequence value Ai according to a formula; then obtaining the maximum thread of the target service; then at the same time, sequentially servicing the threads initiated by the users Yi according to the sequence from the big to the small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users; if the thread is free, continuing to serve the rest users Yi;
meanwhile, the real-time thread number of all users and the time accumulation time are calculated, wherein the time accumulation time is specifically expressed as the total time of the corresponding user in using the target service at the time; calculating a real-time value by using a formula, and completely limiting the access of the user 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; the invention can better evaluate the service condition of the user for the target service and provide a reasonable limiting scheme.
The foregoing is merely illustrative of the structures of this invention and various modifications, additions and substitutions for those skilled in the art can be made to the described embodiments without departing from the scope of the invention or from the scope of the invention as defined in the accompanying claims.
Claims (1)
1. A method for restricting user access to a service based on threads, the method comprising:
step one: all users using the target service were acquired, marked Yi, i=1,..n;
step two: the administrator allocates rights according to the identity of the user, specifically gives corresponding weights, and sequentially borrows corresponding values from high rights to low rights to sequentially represent the values from high to low; correspondingly marking the identity authority values of different users as Qi, wherein i=1, i is in one-to-one correspondence with Yi;
step three: when the user needs to run the service, identity confirmation processing is automatically performed, and a deduction value is processed according to the confirmation process, wherein the specific identity confirmation processing steps are as follows:
s1: firstly, acquiring habit data of a user, which is acquired by the user for thirty times when the user logs in, wherein the habit data comprises interval time between each key when the user inputs the key;
s2: the interval time was marked Toj, o=1,..30, j=1,..m; toj is the time interval between the jth key and the j+1th key at the nth time;
s3: let j=1; the interval time To1, o=1,..30 at this time was obtained;
s4: calculating an average value Tp of To 1;
s5: the deviation value is calculated according to a formula, and the specific calculation mode is as follows:
s6: when the deviation value is larger than X1, the steps are sequentially carried out according to the absolute value T o1 -T p Removing interval values in a mode of large-to-small values; calculating a deviation value after each removal until the deviation value is less than or equal to X1; x1 is a preset numberA value;
s7: calculating the average value of the remaining interval time, and marking the average value as the identification interval time Rj, j=1, & gt, m;
s8: let j=j+1, repeat steps S3-S8 until all the identification intervals are obtained, forming an identification interval group;
s9: acquiring each real-time interval value of the user when inputting the key, namely, the interval time between the keys when the user inputs the key; labeled Pj, j=1,..m;
s10: calculating a proximity value by using a formula, specifically:
s11: calibrating the buckling value according to the approach value, and expressing the buckling value of each user as Ki, i=1, & gt, n; ki corresponds to Qi and Yi uniformly; the specific buckling value calibration mode is as follows:
when the approach value is less than X3, the buckling value is set to be zero;
when X3 is less than or equal to the approach value and less than or equal to X4, the buckling value is set to be 0.25;
when the approach value is > X4, the buckling value is set to be 0.55; x3 and X4 are preset values;
step four: obtaining the thread number of each use of a user in the near half month, calculating the average value of the thread number, and marking the average value as the average thread number;
step five: acquiring the time length of each thread used by a user in the near half month, wherein the time length of each thread is specifically the sum of the time lengths of each thread used in one use process; solving a mean value of the thread time length, and marking the mean value as a mean mark;
step six: when the number of the uniform mark and the uniform mark are obtained, the dimension is removed, and then the comprehensive value is calculated, wherein the specific calculation formula of the comprehensive value is as follows:
when the combined value=0.455×average number of graticules+0.545×average graticule;
step seven: obtaining a comprehensive value of each user needing to initiate service, and marking the comprehensive value as Zi, i=1, & gt, n;
step eight: acquiring a comprehensive value Zi, a buckling value Ki and an identity authority value Qi of a user Yi; according to the formula, the sequence value Ai is calculated, and the specific calculation formula is as follows:
Ai＝(0.481/Zi+0.519*Qi)*(1-Ki)；
wherein 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 servicing the threads initiated by the users Yi according to the sequence from big to small of Ai, stopping servicing the subsequent user initiation when the threads run full, and limiting the access of other users;
step eleven: if the thread is free, continuing to serve the rest users Yi;
step twelve: meanwhile, the real-time thread number of all users and the time accumulation time are calculated, wherein the time accumulation time is specifically expressed as the total time of the corresponding user in using the target service at the time;
step thirteen: the real-time value is calculated by using a formula, and the specific calculation formula is as follows:
real-time value=0.455×real-time number of threads+0.545×current time accumulation;
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;
step fourteen: deleting the users with complete limitation on the access of the target service from the rank from big to small of Ai; and sequentially operating the services of the users Yi according to the rest sequences of the Ai for the users Yi after the elimination.
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 CN113127208A (en) | 2021-07-16 |
| CN113127208B true 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 (8)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10785126B2 (en) * | 2018-12-21 | 2020-09-22 | Servicenow, Inc. | Integrated analysis and reclamation of remote service resources |
-
2021
- 2021-05-06 CN CN202110489976.XA patent/CN113127208B/en active Active
Patent Citations (8)
| 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 |
| 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 |
|---|
| Reliable and efficient performance monitoring in linux;Dimakopoulou M,et al.;《IEEE》;全文 * |
| Szárnyas G, et al..An early look at the LDBC social network benchmark's business intelligence workload.《GRADES-NDA '18》.2018,全文. * |
| 基于现代硬件的并行内存排序方法综述;郭诚欣,等;《计算机学报》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113127208A (en) | 2021-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10401840B2 (en) | Method and system for scheduling parallel processing machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm | |
| CN111385299B (en) | Multi-mode arbitration system based on time iteration and negative feedback mechanism | |
| US20160337442A1 (en) | Scheduled network communication for efficient re-partitioning of data | |
| CN103677960B (en) | Game resetting method for virtual machines capable of controlling energy consumption | |
| CN113127208B (en) | Method for limiting user to access service based on thread | |
| CN116993135B (en) | Multi-stage sequencing and reservation scheduling method and device based on waiting time constraint | |
| Ge et al. | Cloud computing task scheduling strategy based on improved differential evolution algorithm | |
| CN104199738B (en) | A kind of more data processing equipment collaboration working methods and system | |
| CN114037251A (en) | Manufacturing system cost minimization resource allocation method based on Petri network | |
| CN106326005A (en) | Automatic parameter tuning method for iterative MapReduce operation | |
| CN109189808A (en) | Data query method and relevant device | |
| CN104915250B (en) | It is a kind of to realize the method for making MapReduce data localization in the industry | |
| Weerapurage et al. | Parallel vertex cover: A case study in dynamic load balancing | |
| Li et al. | Real-time edge repartitioning for dynamic graph | |
| CN104573482A (en) | Method for generating user name and password in batch based on Random according to user-defined rule | |
| JP7058723B2 (en) | Sequentially embedded statistical analysis of multidimensional tolerance limits | |
| Zhao et al. | A secure alignment algorithm for mapping short reads to human genome | |
| CN112256427A (en) | Large-scale resource rapid allocation device based on improved branch limit method | |
| CN1223226C (en) | Control and processing method for access probing | |
| Jin et al. | Fast Search of Lightweight Block Cipher Primitives via Swarm-like Metaheuristics for Cyber Security | |
| CN112685418B (en) | Method and system for realizing intelligent scheduling charging engine | |
| Jo | Multi-threading the generation of Burrows-Wheeler Alignment | |
| CN111478348B (en) | Three-phase load balancing method and device, electronic equipment and readable storage medium | |
| CN108124763A (en) | A kind of cloud computing resource scheduling method and system based on hybrid rice algorithm | |
| CN104965795B (en) | The distribution method in embedded system static memory pond |
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 |