Movatterモバイル変換


[0]ホーム

URL:


CN110633115A - Task distribution method and device, electronic equipment and storage medium - Google Patents

Task distribution method and device, electronic equipment and storage medium
Download PDF

Info

Publication number
CN110633115A
CN110633115ACN201910865327.8ACN201910865327ACN110633115ACN 110633115 ACN110633115 ACN 110633115ACN 201910865327 ACN201910865327 ACN 201910865327ACN 110633115 ACN110633115 ACN 110633115A
Authority
CN
China
Prior art keywords
weight value
configuration weight
candidate user
distributed
task
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910865327.8A
Other languages
Chinese (zh)
Inventor
不公告发明人
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Youzhuju Network Technology Co Ltd
Original Assignee
Beijing Infinite Light Field Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Infinite Light Field Technology Co LtdfiledCriticalBeijing Infinite Light Field Technology Co Ltd
Priority to CN201910865327.8ApriorityCriticalpatent/CN110633115A/en
Publication of CN110633115ApublicationCriticalpatent/CN110633115A/en
Pendinglegal-statusCriticalCurrent

Links

Images

Classifications

Landscapes

Abstract

The embodiment of the disclosure discloses a task distribution method, a device, an electronic device and a storage medium, wherein the method comprises the following steps: determining target candidate users corresponding to the tasks to be distributed according to the tasks to be distributed and the current configuration weight value of each candidate user so as to distribute the tasks to be distributed to the target candidate users; according to the current configuration weight value, adjusting the configuration weight value of each candidate user to update the current configuration weight value; and determining the current configuration weight value by the transaction parameters of each candidate user within a preset time. According to the technical scheme of the embodiment of the disclosure, the technical problem of poor user experience caused by uneven task distribution due to the fact that tasks are randomly distributed to all users in the prior art is solved, the task distribution weighted values corresponding to all candidate users are dynamically adjusted, and the technical effects of rationality and high efficiency of task distribution are improved.

Description

Task distribution method and device, electronic equipment and storage medium
Technical Field
The embodiment of the disclosure relates to the technical field of computers, and in particular, to a task distribution method and apparatus, an electronic device, and a storage medium.
Background
With the development of networks, more and more users can play games, browse web pages, browse various information and the like on the terminals. Of course, there are some software that requires the user to add value to the program, for example, in the case of a game application, when the user needs to purchase skin and equipment, the user needs to add a certain amount of money to the application to purchase the equipment. Correspondingly, the merchant corresponding to the application program distributes tasks to the partial users according to the recharging amount of each user at a certain time point in order to encourage the partial users.
In the prior art, tasks distributed by a task distribution server to each user are distributed randomly, so that the technical problems that the number of times of the tasks received by the user with a higher recharging value is less than that of the user with a lower recharging value, the tasks are distributed unevenly, and the user experience is poor exist.
Disclosure of Invention
The embodiment of the disclosure provides a task distribution method and device, an electronic device and a storage medium, so as to distribute tasks to all candidate users reasonably and efficiently, thereby improving the technical effect of user experience.
In a first aspect, an embodiment of the present disclosure provides a task distribution method, where the method includes:
determining target candidate users corresponding to the tasks to be distributed according to the tasks to be distributed and the current configuration weight value of each candidate user, so as to distribute the tasks to be distributed to the target candidate users;
according to the current configuration weight value, adjusting the configuration weight value of each candidate user to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
In a second aspect, an embodiment of the present disclosure further provides a task distributing apparatus, where the apparatus includes:
the target candidate user determining module is used for determining a target candidate user corresponding to the task to be distributed according to the task to be distributed and the current configuration weight value of each candidate user so as to distribute the task to be distributed to the target candidate user;
a configuration weight value determining module, configured to adjust the configuration weight value of each candidate user according to the current configuration weight value, so as to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
In a third aspect, an embodiment of the present disclosure further provides an electronic device, where the electronic device includes:
one or more processors;
a storage device for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors implement the task distribution method according to any one of the embodiments of the present disclosure.
In a fourth aspect, the embodiments of the present disclosure also provide a storage medium containing computer-executable instructions, which when executed by a computer processor, are used for executing the task distribution method according to any one of the embodiments of the present disclosure.
According to the technical scheme of the embodiment of the disclosure, the target candidate users corresponding to the tasks to be distributed are determined according to the tasks to be distributed and the current configuration weight value of each candidate user, so that the tasks to be distributed are distributed to the target candidate users, the configuration weight value of each candidate user is adjusted according to the current configuration weight value, so that the current configuration weight value is updated, wherein the current configuration weight value is determined by the transaction parameters of each candidate user in the preset time, the technical problems that in the prior art, the tasks are randomly distributed to each user, the number of times of tasks received by users with higher transaction parameters is smaller than that of users with lower transaction parameters, the tasks are distributed unreasonably, and the user experience is poor are solved, and the task distribution weight values corresponding to each candidate user are dynamically adjusted, the rationality and the high efficiency of the distribution task are improved.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
Fig. 1 is a schematic flowchart of a task distribution method provided in a first embodiment of the present disclosure;
fig. 2 is another schematic flow chart of a task distribution method according to a second embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a task distributing apparatus according to a third embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an electronic device according to a fourth embodiment of the disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.
The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
Example one
Fig. 1 is a flowchart of a task distribution method provided in an embodiment of the present disclosure, where the method is applicable to a situation where a task is distributed to each candidate user according to a current configuration weight value, and the method may be executed by a task distribution apparatus, where the apparatus may be implemented in a form of software and/or hardware, and optionally, implemented by an electronic device, where the electronic device may be a mobile terminal, a PC terminal, or the like.
As illustrated in fig. 1, the method in the embodiment of the present disclosure includes:
s110, determining target candidate users corresponding to the tasks to be distributed according to the tasks to be distributed and the current configuration weight value of each candidate user, and distributing the tasks to be distributed to the target candidate users.
For clarity, in the technical solutions of the embodiments of the present disclosure, a task distribution server is taken as an example to describe the task distribution.
The task distribution server can distribute the tasks to at least one candidate user, and the tasks distributed to the candidate users are used as the tasks to be distributed. Candidate users refer to users that may participate in performing a task to be distributed. It should be noted that the candidate user may be a user randomly selected by the server from all users, or may be a candidate user selected from all users according to a certain rule. The target candidate users are candidate users determined to execute the task to be distributed. The current configuration weight value refers to a weight value at which each candidate user can perform a task to be distributed. The current configuration weight value is determined according to the ratio of the transaction parameter of each candidate user to the total transaction parameter of all candidate users. The transaction parameters may include: the task distribution server receives the recharging value within the preset time, optionally, the recharging value corresponding to each user is counted once per month by taking one month as a unit.
Specifically, according to the task to be distributed and the current configuration weight value of each candidate user, a user who executes the task to be distributed can be selected from all candidate users, the user who executes the task to be distributed is taken as a target candidate user, and the task distribution server can distribute the task to be distributed to the target candidate users respectively.
Optionally, the target candidate user is determined according to the task to be distributed and the current configuration weight value of each candidate user, and the determination may be: and according to the number of tasks in the tasks to be distributed, sequentially acquiring candidate users with high current configuration weight values corresponding to the number of the tasks from the candidate users as target candidate users.
The number of the tasks in the tasks to be distributed may be one, two, or more, and optionally, the number of the tasks in the tasks to be distributed is five. The current configuration weight value may be determined according to transaction parameters of each candidate user, for example, if there are ten candidate users selected from all users, the transaction parameters of each candidate user, that is, the recharge amount is A, B, C, D, E, F, G, H, I, J, respectively, and a > B > C > D > E > F > G > H > I > J, and accordingly, the total transaction parameters are: a + B + C + D + E + F + G + H + I + J, the current configuration weight value corresponding to each candidate user may be: and by analogy, … of A/(A + B + C + D + E + F + G + H + I + J), B/(A + B + C + D + E + G + H + I + J), and C/(A + B + C + D + E + F + G + H + I + J) can be obtained, and current configuration weight values corresponding to 10 candidate users can be obtained respectively. The target candidate users are users screened from the candidate users by the task distribution server according to a certain rule, for example, 10 candidate users are provided, the number of the tasks to be distributed is 5, and the current configuration weight value can be located in the first five digits, that is, the tasks are distributed to the candidate users whose recharge amounts are A, B, C, D, E respectively, that is, the candidate user corresponding to A, B, C, D, E is the target candidate user.
In the embodiment of the present disclosure, the candidate users may be sequentially ranked from high to low according to the current configuration weight value corresponding to each candidate user, and the server distributes the task to be distributed to the candidate users with the current configuration weight values ranked in the top five according to the number of tasks, optionally, five tasks, in the task to be distributed. Of course, the server may also select five candidate users with higher current configuration weight from all candidate users as target candidate users according to the number of tasks in the tasks to be distributed, optionally, 5 tasks to be distributed.
Specifically, the candidate users are sequentially ranked according to the current configuration weight of each candidate user in the candidate users, and the task distribution server sequentially distributes the tasks to be distributed to the candidate users ranked before the preset position according to the number of the tasks in the tasks to be distributed. Certainly, the task distribution server may select a preset number of candidate users with higher current configuration weight values from all the candidate users according to the number of tasks in the tasks to be distributed, and use the selected candidate users as target candidate users.
It should be noted that the number of target candidate users is the same as the number of tasks in the task to be distributed.
S120, adjusting the configuration weight value of each candidate user according to the current configuration weight value so as to update the current configuration weight value.
It should be noted that, after the task to be distributed is sent to the target candidate users by the task to be distributed server, the current configuration weight value corresponding to each candidate user may be dynamically adjusted, so that the setting has the advantages that: tasks can be distributed to all candidate users according to the regulated current configuration weight value so as to improve the reasonability and fairness of task distribution, namely, the times that users with large recharging amount can receive the tasks are larger than those of users with low recharging amount.
On the basis of S110, after distributing the task to the target candidate user, dynamically adjusting the current configuration weight value corresponding to each candidate user includes: obtaining a first to-be-adjusted configuration weight value corresponding to the target candidate user based on the first preset adjustment value and the configuration weight value corresponding to the target candidate user; obtaining a second to-be-adjusted configuration weight value corresponding to each candidate user based on the second preset adjustment value and the configuration weight value corresponding to each candidate user; and obtaining a current configuration weight value corresponding to each candidate user based on the first configuration weight value to be adjusted and a plurality of second configuration weight values to be adjusted.
The first preset adjustment value may be random or fixed, and optionally, the first preset adjustment value is 1. The first to-be-adjusted configuration weight value may be understood as: and processing the current configuration weight value corresponding to the target candidate user in the step S110 according to the first preset adjusting value to obtain the configuration weight value. The second preset adjustment value may be random, or may be determined according to a preset rule, and optionally, the second preset adjustment value is 2. The second to-be-adjusted configuration weight value is a configuration weight value obtained by processing the current configuration weight values of all candidate users in S110 according to a second preset adjustment value. And processing the first configuration weight value to be adjusted and the second configuration weight value to be adjusted to obtain the current configuration weight value.
Specifically, according to a first preset adjustment value, after processing the current configuration weight value of each target candidate user in S110, a first configuration weight value to be adjusted is obtained; after the current configuration weight value of each candidate user in S110 is processed according to the second preset adjustment value, a second configuration weight value to be adjusted is obtained. And adding the first configuration weight value to be adjusted and the second configuration weight value to be adjusted to obtain the adjusted current configuration weight value.
Illustratively, the number of candidate users is 10, the number of target candidate users is three, the current configuration weight value of each candidate user is a ', B ', C ', D ', E ', F ', G ', H ', I ', J ', the first preset adjustment value is 1, and the current configuration weight value of the target candidate user is a ', B ', C ', so that the first configuration weight value to be adjusted of each candidate user is a ' -1, B ' -1, C ' -1, D ', E ', F ', G ', H ', I ', J ', and the configuration weight value obtained at this time is taken as the first configuration weight value to be adjusted; and multiplying the current configuration weight value of the candidate user by a coefficient 2 to obtain a second configuration weight to be adjusted. Namely, the second to-be-adjusted configuration weight values of each candidate user are 2A ', 2B', 2C ', 2D', 2E ', 2F', 2G ', 2H', 2I 'and 2J'; and after the first configuration weight value to be adjusted and the second configuration weight value to be adjusted are accumulated, obtaining the adjusted current configuration weight value. The adjusted current configuration weight values corresponding to each candidate user are respectively: a ' -1+2A ', B-1+2B ', C ' -1+2C ', D ' +2D ', E ' +2E ', F ' +2F ', G ' +2G ', H ' +2H ', I ' +2I ', J ' +2J '.
It should be noted that, after the task distribution to the target candidate user is finished, the current configuration weight values corresponding to the respective candidate users may be adjusted in the above manner. If there is a task, the target candidate user can be determined according to the adjusted current configuration weight value, and the task is distributed to the target candidate user. The advantage of distributing tasks to each candidate user by adopting the technical scheme disclosed by the invention is that the tasks can be distributed to each candidate user according to the dynamically adjusted current configuration weight value, the task distribution is more balanced, and the situation that the task distribution is unreasonable is avoided.
According to the technical scheme of the embodiment of the disclosure, the target candidate users corresponding to the tasks to be distributed are determined according to the tasks to be distributed and the current configuration weight value of each candidate user, so that the tasks to be distributed are distributed to the target candidate users, the configuration weight value of each candidate user is adjusted according to the current configuration weight value, so that the current configuration weight value is updated, wherein the current configuration weight value is determined by the transaction parameters of each candidate user in the preset time, the technical problems that in the prior art, the tasks are randomly distributed to each user, the number of tasks received by users with higher transaction parameters is smaller than that of users with lower transaction parameters, the tasks are distributed unreasonably, and the user experience is poor are solved, the task distribution weight values corresponding to each candidate user are dynamically adjusted, and the rationality of the distributed tasks is improved, and high efficiency.
Example two
When the task distribution server distributes tasks to all candidate users, if the fact that the current configuration weight value reaches a preset threshold value is detected, the tasks are stopped being distributed to all the candidate users. Fig. 2 is another schematic flow chart of a task distribution method according to a second embodiment of the disclosure.
As shown in fig. 2, the method includes:
s210, obtaining at least two candidate users from the target area according to a preset rule, and determining an original configuration weight value corresponding to each candidate user according to the transaction parameter of each candidate user and the total transaction parameters of all candidate users.
It should be noted that, when the task distribution server distributes the task to be distributed to each candidate user for the first time, a certain number of users may be selected from all users as candidate users, and the current configuration weight value, that is, the original configuration weight value, of each candidate user is determined. And distributing the tasks to be distributed to the target candidate users according to the original configuration weight values.
Wherein the target area may be understood as an area where a candidate user is selected. For example, if the game application is taken as an example, the target area may be one of a plurality of areas selected as the target area, that is, all users in the area are selected as the candidate users. The preset rule may be that the users in the area are divided into at least three levels according to the transaction parameters of the users in the area, and a certain number of users are selected from the three levels as candidate users. The transaction parameters refer to the amount of money charged by each user in the area. The total transaction parameter refers to the sum of transaction amounts of the candidate users. The original configuration weight value refers to the selected initial configuration weight value corresponding to each candidate user. That is, the original configuration weights are: and when the task distribution server distributes the task to be distributed to the candidate user for the first time, the current configuration weight value which needs to be referred to is obtained. It should be noted that a certain number of users may be randomly selected from the area as candidate users.
Specifically, a certain number of users are screened out from the target area according to a certain rule to serve as candidate users, transaction parameters corresponding to each candidate user are determined, and the transaction parameters of all the candidate users are summed to obtain total transaction parameters. The transaction parameters corresponding to each candidate user are divided by the total transaction parameters to obtain an original configuration weight value corresponding to each candidate user.
It should be noted that a certain number of users may also be randomly selected from all users as candidate users, and when distributing a task to the candidate users, the technical solution of the embodiment of the present disclosure may be adopted.
And S220, according to the number of the tasks in the tasks to be distributed, sequentially acquiring candidate users with high current configuration weight values corresponding to the number of the tasks from the candidate users as target candidate users.
The content in the tasks to be distributed includes the number of tasks, and optionally, the number of tasks in the tasks to be distributed is 5. And according to the task quantity in the tasks to be distributed and the current configuration weight value, acquiring candidate users with high original configuration weight values corresponding to the task quantity from the candidate users as target candidate users.
That is, the number of target candidate users is the same as the number of tasks to be distributed, and the current configuration weight values corresponding to the target candidate users are all higher than the current configuration weight values that are not the target candidate users.
S230, adjusting the configuration weight value of each candidate user according to the current configuration weight value so as to update the current configuration weight value.
After determining the target candidate user and distributing the task to be distributed to the target candidate user, the task distribution server may adjust the current configuration weight value, and use the current configuration weight value obtained after adjustment as a basis for the task to be distributed. The specific adjustment method for the current configuration weight can be understood by the above embodiments, and is not described in detail here.
And S240, stopping distributing the task to each candidate user when the current configuration weight value is detected to reach the preset threshold value.
And when the task distribution server detects that the current configuration weight reaches a preset threshold value, the task distribution is finished, namely the task is not distributed to the candidate users. The preset threshold value can be set by a user according to actual conditions, and is not limited herein.
According to the technical scheme of the embodiment of the disclosure, the target candidate users corresponding to the tasks to be distributed are determined according to the tasks to be distributed and the current configuration weight value of each candidate user, so that the tasks to be distributed are distributed to the target candidate users, the configuration weight value of each candidate user is adjusted according to the current configuration weight value, so that the current configuration weight value is updated, wherein the current configuration weight value is determined by the transaction parameters of each candidate user in the preset time, the technical problems that in the prior art, the tasks are randomly distributed to each user, the number of tasks received by users with higher transaction parameters is smaller than that of users with lower transaction parameters, the tasks are distributed unreasonably, and the user experience is poor are solved, the task distribution weight values corresponding to each candidate user are dynamically adjusted, and the rationality of the distributed tasks is improved, and high efficiency.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a task distributing apparatus provided in a third embodiment of the present disclosure, where the apparatus includes: a target candidate user determination module 310, and a configuration weight value determination module 320.
The target candidate user determining module is used for determining a target candidate user corresponding to the task to be distributed according to the task to be distributed and the current configuration weight value of each candidate user so as to distribute the task to be distributed to the target candidate user;
a configuration weight value determining module, configured to adjust the configuration weight value of each candidate user according to the current configuration weight value, so as to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
According to the technical scheme of the embodiment of the disclosure, the target candidate users corresponding to the tasks to be distributed are determined according to the tasks to be distributed and the current configuration weight value of each candidate user, so that the tasks to be distributed are distributed to the target candidate users, the configuration weight value of each candidate user is adjusted according to the current configuration weight value, so that the current configuration weight value is updated, wherein the current configuration weight value is determined by the transaction parameters of each candidate user in the preset time, the technical problems that in the prior art, the tasks are randomly distributed to each user, the number of times of tasks received by users with higher transaction parameters is smaller than that of users with lower transaction parameters, the tasks are distributed unreasonably, and the user experience is poor are solved, and the task distribution weight values corresponding to each candidate user are dynamically adjusted, the rationality and the high efficiency of the distribution task are improved.
On the basis of the above technical solution, before the target candidate user determining module is configured to determine, according to a task to be distributed and a current configuration weight value of each candidate user, a target candidate user corresponding to the task to be distributed, so as to distribute the task to be distributed to the target candidate user, the target candidate user determining module is further configured to:
acquiring at least two candidate users from a target area according to a preset rule, and determining an original configuration weight value corresponding to each candidate user according to the transaction parameter of each candidate user and the total transaction parameters of all candidate users;
and the original configuration weight value is a current configuration weight value corresponding to the task to be distributed which is firstly distributed to the candidate user.
On the basis of the above technical solutions, the target candidate user determination module is further configured to:
and according to the task quantity in the tasks to be distributed, sequentially acquiring candidate users with high current configuration weight values corresponding to the task quantity from the candidate users as target candidate users.
On the basis of the above technical solutions, the configuration weight value determining module further includes:
the first configuration weight value determining unit is used for obtaining a first to-be-adjusted configuration weight value corresponding to the target candidate user based on a first preset adjusting value and the configuration weight value corresponding to the target candidate user;
the second configuration weight value determining unit is used for obtaining a second to-be-adjusted configuration weight value corresponding to each candidate user based on a second preset adjusting value and the configuration weight value corresponding to each candidate user;
and the current configuration weight value determining unit is used for obtaining a current configuration weight value corresponding to each candidate user based on the first configuration weight value to be adjusted and a plurality of second configuration weight values to be adjusted.
On the basis of the above technical solutions, the apparatus further includes: a stop task distribution module to:
and when the current configuration weight value is detected to reach a preset threshold value, stopping distributing the tasks to each candidate user.
On the basis of the technical schemes, the transaction parameters comprise the recharge values of the candidate users; the task content in the tasks to be distributed comprises tasks of distributing gifts to the candidate users.
On the basis of the above technical solutions, the first preset adjustment value includes a constant one, and the second preset adjustment value includes a constant two.
The task distribution device provided by the embodiment of the disclosure can execute the task distribution method provided by any embodiment of the disclosure, and has corresponding functional modules and beneficial effects of the execution method.
It should be noted that, the units and modules included in the apparatus are merely divided according to functional logic, but are not limited to the above division as long as the corresponding functions can be implemented; in addition, specific names of the functional units are only used for distinguishing one functional unit from another, and are not used for limiting the protection scope of the embodiments of the present disclosure.
Example four
Referring now to fig. 4, a schematic diagram of an electronic device (e.g., the terminal device or the server of fig. 4) 400 suitable for implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, theelectronic device 400 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 401 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from astorage device 406 into a Random Access Memory (RAM) 403. In theRAM 403, various programs and data necessary for the operation of theelectronic apparatus 400 are also stored. Theprocessing device 401, theROM 402, and theRAM 403 are connected to each other via abus 404. An input/output (I/O)interface 405 is also connected tobus 404.
Generally, the following devices may be connected to the I/O interface 405:input devices 406 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; anoutput device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like;storage devices 406 including, for example, magnetic tape, hard disk, etc.; and acommunication device 409. The communication means 409 may allow theelectronic device 400 to communicate wirelessly or by wire with other devices to exchange data. While fig. 4 illustrates anelectronic device 400 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 409, or from the storage means 406, or from theROM 402. The computer program performs the above-described functions defined in the methods of the embodiments of the present disclosure when executed by theprocessing device 401.
The terminal provided by the embodiment of the present disclosure and the task distribution method provided by the embodiment belong to the same inventive concept, and technical details that are not described in detail in the embodiment of the present disclosure may be referred to the embodiment, and the embodiment of the present disclosure have the same beneficial effects.
EXAMPLE five
The disclosed embodiments provide a computer storage medium on which a computer program is stored, which when executed by a processor implements the task distribution method provided by the above embodiments.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to:
determining target candidate users corresponding to the tasks to be distributed according to the tasks to be distributed and the current configuration weight value of each candidate user, so as to distribute the tasks to be distributed to the target candidate users;
according to the current configuration weight value, adjusting the configuration weight value of each candidate user to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself, for example, the second configuration weight value determination unit may also be described as a "second weight value determination unit".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
According to one or more embodiments of the present disclosure, [ example one ] there is provided a task distribution method, the method comprising:
determining target candidate users corresponding to the tasks to be distributed according to the tasks to be distributed and the current configuration weight value of each candidate user, so as to distribute the tasks to be distributed to the target candidate users;
according to the current configuration weight value, adjusting the configuration weight value of each candidate user to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
According to one or more embodiments of the present disclosure, [ example two ] there is provided a task distribution method, further comprising:
optionally, before determining, according to the task to be distributed and the current configuration weight value of each candidate user, a target candidate user corresponding to the task to be distributed, so as to distribute the task to be distributed to the target candidate user, the method further includes:
acquiring at least two candidate users from a target area according to a preset rule, and determining an original configuration weight value corresponding to each candidate user according to the transaction parameter of each candidate user and the total transaction parameters of all candidate users;
and the original configuration weight value is a current configuration weight value corresponding to the task to be distributed which is firstly distributed to the candidate user.
According to one or more embodiments of the present disclosure, [ example three ] there is provided a task distribution method, further comprising:
optionally, the determining, according to the task to be distributed and the current configuration weight value of each candidate user, a target candidate user corresponding to the task to be distributed so as to distribute the task to be distributed to the target candidate user includes:
and according to the task quantity in the tasks to be distributed, sequentially acquiring candidate users with high current configuration weight values corresponding to the task quantity from the candidate users as target candidate users.
According to one or more embodiments of the present disclosure, [ example four ] there is provided a task distribution method, further comprising:
optionally, the adjusting the configuration weight value of each candidate user according to the current configuration weight value to update the current configuration weight value includes:
obtaining a first to-be-adjusted configuration weight value corresponding to the target candidate user based on a first preset adjustment value and the configuration weight value corresponding to the target candidate user;
obtaining a second to-be-adjusted configuration weight value corresponding to each candidate user based on the second preset adjustment value and the configuration weight value corresponding to each candidate user;
and obtaining a current configuration weight value corresponding to each candidate user based on the first configuration weight value to be adjusted and most of second configuration weight values to be adjusted.
According to one or more embodiments of the present disclosure, [ example five ] there is provided a task distribution method, further comprising:
optionally, when it is detected that the current configuration weight value reaches a preset threshold, the task is stopped being distributed to each candidate user.
According to one or more embodiments of the present disclosure, [ example six ] there is provided a task distribution method, further comprising:
optionally, the transaction parameter includes a top-up value of the candidate user; the task content in the tasks to be distributed comprises tasks of distributing gifts to the candidate users.
According to one or more embodiments of the present disclosure, [ example seven ] there is provided a task distributing apparatus comprising:
the target candidate user determining module is used for determining a target candidate user corresponding to the task to be distributed according to the task to be distributed and the current configuration weight value of each candidate user so as to distribute the task to be distributed to the target candidate user;
a configuration weight value determining module, configured to adjust the configuration weight value of each candidate user according to the current configuration weight value, so as to update the current configuration weight value;
wherein the current configuration weight value is determined by transaction parameters of each candidate user within a preset time.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims (10)

CN201910865327.8A2019-09-122019-09-12Task distribution method and device, electronic equipment and storage mediumPendingCN110633115A (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN201910865327.8ACN110633115A (en)2019-09-122019-09-12Task distribution method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN201910865327.8ACN110633115A (en)2019-09-122019-09-12Task distribution method and device, electronic equipment and storage medium

Publications (1)

Publication NumberPublication Date
CN110633115Atrue CN110633115A (en)2019-12-31

Family

ID=68971103

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN201910865327.8APendingCN110633115A (en)2019-09-122019-09-12Task distribution method and device, electronic equipment and storage medium

Country Status (1)

CountryLink
CN (1)CN110633115A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN111243710A (en)*2020-01-202020-06-05话媒(广州)科技有限公司Mental health service recommendation method and device based on interaction

Citations (5)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US20150379473A1 (en)*2014-06-302015-12-31Peercisely, Inc.System and methods for generating ranked job referrals
CN107146017A (en)*2017-05-032017-09-08梁丽华A kind of data processing method and device
CN107392655A (en)*2017-07-032017-11-24携程计算机技术(上海)有限公司Reward voucher method for pushing, system, storage medium, electronic equipment and shunt method
CN108629615A (en)*2017-12-062018-10-09南京天朝机网络科技有限公司A kind of method and device of engineering machinery management platform distribution reward coin
CN108764985A (en)*2018-05-172018-11-06上海炫栎网络科技有限公司Beat reward method, apparatus and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US20150379473A1 (en)*2014-06-302015-12-31Peercisely, Inc.System and methods for generating ranked job referrals
CN107146017A (en)*2017-05-032017-09-08梁丽华A kind of data processing method and device
CN107392655A (en)*2017-07-032017-11-24携程计算机技术(上海)有限公司Reward voucher method for pushing, system, storage medium, electronic equipment and shunt method
CN108629615A (en)*2017-12-062018-10-09南京天朝机网络科技有限公司A kind of method and device of engineering machinery management platform distribution reward coin
CN108764985A (en)*2018-05-172018-11-06上海炫栎网络科技有限公司Beat reward method, apparatus and system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN111243710A (en)*2020-01-202020-06-05话媒(广州)科技有限公司Mental health service recommendation method and device based on interaction

Similar Documents

PublicationPublication DateTitle
CN110278446B (en)Method and device for determining virtual gift display information and electronic equipment
CN110264262B (en)Data processing method and device based on user behavior and electronic equipment
CN110781373B (en)List updating method and device, readable medium and electronic equipment
CN110765354A (en)Information pushing method and device, electronic equipment and storage medium
CN110930226A (en)Financial product recommendation method and device, electronic equipment and storage medium
CN112379982A (en)Task processing method and device, electronic equipment and computer readable storage medium
CN110768861A (en)Method, device, medium and electronic equipment for obtaining overtime threshold
CN110516159A (en)A kind of information recommendation method, device, electronic equipment and storage medium
CN110827087B (en)Virtual article distribution method and device, electronic equipment and storage medium
CN111178781A (en)Response resource allocation method, device, equipment and medium of online response system
CN112182374A (en) Inventory control method, apparatus, electronic device and computer readable medium
CN111209432A (en)Information acquisition method and device, electronic equipment and computer readable medium
CN111694670B (en)Resource allocation method, apparatus, device and computer readable medium
CN110633115A (en)Task distribution method and device, electronic equipment and storage medium
CN113240108A (en)Model training method and device and electronic equipment
CN110602513B (en)Information processing method and device and electronic equipment
CN113242184A (en)Flow control method of distributed architecture and related equipment
CN111798251A (en)Verification method and device of house source data and electronic equipment
CN112148448B (en)Resource allocation method, apparatus, device and computer readable medium
CN112307320B (en)Information pushing method and device, mobile terminal and storage medium
CN113688312A (en)Price related information pushing method, device, equipment and computer readable medium
CN117412072A (en)Video resource management method and device, electronic equipment and storage medium
CN113554385A (en)Distribution robot control method, distribution robot control device, electronic equipment and computer readable medium
CN111985967A (en)Article information generation method and device, electronic equipment and computer readable medium
CN110222287A (en)Content displaying method, device, electronic equipment and computer readable storage medium

Legal Events

DateCodeTitleDescription
PB01Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
TA01Transfer of patent application right
TA01Transfer of patent application right

Effective date of registration:20230601

Address after:Room 802, Information Building, 13 Linyin North Street, Pinggu District, Beijing, 101299

Applicant after:Beijing youzhuju Network Technology Co.,Ltd.

Address before:No. 715, 7th floor, building 3, 52 Zhongguancun South Street, Haidian District, Beijing 100081

Applicant before:Beijing infinite light field technology Co.,Ltd.


[8]ページ先頭

©2009-2025 Movatter.jp