Resource scheduling method and device
Through the appointment application of the resource demander and the early response mechanism of the resource holder, resource scheduling is optimized, the problem of resource demander's inability to obtain resources and idle resources in a timely manner, and the efficiency of resource use is improved.
Patent Information
- Application Number
- CN202110969058.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2018-07-03
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2038-07-03
AI Technical Summary
The existing resource scheduling methods cause resource demanders to fail to obtain resources in time when system failure or processing capabilities are limited, and may cause resources to be idle when resources are sufficient.
Provide a resource scheduling method, allowing the resource demander to apply for resources in advance by appointment, and the resource holder responds to the application in advance when resources are sufficient, and generates allocation plans to meet urgent needs first, and utilizes dispatchable resources under preset circumstances. The margin responds to the appointment application.
It reduces the burden of responding to resource applications in real time, reduces the situation where resource demanders cannot obtain resources in a timely manner, and reduces idle resources when resources are sufficient, improving resource utilization efficiency.
Smart Images

Figure CN113723641B_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present specification relate to the field of computer technology, and in particular, to a resource scheduling method and device. Background Art
[0002] Resource scheduling is a common concept in the field of computer technology. In a broad sense, it refers to the switching of resource ownership or usage rights between different entities. A typical example is that a resource holder allocates its own resources to multiple resource demanders. The roles of resource holders and resource demanders can be relatively fixed, such as the operating system allocating processing threads or memory resources to different applications, and network management equipment allocating bandwidth resources to different network access devices; or they can be dynamically converted, such as in a peer-to-peer network, any node can become both a resource holder and a resource demander.
[0003] At present, the common resource scheduling method is that the resource demander initiates an application to the resource holder on demand, and the resource holder responds to the application in real time and allocates resources to the corresponding resource demander. However, in actual applications, the resource demander may not be able to obtain resources in time due to system failures, limited processing capacity, etc., thus affecting the normal use of the resource demander. In addition, when the resource holder has sufficient resources, this on-demand allocation method may also cause resources to be idle. Summary of the invention
[0004] In view of the above technical problems, the embodiments of this specification provide a resource scheduling method and device, and the technical solution is as follows:
[0005] According to a first aspect of an embodiment of this specification, a resource scheduling method is provided, the method comprising:
[0006] Determine the total amount of resources currently available for dispatch by the resource holder;
[0007] Determine a set of pending applications, wherein members of the set are: resource reservation applications initiated to the resource holder and for which responses have not yet been completed;
[0008] Determine the urgency of the resource needs of the members of the group according to the preset rules;
[0009] Generate an allocation plan for the total amount of schedulable resources; wherein the allocation priority is positively correlated with the determined urgency of the demand; the allocation plan specifically includes: giving priority to fully responding to the number of resources for reservation applications with high urgency of demand, and under preset circumstances, continuing to search for reservation applications that can be fully responded to using the schedulable resource surplus according to the allocation priority, and if so, adding a full response to the reservation application using the surplus in the allocation plan;
[0010] According to the generated allocation plan, the total amount of currently schedulable resources of the resource holder is scheduled.
[0011] According to a second aspect of the embodiments of this specification, a loan repayment processing method is provided, the method comprising:
[0012] Determine the borrower's current total available repayment amount;
[0013] Determining the outstanding amount of the borrower;
[0014] sorting the outstanding payments according to their repayment dates;
[0015] Generate a repayment allocation plan for the total available repayment amount; wherein the repayment is allocated preferentially to the outstanding repayments with earlier repayment dates; the repayment allocation plan specifically includes: giving priority to the full repayment of the outstanding repayments with earlier repayment dates, and, under preset circumstances, continuing to search for outstanding repayments that can be fully repaid using the available repayment balance according to the allocated priority, and if so, adding the full repayment of the outstanding repayments using the repayment balance to the allocation plan;
[0016] According to the generated repayment allocation plan, repayment is processed for the total available repayment amount.
[0017] According to a third aspect of an embodiment of this specification, a resource scheduling device is provided, the device comprising:
[0018] A scheduling total amount determination unit, used to determine the current total amount of schedulable resources of the resource holder;
[0019] The scheduling object determination unit is used to determine a set of applications to be responded to, wherein the members of the set are: resource reservation applications initiated to the resource holder and not yet responded to;
[0020] A demand assessment unit, used to determine the urgency of the resource needs of the collection members according to preset rules;
[0021] An allocation plan generating unit is used to generate an allocation plan for the total amount of schedulable resources; wherein the allocation priority is positively correlated with the determined urgency of the demand; the allocation plan is specifically: giving priority to fully responding to the number of resources for reservation applications with high urgency, and under preset circumstances, according to the allocation priority, continuing to search whether there is a reservation application that can be fully responded to using the available resource surplus, and if so, adding a full response to the reservation application using the surplus in the allocation plan;
[0022] The scheduling execution unit is used to schedule the total amount of currently schedulable resources of the resource holder according to the generated allocation plan.
[0023] According to a fourth aspect of the embodiments of this specification, a loan repayment processing device is provided, the device comprising:
[0024] A total repayment amount determination unit, used to determine the current total repayment amount available to the borrower;
[0025] A bandwidth scheduling object determination unit, used to determine the amount to be repaid by the borrowing user;
[0026] A demand assessment unit, used for sorting the outstanding payments according to their repayment dates;
[0027] An allocation scheme generating unit is used to generate a repayment allocation scheme for the total available repayment amount; wherein the repayment is allocated preferentially to the outstanding repayments with earlier repayment dates; the repayment allocation scheme is specifically: giving priority to the full repayment of the outstanding repayments with earlier repayment dates, and under preset circumstances, according to the allocated priority, continuing to search for outstanding repayments that can be fully repaid using the available repayment balance, and if so, adding the full repayment of the outstanding repayment using the repayment balance to the allocation scheme;
[0028] The repayment processing execution unit is used to perform repayment processing on the total available repayment amount according to the generated repayment allocation plan.
[0029] The technical solution provided in the embodiments of this specification allows the resource demander to apply for resources from the resource holder in advance by appointment, and the resource holder can respond to the resource holder's application in advance when the resources are sufficient. On the one hand, this leaves sufficient processing time for resource scheduling, reduces the burden of real-time response to resource applications, and thus reduces the situation where the resource demander cannot obtain resources in time; on the other hand, when the resource holder has sufficient resources, the resources can also be scheduled to the corresponding resource demander in advance, so that the resource demander can use the resources in advance, thereby reducing the phenomenon of idle resources.
[0030] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the embodiments of the present specification.
[0031] In addition, any embodiment in the embodiments of this specification does not need to achieve all the above-mentioned effects. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the embodiments of this specification. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.
[0033] Figure 1 is a flowchart of a resource scheduling method according to an embodiment of this specification;
[0034] Figure 2a to Figure 2c This is a schematic diagram of the loan business application interface of the embodiment of this specification;
[0035] Figure 3 is a schematic diagram of the structure of a resource scheduling device according to an embodiment of this specification;
[0036] Figure 4 It is a structural diagram of a device used to configure the embodiment of the present specification. DETAILED DESCRIPTION
[0037] In order to enable those skilled in the art to better understand the technical solutions in the embodiments of this specification, the technical solutions in the embodiments of this specification will be described in detail below in conjunction with the drawings in the embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this specification, not all of them. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field should fall within the scope of protection of the embodiments of this specification.
[0038] According to the resource scheduling method described in the background technology, the resource demander only applies to the resource holder when it needs to use the resource. In return, the resource holder also needs to respond to the application immediately, otherwise it will affect the normal use of the resource demander. This "on-demand application, on-demand response" method will cause the resource demander to be unable to obtain resources in time if there is a system failure or limited processing capacity during the application or response stage, thus affecting normal use.
[0039] In response to the above technical issues, the resource scheduling solution provided in this specification is: allowing resource demanders to apply for resources in advance from resource holders by appointment. Accordingly, resource holders can respond to their applications in advance if resources are sufficient.
[0040] For the convenience of description, in this specification, it is stipulated that in a specific resource scheduling transaction, there is one resource holder x and at least one resource demander.
[0041] Assume that at the statistical time T0, there is at least one pending application y1, y2, y3, ..., yn, where the pending application specifically refers to a resource reservation application initiated to the resource holder x and for which the response has not yet been completed.
[0042] Among them, resource reservation application refers to: a resource application issued by a resource demander before time T. It is understandable that the actual use time of the resource by the resource demander is also allowed to be later than T. Generally, the resource demand quantity will be specified in the reservation application. Of course, there may also be a default resource demand quantity, or the resource holder can know the requested resource quantity in other ways. In addition, any two different applications can be issued by the same resource demander or by different resource demanders, and this specification does not limit this.
[0043] Based on the above description, this specification provides a resource scheduling method, see Figure 1 As shown, the method may include the following steps:
[0044] S101, determining the total amount of schedulable resources currently available to the resource holder;
[0045] According to the above description, for any resource holder x, as long as it has schedulable resources, the resource scheduling method of this specification can be triggered. It should be noted that "schedulable resources" are not necessarily equivalent to all idle resources of the resource holder, and this specification does not limit the definition of "schedulable resources".
[0046] In practical applications, the resource scheduling method of this specification may be triggered after monitoring that the total amount of schedulable resources is greater than 0, or the resource scheduling method of this specification may be triggered after the total amount of schedulable resources is greater than a certain threshold.
[0047] In a specific implementation, the total amount of schedulable resources may also be manually specified by the user. For example, an interactive component may be displayed on the user terminal for the user to manually input the total amount of schedulable resources, and the total amount of schedulable resources may be further determined based on the user input value.
[0048] S102, determining a set of applications to be responded to;
[0049] The current time after determining the total amount of schedulable resources is T0, and the set of pending applications corresponding to time T0 is determined. The pending application set here refers to: a set consisting of pending applications y1, y2, y3...yn, where any one of y1, y2, y3...yn is a resource reservation application initiated to the resource holder x and has not yet completed the response.
[0050] S103, determining the urgency of the resource demand of the set members according to preset rules;
[0051] According to the previous description, using resource reservation application means that the resource demander is not in a hurry to use the resources. Another meaning is that the resource demander needs to use the requested resources at a certain time Tf in the future. If there is still no response after Tf, it will affect the normal use of the resource demander.
[0052] Assume that for any member yi in the set of pending applications, there is a corresponding response deadline Tf i , we can use (Tf i -T0) to characterize the urgency of yi's demand for resources, that is: i The closer to the current moment, the more urgent the need for resources. It is understandable that in actual application, we can directly follow Tf i Determine the order of urgency of needs from small to large.
[0053] In a specific implementation, when a resource demander initiates a reservation application, in addition to specifying the resource demand quantity, he or she will also specify the response deadline for the reservation application. The meaning of this response deadline is that a full response to this application should be completed before this time at the latest (otherwise it will affect normal use). In this case, the urgency of the resource demand of the set member can be directly determined based on the reservation application response deadline corresponding to the set member.
[0054] In another specific implementation, if the resource demander does not specify a response deadline for the reservation application when initiating the reservation application, the urgency of the resource demand of the group members can be determined directly according to the order in which the group members respond to the reservation application. That is, if no response time is required, it is considered that the earlier the application is issued, the more urgent the resource demand is.
[0055] If the set includes both appointment requests with specified response deadlines and appointment requests without specified response deadlines, the order of resource demand urgency from high to low is: priority is given to the requests based on Tf i The applications are sorted in the order of their submission date and then in the order of their submission date.
[0056] S104, generating an allocation plan for the total amount of schedulable resources;
[0057] The generated allocation plan should at least include the following: which resource reservation applications can be responded to in this scheduling, and the number of resources that can be allocated to the responded set members. Of course, other content can also be added according to actual needs, such as the resource demander identification, etc. This manual does not limit this.
[0058] When generating an allocation plan, it should be ensured that the allocation priority is positively correlated with the urgency of the demand determined by S103, that is, priority should be given to responding to the resource reservation application with the highest demand. If there is still schedulable resource surplus after the response is completed, then continue to respond to the resource reservation application with the second highest demand, and so on.
[0059] In actual applications, the response to a resource reservation request may include a complete response and a partial response, where:
[0060] Full response: For an application with a resource quantity of M, the response must be completed in one go;
[0061] Partial response: For an application with a resource quantity of M, it can be completed in multiple responses, that is, the number of resources scheduled for each response can be less than M.
[0062] When generating allocation plans, priority should be given to fully responding to the number of resources required for appointments with high urgency.
[0063] According to actual application requirements, if partial responses to resource reservation requests are allowed, when generating an allocation plan, the last resource reservation request that is responded to may be allocated less than the total amount of resources requested according to the allocation priority. And the remaining schedulable resources after allocation must be 0.
[0064] If partial response to the resource quantity requested for resource reservation is not allowed, then when generating the allocation plan, the schedulable resource margin after the allocation is completed may not be 0. Different strategies can be used to handle this margin, for example:
[0065] The surplus will not be allocated in this dispatch, but can be retained for the next dispatch;
[0066] According to the allocation priority, continue to search whether there is a resource reservation application that can be fully responded to using the above margin. If so, add a plan to fully respond to the application using the margin in the allocation plan. It can be understood that this method actually gives priority to responding to applications that are not the most urgent, so it is generally suitable for applications that do not have a clear requirement for the response deadline. Of course, this specification does not limit this.
[0067] The method of handling the surplus can also be dynamically determined according to the urgency of the demand for the applications that cannot be responded to by this scheduling. For example, if (Tf i -T0) is not lower than the preset threshold, that is, there is no "particularly urgent" application, then priority response is allowed to applications that are not the most urgent, otherwise the surplus is reserved.
[0068] Of course, operation options may also be provided to the user, allowing the user to determine how to handle the surplus.
[0069] The above allocation scheme generation method is only for illustrative purposes and should not be construed as a limitation on the scheme of this specification.
[0070] S105: Scheduling the total amount of currently schedulable resources of the resource holder according to the generated allocation plan.
[0071] In actual applications, after the allocation plan is generated, the allocation plan can be displayed and output, and an interactive component can be provided for the user to manually adjust the allocation plan.
[0072] After the allocation plan is generated, the specific scheduling implementation is irrelevant to the solution in this specification and will not be described in detail in the embodiments.
[0073] It can be seen that the application of the above technical solution allows resource demanders to apply for resources from resource holders in advance by appointment, and resource holders can respond to resource holders' applications in advance when resources are sufficient. This, on the one hand, leaves sufficient processing time for resource scheduling, reduces the burden of real-time response to resource applications, and thus reduces the situation where resource demanders cannot obtain resources in a timely manner; on the other hand, when resource holders have sufficient resources, they can also schedule resources to corresponding resource demanders in advance, so that resource demanders can use resources in advance, thereby reducing the phenomenon of idle resources.
[0074] Moreover, from the perspective of user operation, since the most appropriate resource reservation application can be automatically matched for response, the trouble of manual calculation and selection by users can be avoided. Especially for the situation where there are a large number of applications to be responded and the resource values are difficult to calculate, the convenience and accuracy of operation can be significantly improved.
[0075] The following is an explanation of this application scheme in combination with some specific application scenarios:
[0076] Embodiment 1:
[0077] In an operating system that supports scheduled tasks, each application can apply for the processing threads it needs to run in advance. The default settings are: each application initiates a thread reservation application to the operating system 60 seconds before the scheduled execution time, does not specify a response deadline for the reservation application, and only allows a full response to the application (no partial response is allowed).
[0078] Assume that at a certain time T, the operating system obtains a total of 20 schedulable threads; by querying the pending reservation application records, it is found that there are currently three applications A, B, and C that have successively initiated thread reservation applications to the operating system. The application status is as follows:
[0079] Application A: Apply for 5 processing threads;
[0080] Application B: applies for 10 processing threads;
[0081] Application C: applies for 8 processing threads;
[0082] Since no response deadline is specified for each application, the urgency of the demand is determined based on the order in which the applications are initiated: A>B>C, and the allocation plan is further generated as follows:
[0083] app Number of appointment application threads The actual number of threads allocated A 5 5 B 10 10
[0084] The total number of schedulable threads is 20. Since the regulations only allow full response to applications, after allocating threads to A and B in order of urgency, the remaining number of schedulable threads is 5, which is not enough to fully respond to C (the number of application threads is 8). Therefore, the number of threads actually allocated in this scheduling is 15.
[0085] Embodiment 2:
[0086] In the integrated business system, different servers have different update times for business data, and the traffic to the business server will surge immediately after the business data is updated. Therefore, it is necessary to allocate sufficient additional access bandwidth to each server before the update time. The default settings are: each server can initiate a bandwidth reservation application to the bandwidth resource management device at any time, specify the response deadline (data update time) for the reservation application, and allow partial response to the application.
[0087] Assume that at a certain time T=6:00, the operating system obtains a total of 120M of schedulable bandwidth. By querying the pending reservation application records, it is found that there are currently three servers A, B, and C that have initiated bandwidth reservation applications to the bandwidth resource management device. The number of resources applied for is as follows:
[0088] Server A: Apply for 40M bandwidth, response deadline 9:00;
[0089] Server B: Request 50M bandwidth, response deadline 8:30;
[0090] Server C: Request 60M bandwidth, response deadline 8:00;
[0091] Since each application has a specified response deadline, the urgency of the demand is determined from near to far based on the application response deadline: C>B>A, and the allocation plan is further generated as follows:
[0092] server The amount of bandwidth to be reserved The actual amount of allocated bandwidth Unresponsive part C 60 60 0 B 50 50 0 A 40 10 30
[0093] The total amount of schedulable bandwidth is 120. Since the regulations allow partial responses to requests, after allocating bandwidth to C and B in order of urgency, the remaining schedulable bandwidth is 10. Although it is not enough to fully respond to A (the requested bandwidth is 40), it is still possible to partially respond to A. After this scheduling is completed, the unresponded portion of server A's request becomes 30, and the response deadline remains unchanged.
[0094] Embodiment 3:
[0095] This application scheme can also be applied to the allocation of financial resources. For example, in the case of lending business, loans generally have a certain term, such as 3, 6, or 12 months to pay off. Since loans generate interest, many loan platforms allow borrowers to repay in advance, that is, they can repay all or part of the outstanding amount in advance before the repayment period, thereby reducing the amount of interest to be paid.
[0096] For a borrower, multiple loans may be borrowed, each with a repayment deadline. Therefore, it can be considered that the lender (which may be one or more, irrelevant to the implementation of the solution) has initiated a resource reservation application (requiring repayment) to the borrower, and specified a response deadline for the reservation application (requiring repayment before the repayment deadline), allowing partial responses (partial repayment is allowed for "early repayment").
[0097] It is understandable that in the application scenario of lending business, the specific amount of repayment is not fixed, but will change dynamically with the repayment time point, that is, the earlier the repayment, the less interest you need to pay. However, since most lending businesses are calculated on a daily basis, the actual amount of repayment required at a certain statistical time T can still be determined.
[0098] Assume that a borrower has multiple payments to repay. One day, the user earns an income and wants to use the income to repay part of the payment. According to the implementation scheme of the existing technology, the user can only manually select several payments from the list of payments to be repaid based on the current total available repayment amount. During the selection process, the user needs to comprehensively consider issues such as the amount and term. The operation is very inconvenient and it is inevitable that wrong selections will occur.
[0099] The application of this application solution can effectively solve the above problems:
[0100] First, an input window of "total available repayment amount" is provided for the borrowing user, and the current total available repayment amount of the borrowing user is determined according to the input number of the user;
[0101] Determine a list of outstanding payments for the borrower user, and sort the outstanding payments in the list according to their repayment dates;
[0102] Generate a repayment allocation plan for the total available repayment amount, with the principle that repayments are allocated to outstanding payments with earlier repayment dates in priority; the allocation plan may at least include: outstanding payments that can be repaid this time, and the amount of repayments allocated to outstanding payments this time;
[0103] After the allocation plan is generated, the allocation plan can be output and displayed to the user, and the user can also be allowed to modify the automatically generated allocation plan. Furthermore, the principal amount and interest amount corresponding to the total repayment amount can be displayed; or, for any amount of repayment to be repaid, the principal amount and interest amount corresponding to the total repayment amount can be specifically displayed.
[0104] Figure 2a to Figure 2c The figure shows an interface diagram of the "early repayment of principal" function in a lending business application implemented by applying the solution of this specification.
[0105] exist Figure 2a In the interface shown, users can fill in the total amount they want to pay in the "early repayment" area;
[0106] exist Figure 2b In the interface shown, the "early repayment" amount filled in by the user is 40,000. It can be seen that 3 repayable amounts have been automatically selected from the 18 outstanding amounts for the user based on the repayment period from near to far, and the third amount is shown as partially repaid. The user can manually modify the allocation result.
[0107] exist Figure 2c The interface shown shows the user that out of the total repayment amount of 40,000, 39,800 will be used to repay the principal and 200 will be used to repay the interest. After the user clicks the "OK" button, the repayment operation will be executed according to the above plan.
[0108] It can be seen that after applying the solution provided in this manual, the user only needs to manually enter the total repayment amount, and the system can automatically determine which outstanding payments should be allocated to, which effectively improves the convenience of user operation and avoids errors caused by manual selection by the user.
[0109] Corresponding to the above method embodiment, this specification embodiment also provides a resource scheduling device, see Figure 3 As shown, the device may include:
[0110] The scheduling total amount determination unit 110 is used to determine the current total amount of schedulable resources of the resource holder;
[0111] The scheduling object determination unit 120 is used to determine a set of pending response applications, wherein the members of the set are: resource reservation applications initiated to the resource holder and not yet responded to;
[0112] The demand assessment unit 130 is used to determine the urgency of the demand for resources of the set members according to preset rules;
[0113] The allocation scheme generating unit 140 is used to generate an allocation scheme for the total amount of schedulable resources, and the allocation scheme may include: the set member identifiers that can respond to this scheduling, and the number of resources that can be allocated to the responded set members; wherein the allocation priority is positively correlated with the determined urgency of the demand;
[0114] The scheduling execution unit 150 is used to schedule the total amount of schedulable resources currently held by the resource holder according to the generated allocation plan.
[0115] In a specific implementation manner provided in this specification, the scheduling total amount determination unit may be specifically used to:
[0116] An interactive component is provided for the user to manually input the total amount of schedulable resources, and the total amount of schedulable resources is determined according to the user input value.
[0117] In a specific implementation manner provided in this specification, the demand assessment unit may be specifically used for:
[0118] Determine the urgency of the group members' need for resources based on the order in which they make their appointment applications.
[0119] In a specific implementation mode provided in this specification, when initiating a resource reservation application, a resource demander specifies a response deadline for this reservation application;
[0120] Accordingly, the demand assessment unit may be specifically used to determine the urgency of the demand for resources by the set members according to the reservation application response deadline corresponding to the set members.
[0121] In a specific implementation provided in this specification, the allocation plan includes a full response and a partial response to the number of resources requested by any member for reservation, and the allocation plan gives priority to satisfying the full response to the number of resources requested for reservations with a high degree of urgency.
[0122] In a specific implementation manner provided in this specification, the allocation scheme generating unit is further used to:
[0123] After the allocation plan is generated, the allocation plan is displayed and an interactive component is provided for the user to manually adjust the allocation plan.
[0124] This specification also provides a loan repayment processing device, which may include:
[0125] A total repayment amount determination unit, used to determine the current total repayment amount available to the borrower;
[0126] A bandwidth scheduling object determination unit, used to determine the amount to be repaid by the borrowing user;
[0127] A demand assessment unit for sorting the outstanding payments according to their repayment dates;
[0128] An allocation plan generating unit is used to generate a repayment allocation plan for the total available repayment amount, wherein the repayment allocation plan may include: the amount of outstanding repayments that can be repaid this time, and the amount of repayments allocated for the outstanding repayments this time; wherein the repayments are allocated preferentially to the outstanding repayments with earlier repayment dates;
[0129] The repayment processing execution unit is used to perform repayment processing on the total available repayment amount according to the generated repayment allocation plan.
[0130] The above-mentioned loan repayment processing device can actually be understood as a specific application of the above-mentioned resource scheduling device in the lending business scenario. Therefore, the specific structure and other functional implementations of the loan repayment processing device can be found in Figure 3 The description of the aforementioned embodiments will not be repeated here.
[0131] The embodiments of the present specification also provide a computer device, which includes at least a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the aforementioned resource scheduling method or loan repayment processing method when executing the program.
[0132] Figure 4 A more specific hardware structure diagram of a computing device provided in an embodiment of this specification is shown, and the device may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other through the bus 1050 in the device.
[0133] The processor 1010 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.
[0134] The memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 may store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program codes are stored in the memory 1020 and are called and executed by the processor 1010.
[0135] The input / output interface 1030 is used to connect the input / output module to realize information input and output. The input / output module can be configured in the device as a component (not shown in the figure), or it can be externally connected to the device to provide corresponding functions. The input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, etc.
[0136] The communication interface 1040 is used to connect a communication module (not shown) to realize communication interaction between the device and other devices. The communication module can realize communication through a wired mode (such as USB, network cable, etc.) or a wireless mode (such as mobile network, WIFI, Bluetooth, etc.).
[0137] The bus 1050 includes a path that transmits information between the various components of the device (eg, the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040).
[0138] It should be noted that, although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040 and the bus 1050, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, it can be understood by those skilled in the art that the above device may also only include the components necessary for implementing the embodiments of the present specification, and does not necessarily include all the components shown in the figure.
[0139] The embodiments of this specification also provide a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the aforementioned resource scheduling method or loan repayment processing method is implemented.
[0140] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0141] It can be known from the above description of the implementation mode that the technicians in this field can clearly understand that the embodiments of this specification can be implemented by means of software plus the necessary general hardware platform. Based on such an understanding, the technical solution of the embodiments of this specification can be essentially or the part that contributes to the prior art can be embodied in the form of a software product, which can be stored in a storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments of this specification.
[0142] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email transceiver, a game console, a tablet computer, a wearable device or a combination of any of these devices.
[0143] Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. The device embodiment described above is merely schematic, wherein the modules described as separate components may or may not be physically separated, and the functions of each module can be implemented in the same one or more software and / or hardware when implementing the embodiment scheme of this specification. It is also possible to select some or all of the modules according to actual needs to achieve the purpose of the embodiment scheme. A person of ordinary skill in the art can understand and implement it without paying creative labor.
[0144] The above is only a specific implementation of the embodiments of this specification. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the embodiments of this specification. These improvements and modifications should also be regarded as the protection scope of the embodiments of this specification.
Claims
1. A resource scheduling method, the method comprising: Determine the total amount of resources currently available for dispatch by the resource holder; Determine a set of pending applications, wherein members of the set are: resource reservation applications initiated to the resource holder and for which responses have not yet been completed; Determine the urgency of the resource needs of the members of the group according to the preset rules; Generate an allocation plan for the total amount of schedulable resources; wherein the allocation priority is positively correlated with the determined urgency of the demand; the allocation plan specifically includes: giving priority to fully responding to the number of resources for reservation applications with high urgency of demand, and under preset circumstances, continuing to search for reservation applications that can be fully responded to using the schedulable resource surplus according to the allocation priority, and if so, adding a full response to the reservation application using the surplus in the allocation plan; According to the generated allocation plan, the total amount of currently schedulable resources of the resource holder is scheduled.
2. According to the method of claim 1, the preset situation comprises: The remaining schedulable resources after allocation is not zero; and / or There are no appointment requests with a high degree of urgency among the remaining unresponded appointment requests.
3. The method according to claim 1, wherein the preset condition comprises: There are no appointment requests with a high degree of urgency among the remaining unresponded appointment requests; The method further comprises: If there is a reservation application with a high urgency degree among the remaining unresponded reservation applications, a partial response to the reservation application using the surplus is added to the allocation plan.
4. The method according to claim 1, wherein the allocation scheme comprises: The identifiers of the set members that can respond to this scheduling, and the number of resources that can be allocated to the responded set members.
5. The method according to claim 1, wherein determining the total amount of schedulable resources currently available to the resource holder comprises: An interactive component is provided for the user to manually input the total amount of schedulable resources, and the total amount of schedulable resources is determined according to the user input value.
6. The method according to claim 1, wherein determining the urgency of the resource demand of the set members according to the preset rules comprises: Determine the urgency of the group members' need for resources based on the order in which they make their appointment applications.
7. According to the method of claim 1, when initiating a resource reservation application, the resource demander specifies a response deadline for this reservation application; Determining the urgency of the resource demand of the set members according to the preset rules includes: Determine the urgency of the collective members' demand for resources based on the corresponding reservation application response deadline of the collective members.
8. The method according to claim 1, wherein when the set includes preset applications with specified response deadlines and reservation applications without specified response deadlines, determining the urgency of the resource needs of the set members according to preset rules comprises: The urgency of the resource demand of the group members is determined based on the deadline for responding to their reservation applications, and then the urgency of the resource demand of the group members is determined based on the order of their reservation applications.
9. The method according to claim 1, further comprising: After the allocation plan is generated, the allocation plan is displayed, and an interactive component is provided for the user to manually adjust the allocation plan.
10. A loan repayment processing method implemented based on the resource scheduling method according to claim 1, the method comprising: Determine the borrower's current total available repayment amount; Determining the outstanding amount of the borrower; sorting the outstanding payments according to their repayment dates; Generate a repayment allocation plan for the total available repayment amount; wherein the repayment is allocated preferentially to the outstanding repayments with earlier repayment dates; the repayment allocation plan specifically includes: giving priority to the full repayment of the outstanding repayments with earlier repayment dates, and, under preset circumstances, continuing to search for outstanding repayments that can be fully repaid using the available repayment balance according to the allocated priority, and if so, adding the full repayment of the outstanding repayments using the repayment balance to the allocation plan; According to the generated repayment allocation plan, repayment is processed for the total available repayment amount.
11. The method according to claim 10, further comprising: After the allocation plan is generated, the principal and interest corresponding to the total repayment amount will be displayed for any repayable amount.
12. A resource scheduling device, the device comprising: A scheduling total amount determination unit, used to determine the current total amount of schedulable resources of the resource holder; The scheduling object determination unit is used to determine a set of applications to be responded to, wherein the members of the set are: resource reservation applications initiated to the resource holder and not yet responded to; A demand assessment unit, used to determine the urgency of the resource needs of the collection members according to preset rules; An allocation plan generating unit is used to generate an allocation plan for the total amount of schedulable resources; wherein the allocation priority is positively correlated with the determined urgency of the demand; the allocation plan is specifically: giving priority to fully responding to the number of resources for reservation applications with high urgency, and under preset circumstances, according to the allocation priority, continuing to search whether there is a reservation application that can be fully responded to using the available resource surplus, and if so, adding a full response to the reservation application using the surplus in the allocation plan; The scheduling execution unit is used to schedule the total amount of currently schedulable resources of the resource holder according to the generated allocation plan.
13. The device according to claim 12, wherein the scheduling total amount determination unit is specifically configured to: An interactive component is provided for the user to manually input the total amount of schedulable resources, and the total amount of schedulable resources is determined according to the user input value.
14. The device according to claim 12, wherein the demand assessment unit is specifically configured to: Determine the urgency of the group members' need for resources based on the order in which they make their appointment applications.
15. The device according to claim 12, when initiating a resource reservation application, the resource demander specifies a response deadline for this reservation application; The demand assessment unit is specifically used to determine the urgency of the demand for resources by the set members according to the reservation application response deadline corresponding to the set members.
16. The device according to claim 12, wherein the allocation scheme generating unit is further configured to: After the allocation plan is generated, the allocation plan is displayed, and an interactive component is provided for the user to manually adjust the allocation plan.
17. A loan repayment processing device based on the resource scheduling method according to claim 1, the device comprising: A total repayment amount determination unit, used to determine the current total repayment amount available to the borrower; A bandwidth scheduling object determination unit, used to determine the amount to be repaid by the borrowing user; A demand assessment unit, used for sorting the outstanding payments according to their repayment dates; An allocation scheme generating unit is used to generate a repayment allocation scheme for the total available repayment amount; wherein the repayment is allocated preferentially to the outstanding repayments with earlier repayment dates; the repayment allocation scheme is specifically: giving priority to the full repayment of the outstanding repayments with earlier repayment dates, and under preset circumstances, according to the allocated priority, continuing to search for outstanding repayments that can be fully repaid using the available repayment balance, and if so, adding the full repayment of the outstanding repayment using the repayment balance to the allocation scheme; The repayment processing execution unit is used to perform repayment processing on the total available repayment amount according to the generated repayment allocation plan.
18. The apparatus according to claim 17, wherein the allocation scheme generating unit is further configured to: After the allocation plan is generated, the principal and interest corresponding to the total repayment amount will be displayed for any repayable amount.
19. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method according to any one of claims 1 to 11 is implemented.
