CN113723641A

CN113723641A - Resource scheduling method and device

Info

Publication number: CN113723641A
Application number: CN202110969058.7A
Authority: CN
Inventors: 曾欢
Original assignee: Advanced New Technologies Co Ltd
Current assignee: Advanced New Technologies Co Ltd
Priority date: 2018-07-03
Filing date: 2018-07-03
Publication date: 2021-11-30
Also published as: CN109005214B; CN109005214A

Abstract

The embodiment of the specification discloses a resource scheduling method and a resource scheduling device. The resource scheduling method comprises the following steps: determining the total amount of the current schedulable resources of the resource holder; determining a to-be-responded application set; determining the urgency degree of the demand of the set members on the resources according to a preset rule; generating an allocation scheme for the total amount of schedulable resources, wherein the priority of allocation is positively correlated with the determined urgency of the demand; and scheduling the total amount of the current schedulable resources of the resource holders according to the generated allocation scheme.

Description

Resource scheduling method and device

Technical Field

The embodiment of the specification relates to the technical field of computers, in particular to a resource scheduling method and device.

Background

Resource scheduling is a common concept in the field of computer technology, and broadly refers to switching the attribution or usage authority of a resource between different principals, and a typical example is that one resource holder allocates the resource held by itself to multiple resource demanders. The roles of the resource holder and the resource demander can be relatively fixed, for example, the operating system allocates processing threads or memory resources for different application programs, and the network management device allocates bandwidth resources for different network access devices; or dynamically switched, for example, in a peer-to-peer network, any node may become either a resource holder or a resource demander.

At present, a common resource scheduling method is that a resource demanding party initiates an application to a resource holding party as required, and the resource holding party responds the application in real time and allocates resources to a corresponding resource demanding party. However, in practical applications, the resource demanding party may not obtain the resource in time due to system failure, limited processing capability, and the like, thereby affecting the normal use of the resource demanding party. In addition, in the case that the resources of the resource holder are sufficient, the on-demand allocation may cause the resources to be idle.

Disclosure of Invention

In view of the foregoing technical problems, an embodiment of the present specification provides a method and an apparatus for resource scheduling, and a technical solution is as follows:

according to the 1 st aspect of the embodiments of the present specification, there is provided a resource scheduling method, including:

determining the total amount of the current schedulable resources of the resource holder;

determining a set of applications to be responded, wherein the members in the set are as follows: initiating a resource reservation application which is not responded to the resource holder;

determining the urgency degree of the demand of the set members on the resources according to a preset rule;

generating an allocation scheme for the total amount of schedulable resources; wherein the assigned priority is positively correlated with the determined urgency of the demand; the distribution scheme specifically comprises the following steps: the method comprises the steps of firstly meeting complete response of the resource quantity of reservation application with high urgent demand degree, continuously searching whether the reservation application capable of utilizing the allowance of schedulable resource to carry out complete response exists according to the distribution priority under the preset condition, and if the reservation application exists, adding the allowance to carry out complete response on the reservation application in a distribution scheme;

and scheduling the total amount of the current schedulable resources of the resource holders according to the generated allocation scheme.

According to the 2 nd aspect of the embodiments herein, there is provided a loan return processing method including:

determining the current available repayment sum of the borrowing user;

determining an item to be paid of the borrowing user;

sequencing the items to be paid according to the payment date of the items to be paid;

generating a repayment allocation plan for the available repayment total; wherein, the repayment is preferentially distributed to the to-be-paid money with an earlier repayment date; the repayment allocation scheme specifically comprises the following steps: preferentially satisfying the full payment of the item to be paid with an earlier payment date, continuously searching whether the item to be paid with the full payment by using the available payment allowance exists according to the distribution priority under the preset condition, and if so, adding the item to be paid with the full payment by using the payment allowance in the distribution scheme;

and carrying out payment processing on the available payment sum according to the generated payment allocation scheme.

According to the 3 rd aspect of the embodiments herein, there is provided a resource scheduling apparatus, the apparatus including:

a scheduling total amount determining unit, configured to determine a current schedulable resource total amount of the resource holder;

a scheduling object determining unit, configured to determine a to-be-responded application set, where members of the set are: initiating a resource reservation application which is not responded to the resource holder;

the demand evaluation unit is used for determining the urgency degree of demand of the set members on the resources according to a preset rule;

an allocation plan generating unit, configured to generate an allocation plan for a total schedulable resource amount; wherein the assigned priority is positively correlated with the determined urgency of the demand; the distribution scheme specifically comprises the following steps: the method comprises the steps of firstly meeting complete response of the resource quantity of reservation application with high urgent demand degree, continuously searching whether reservation application capable of utilizing the allowance of the available resources to carry out complete response exists or not according to the distribution priority under the preset condition, and if the reservation application exists, adding the allowance to carry out complete response on the reservation application in a distribution scheme;

and the scheduling execution unit is used for scheduling the total amount of the current schedulable resources of the resource holders according to the generated allocation scheme.

According to the 4 th aspect of the embodiments herein, there is provided a loan return processing apparatus including:

the payment total amount determining unit is used for determining the current available payment total amount of the borrowing user;

the bandwidth scheduling object determining unit is used for determining the to-be-paid items of the borrowing users;

the demand evaluation unit is used for sequencing the items to be paid according to the paying dates of the items to be paid;

an allocation plan generating unit, configured to generate a repayment allocation plan for the available repayment total amount; wherein, the repayment is preferentially distributed to the to-be-paid money with an earlier repayment date; the repayment allocation scheme specifically comprises the following steps: preferentially satisfying the full payment of the item to be paid with an earlier payment date, continuously searching whether the item to be paid with the full payment by using the available payment allowance exists according to the distribution priority under the preset condition, and if so, adding the item to be paid with the full payment by using the payment allowance in the distribution scheme;

and the repayment processing execution unit is used for performing repayment processing on the available repayment total amount according to the generated repayment allocation scheme.

The technical solution provided by the embodiment of the present specification allows the resource demanding party to apply for the resource to the resource holding party in advance in a reservation manner, and the resource holding party can respond to the application of the resource holding party in advance when the resource is sufficient. On one hand, sufficient processing time is reserved for resource scheduling, the burden of real-time response to resource application is reduced, and the condition that a resource demander cannot obtain resources in time is further reduced; on the other hand, when the resource of the resource holder is sufficient, the resource can be dispatched to the corresponding resource demander in advance, so that the resource demander can use the resource in advance, and the phenomenon of resource idling is reduced.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of embodiments of the invention.

In addition, any one of the embodiments in the present specification is not required to achieve all of the effects described above.

Drawings

In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the embodiments of the present specification, and other drawings can be obtained by those skilled in the art according to the drawings.

Fig. 1 is a flowchart illustrating a resource scheduling method according to an embodiment of the present disclosure;

FIGS. 2 a-2 c are schematic diagrams of an exemplary loan application interface according to an embodiment of the disclosure;

fig. 3 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present specification;

fig. 4 is a schematic structural diagram of an apparatus for configuring a device according to an embodiment of the present disclosure.

Detailed Description

In order to make those skilled in the art better understand the technical solutions in the embodiments of the present specification, the technical solutions in the embodiments of the present specification will be described in detail below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, but not all the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification should fall within the scope of protection of the embodiments in the present specification.

According to the resource scheduling method described in the background art, the resource demanding party initiates an application to the resource holding only when the resource needs to be used, and correspondingly, the resource holding party also needs to respond to the application immediately, otherwise, the normal use of the resource demanding party is affected. In the mode of 'application on demand and response on demand', if system failure or limited processing capacity occurs in the application stage or the response stage, the resource demand party cannot obtain the resource in time, thereby affecting normal use.

In view of the above technical problems, the resource scheduling scheme provided in this specification is: the resource demand party is allowed to apply for the resource to the resource holder in advance in a reservation mode, and accordingly the resource holder can respond to the application of the resource holder in advance under the condition that the resource is sufficient.

For convenience of description, in this specification, it is specified that in a particular resource scheduling transaction, there are 1 resource holder x, and at least 1 resource demander.

Assuming that at least 1 application to be responded y1, y2 and y3 … … yn exist at the statistical time T0, the application to be responded specifically means: and resource reservation application which is initiated by the resource holder x and has not finished responding.

Wherein, the resource reservation application means: the resource application issued by the resource demander before time T can be understood as allowing the actual usage time of the resource by the resource demander to be later than T. The resource demand amount is generally specified in the reservation application, but there may be a default resource demand amount, or the resource holder may know the requested resource amount in other manners. In addition, any two different applications may be issued by the same resource demander or by different resource demanders, which is not limited in this specification.

On the basis of the above description, the present specification provides a resource scheduling method, which is shown in fig. 1 and may include the following steps:

s101, determining the total amount of the current schedulable resources of a resource holder;

according to the foregoing description, as for any resource holder x, as long as it has schedulable resources, the resource scheduling method of the present specification can be triggered. It should be noted that "schedulable resource" is not necessarily equal to all idle resources of the resource holder, and the definition of "schedulable resource" is not limited in this specification.

In practical application, the resource scheduling method of the present specification may be triggered when the total schedulable resource amount is monitored to be greater than 0, or may be triggered when the total schedulable resource amount is greater than a certain threshold.

In a particular embodiment, the total amount of schedulable resources may also be specified manually by the user. For example, an interactive component may be presented on the user terminal for the user to manually input the total amount of schedulable resources, and further determine the total amount of schedulable resources based on the user input value.

S102, determining a to-be-responded application set;

and determining a to-be-responded application set corresponding to the time T0 by taking the current time after the total amount of the schedulable resources is determined as T0. Here, the set of applications to be responded to refers to: the resource reservation system comprises a set consisting of pending response applications y1, y2 and y3 … … yn, wherein any one of y1, y2 and y3 … … yn is a resource reservation application which is initiated by a resource holder x and has not completed a response.

S103, determining the urgency degree of the demand of the set members on the resources according to a preset rule;

as can be seen from the foregoing description, the resource reservation application indicates that the resource demander is not in an urgent position to use the resource, and the other layer means that the resource demander needs to use the applied resource at a future time Tf, and if it does not respond later than Tf, the normal use of the resource demander is affected.

It is assumed that for any member yi of the set of applications to respond, there is a corresponding response deadline Tf_iThen (Tf) can be utilized_i-T0) to characterize the urgency of yi for the resource requirement, namely: tf_iThe closer to the current moment, the more stringent the need for resources by yi. It can be understood that, in practical application, it can directly follow Tf_iThe order of the urgency of the demand is determined from the small to the large.

In a specific embodiment, when the resource demander initiates the reservation application, the resource demander specifies the response deadline of the reservation application in addition to the quantity of the resource demand. The significance of this response deadline is: and finally, completing the complete response to the application before the time (otherwise, the normal use is influenced), and under the condition, determining the urgency degree of the demand of the set members on the resources directly according to the response deadline time of the reservation application corresponding to the set members.

In another specific implementation, if the resource demander does not specify the response deadline of the reservation application when initiating the reservation application, the urgency of the demand of the set member on the resource can be determined directly according to the time sequence of the reservation application corresponding to the set member. Namely: in the case where the response time is not required, it is considered that the earlier the application is issued, the more urgent the demand for resources is.

If the reservation applications with the response deadline specified and the reservation applications without the response deadline not specified are included in the set, the urgency degrees of the resource demand are ranked from high to low as: preferably according to Tf_iAnd then sequencing according to the time of issuing the application.

S104, generating a distribution scheme aiming at the total amount of the schedulable resources;

in the generated allocation scheme, at least the following should be included: the scheduling may respond to which resource reservation applications and the number of resources that may be allocated to the responded set members, and of course, other contents, such as resource demander identifiers, may also be added according to actual requirements, which is not limited in this specification.

When generating the allocation scheme, it should be ensured that the priority of allocation is positively correlated with the urgency of demand determined in S103, that is: and preferentially responding to the resource reservation application with the highest demand degree, and if the schedulable resource allowance is left after the response is finished, continuing to respond to the resource reservation application with the second highest demand degree, and so on.

In practical applications, the response of the resource reservation request may include a complete response and a partial response, where:

complete response: for the application with the resource number M, one-time response is needed to complete;

partial response: for an application with the application resource number of M, the response can be completed in multiple times, that is, the number of resources scheduled in each response can be less than M.

When generating the allocation scheme, the complete response to the resource amount of the reservation application with the high urgent need degree should be satisfied preferentially.

According to the actual application requirement, if partial response to the resource quantity of the resource reservation application is allowed, when the allocation scheme is generated, according to the allocation priority, the resource quantity allocated to the last responded resource reservation application may be smaller than the total resource quantity applied by the last responded resource reservation application. And the schedulable resource margin after the completion of the allocation is necessarily 0.

If partial response to the resource amount of the resource reservation application is not allowed, the schedulable resource headroom after completion of the allocation may not be 0 when the allocation scheme is generated. For the processing of the margin, different strategies may be adopted, such as:

the scheduling does not allocate the allowance, and the allowance can be reserved for the next scheduling;

and according to the distributed priority, continuously searching whether a resource reservation application which can completely respond by using the allowance exists, and if so, adding a scheme which completely responds to the application by using the allowance in the distribution scheme. It will be appreciated that this approach will in fact give priority to applications for which the urgency of the response requirement is not the highest, and so is generally applicable to applications for which a response deadline is not explicitly required, although this is not a limitation of the present specification.

And dynamically determining a processing mode of the allowance according to the urgent degree of the demand of the application which cannot be responded by the scheduling. For example, if in the application that the current schedule cannot respond to, (Tf)_i-T0) is not lower than a preset threshold, i.e. no application is "particularly urgent", this allows preferential response to applications for which the urgency is not the highest, otherwise the margin is reserved.

Of course, an operation option may be provided for the user, so that the user can determine the processing mode of the margin.

The above generation of the assignment scheme is only illustrative and should not be construed as limiting the present specification.

And S105, scheduling the total amount of the current schedulable resources of the resource holders according to the generated allocation scheme.

In practice, after the allocation plan is generated, the allocation plan may be presented for output and an interactive component may be provided for a user to manually adjust the allocation plan.

After the allocation scheme is generated, the specific scheduling implementation is not related to the scheme in this specification, and is not described in detail in the embodiments.

Therefore, by applying the technical scheme, the resource demand party is allowed to apply for the resource from the resource holder in advance in a reservation mode, and the resource holder can respond to the application of the resource holder in advance under the condition that the resource is sufficient. On one hand, sufficient processing time is reserved for resource scheduling, the burden of real-time response to resource application is reduced, and the condition that a resource demander cannot obtain resources in time is further reduced; on the other hand, when the resource of the resource holder is sufficient, the resource can be dispatched to the corresponding resource demander in advance, so that the resource demander can use the resource in advance, and the phenomenon of resource idling is reduced.

In addition, from the perspective of user operation, because the most appropriate resource reservation application can be automatically matched for response, the trouble of manual calculation and selection of the user is avoided. Particularly, the convenience and the accuracy of operation can be remarkably improved under the conditions that the number of applications to be responded is large and the resource numerical value is difficult to calculate.

The following describes the present application scheme with reference to some specific application scenarios:

example 1:

in an operating system supporting a planning task, each application program can apply for a processing thread required by the operation of the application program in advance. The default settings are: each application program initiates a thread reservation application to the operating system 60s before the scheduled execution time, does not specify a response deadline for the reservation application, and allows only a full response to the application (does not allow a partial response).

Assuming that at a certain time T, the operating system obtains a total number of schedulable threads of 20; by inquiring the reservation application record to be responded, it is found that the current total 3 application programs A, B, C have successively initiated the thread reservation application to the operating system, and the application conditions are as follows:

the application program A: applying for 5 processing threads;

and the application program B: applying for 10 processing threads;

and application program C: applying for 8 processing threads;

because each application does not specify the response deadline, the urgency of the demand is determined according to the sequence of the initiated applications: a > B > C, further generating an allocation plan as follows:

application program	Number of threads of reservation application	Actual number of threads allocated
			A	5	5
B	10	10

The total number of schedulable threads is 20, and since the provision only allows complete response to the application, and after A, B are allocated in sequence according to the urgency, the schedulable thread margin is 5, which is not enough to completely respond to C (application thread number 8), the number of threads actually allocated for this scheduling is 15.

Example 2:

in the integrated service system, the update time of the service data of different servers is different, and the access amount of the service server is increased rapidly immediately after the service data is updated, so that it is necessary to allocate sufficient additional access bandwidth to each server before the update time point of the server. The default settings are: each server can initiate a bandwidth reservation application to the bandwidth resource management device at any time, specify a response deadline (data update time) of the reservation application, and allow a response to the application part.

Assuming that at a certain time T is 6:00, the os obtains a schedulable bandwidth of 120M in total, and finds that 3 servers A, B, C in total have initiated a bandwidth reservation application to the bandwidth resource management device by querying the reservation application record to be responded, where the number of resources applied is as follows:

a server A: applying for 40M bandwidth, and responding to the deadline time of 9: 00;

and a server B: applying for 50M bandwidth, and responding to 8:30 of cut-off time;

a server C: applying for 60M bandwidth, and responding to 8:00 cut-off time;

because each application specifies a response deadline, the urgency of the demand is determined from near to far according to the application response deadline: c > B > A, further generating an allocation plan as follows:

server	Amount of bandwidth requested for reservation	Actual amount of allocated bandwidth	Non-responsive part
				C	60	60	0
B	50	50	0
				A	40	10	30

The total amount of schedulable bandwidth is 120, and since provision is made to allow partial response to the application, after C, B are allocated bandwidth in turn according to the urgency, the schedulable bandwidth margin is 10, which can still partially respond to a (application bandwidth amount 40) although it is not enough to fully respond to a. After the scheduling is completed, the unresponsive portion of the application of the server a is changed to 30, and the response deadline is not changed.

Example 3:

the scheme of the application can also be applied to financial resource configuration, for example, in the case of loan transaction, loans generally have a certain term, for example, 3, 6, 12 months payback and the like. Because loans generate interest, many loan platforms allow borrowers to pay in advance, i.e., all or a portion of the debt may be paid in advance before the payment due is due, thereby reducing the amount of interest that needs to be paid.

For a certain borrowing user, a plurality of money items may be borrowed, and each money item has a return deadline. It can therefore be said that the lender (which may be one or more, regardless of the implementation of the proposal) initiates a resource reservation application (requiring a payment) to the borrowing user, and specifies the response deadline for the reservation application (specifying that the payment will be cleared before the payment deadline), and allows a partial response (allowing a partial payment for the "advanced payment" case).

It can be understood that in the application scenario of the loan transaction, the specific amount of payment required is not fixed, but dynamically changes with the time point of payment, that is: the earlier the payment, the less interest needs to be paid. However, since most loan transactions are daily, the amount of money actually required to repay the money is still determinable at a certain statistical time T.

According to the implementation scheme of the prior art, the user can only manually select a plurality of money items from the list of the items to be paid according to the current available total repayment amount, and in the selection process, the problems of limit, deadline and the like need to be comprehensively considered, so that the operation is inconvenient, and the situation of selection errors is difficult to avoid.

By applying the scheme of the application, the problems can be effectively solved:

firstly, providing an input window of 'available repayment sum' for a borrower, and determining the current available repayment sum of the borrower user according to input numbers of the user;

determining a list of items to be paid of the borrower user, and sequencing the items to be paid in the list according to the payment date of the items to be paid;

generating a repayment allocation scheme of available repayment total amount, wherein the principle is as follows: preferentially distributing the repayment to the to-be-paid money with an earlier repayment date; wherein, the allocation scheme at least comprises: the refund item to be paid which can be returned this time and the repayment quantity allocated for the refund item this time;

after the allocation plan is generated, the allocation plan output may be displayed to the user, or the user may be allowed to modify the automatically generated allocation plan. Further, the corresponding principal amount and interest amount can be displayed according to the total amount of the repayment; or, for any payable item to be paid, the principal amount and interest amount corresponding to the payment total amount can be specifically displayed.

Fig. 2a to 2c are schematic diagrams of interfaces of a "cash-in-advance" function in a loan application implemented by applying the solution of the present specification.

In the interface shown in fig. 2a, the user can fill the total amount he wants to return at the position of "return in advance";

in the interface shown in fig. 2b, the "return ahead" amount filled by the user is 40000, it can be seen that 3 current refunds are automatically selected for the user from 18 to-be-paid items according to the repayment deadline from near to far, and the 3 rd payment is displayed as partial repayment, and the user can manually modify the allocation result.

In the interface shown in fig. 2c, of the total repayment amount 40000 displayed for the user, 39800 will be applied to repayment of principal, 200 will be used to repay interest, and the user will execute the repayment operation according to the scheme after clicking the 'confirm' button.

After the scheme provided by the specification is applied, the user only needs to manually input the total amount of the repayment, and the system can automatically judge which items to be repayment should be allocated, so that the convenience of user operation is effectively improved, and errors caused by manual selection of the user can be avoided.

Corresponding to the foregoing method embodiment, an embodiment of the present specification further provides a resource scheduling apparatus, and referring to fig. 3, the apparatus may include:

a scheduling total amount determining unit 110, configured to determine a current schedulable resource total amount of the resource holder;

a scheduling object determining unit 120, configured to determine a to-be-responded application set, where members in the set are: initiating a resource reservation application which is not responded to a resource holder;

the requirement evaluation unit 130 is configured to determine the urgency of the requirement of the set member for the resource according to a preset rule;

an allocation scheme generating unit 140, configured to generate an allocation scheme for the total schedulable resource amount, where the allocation scheme may include: the current dispatching can respond to the identification of the set members and the number of resources which can be distributed by the responded set members; wherein the assigned priority is positively correlated with the determined urgency of the demand;

and a scheduling execution unit 150, configured to schedule the total amount of the schedulable resources of the resource holders according to the generated allocation scheme.

In an embodiment provided in this specification, the scheduling total amount determining unit may be specifically configured to:

an interactive component is provided for a user to manually input a total amount of schedulable resources and determine the total amount of schedulable resources based on the user input value.

In one embodiment provided in the present specification, the requirement evaluation unit may be specifically configured to:

and determining the urgency degree of the demand of the set members on the resources according to the time sequence of the reservation application of the set members.

In a specific embodiment provided in this specification, when a resource demander initiates a resource reservation application, a response deadline of the reservation application is specified;

accordingly, the demand evaluation unit may be specifically configured to: and determining the urgency degree of the demand of the set members on the resources according to the response deadline of the reservation application corresponding to the set members.

In a specific embodiment provided in this specification, the allocation scheme includes a complete response and a partial response to the amount of the resource reserved for application by any member, and the allocation scheme preferentially satisfies the complete response to the amount of the resource reserved for application with a high urgent demand level.

In a specific embodiment provided in this specification, the allocation plan generating unit is further configured to:

after the allocation plan is generated, the allocation plan is presented and an interactive component is provided for a user to manually adjust the allocation plan.

The present specification also provides a loan return processing apparatus, which may include:

the bandwidth scheduling object determining unit is used for determining the to-be-paid item of the borrowing user;

an allocation plan generating unit, configured to generate a repayment allocation plan for the available repayment total amount, where the repayment allocation plan may include: the refund item to be paid which can be returned this time and the repayment quantity allocated for the refund item this time; wherein, the repayment is preferentially distributed to the to-be-paid money with an earlier repayment date;

The loan return processing apparatus may be actually understood as a specific application of the resource scheduling apparatus in a loan transaction scenario, and therefore, for the specific structure and other functional implementation of the loan return processing apparatus, reference may be made to fig. 3 and the description of the foregoing embodiment, which are not described herein again.

Embodiments of the present specification also provide a computer device including at least a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the foregoing resource scheduling method or loan return processing method when executing the program.

Fig. 4 is a schematic diagram illustrating a more specific hardware structure of a computing device according to an embodiment of the present disclosure, where the computing device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.

The processor 1010 may 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 configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.

The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.

The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.

The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).

Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.

It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.

Embodiments of the present specification also provide a computer-readable storage medium on which a computer program is stored, which when executed by a processor implements the foregoing resource scheduling method or loan return processing method.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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 disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

From the above description of the embodiments, it is clear to those skilled in the art that the embodiments of the present disclosure can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the embodiments of the present specification may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments of the present specification.

The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.

The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points. The above-described apparatus embodiments are merely illustrative, and the modules described as separate components may or may not be physically separate, and the functions of the modules may be implemented in one or more software and/or hardware when implementing the embodiments of the present disclosure. And part or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

The foregoing is only a specific embodiment of the embodiments of the present disclosure, and it should be noted that, for those skilled in the art, a plurality of modifications and decorations can be made without departing from the principle of the embodiments of the present disclosure, and these modifications and decorations should also be regarded as the protection scope of the embodiments of the present disclosure.

Claims

1. A method of resource scheduling, the method comprising:

2. The method of claim 1, the preset conditions comprising:

the schedulable resource margin after completion of the allocation is not zero; and/or

No reservation applications with a high urgency level exist among the remaining unresponsive reservation applications.

3. The method of claim 1, the preset conditions comprising: the reservation applications with high urgent demand degree do not exist in the rest unresponsive reservation applications; the method further comprises the following steps:

and in the case that the reservation application with high urgent demand degree exists in the rest unresponsive reservation applications, adding a part of response to the reservation application by using the allowance in the distribution scheme.

4. The method of claim 1, the allocation scheme comprising: the identification of the set members which can respond in the scheduling and the number of the resources which can be distributed by the set members which respond.

5. The method of claim 1, wherein determining a current total amount of schedulable resources for a resource holder comprises:

6. The method of claim 1, wherein determining the urgency of demand of a set member for a resource according to a preset rule comprises:

7. The method of claim 1, wherein the resource demander specifies the response deadline of the reservation application when initiating the resource reservation application;

the determining the urgency of the demand of the set members for the resources according to the preset rules includes: and determining the urgency degree of the demand of the set members on the resources according to the response deadline of the reservation application corresponding to the set members.

8. The method of claim 1, in a case that the set includes a preset application specifying a response deadline and a reservation application not specifying the response deadline, the determining, according to a preset rule, how urgent a demand of a set member for a resource is includes:

and determining the urgency of the demand of the set members on the resources according to the response deadline of the reservation application corresponding to the set members, and determining the urgency of the demand of the set members on the resources according to the time sequence of the reservation application of the set members.

9. The method of claim 1, further comprising: after the allocation plan is generated, the allocation plan is displayed, and an interactive component is provided for a user to manually adjust the allocation plan.

10. A loan return processing method implemented based on the resource scheduling method of claim 1, the method comprising:

determining the current available repayment sum of the borrowing user;

determining an item to be paid of the borrowing user;

11. The method of claim 10, further comprising:

and after the distribution scheme is generated, the principal amount and interest amount corresponding to the total repayment amount are displayed for any payable item to be repayed.

12. An apparatus for scheduling resources, the apparatus comprising:

13. The apparatus according to claim 12, wherein the scheduling amount determining unit is specifically configured to:

14. The apparatus of claim 12, the demand evaluation unit to:

15. The apparatus of claim 12, wherein the resource demander specifies a response deadline of the reservation application when initiating the resource reservation application;

the demand evaluation unit is specifically configured to: and determining the urgency degree of the demand of the set members on the resources according to the response deadline of the reservation application corresponding to the set members.

16. The apparatus of claim 12, the allocation plan generation unit further to:

after the allocation plan is generated, the allocation plan is displayed, and an interactive component is provided for a user to manually adjust the allocation plan.

17. A loan return processing apparatus based on the resource scheduling method of claim 1, the apparatus comprising:

18. The apparatus of claim 17, the allocation plan generation unit further to:

19. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 11 when executing the program.