CN109523187A - Method for scheduling task, device and equipment - Google Patents

Method for scheduling task, device and equipment Download PDF

Info

Publication number
CN109523187A
CN109523187A CN201811438026.9A CN201811438026A CN109523187A CN 109523187 A CN109523187 A CN 109523187A CN 201811438026 A CN201811438026 A CN 201811438026A CN 109523187 A CN109523187 A CN 109523187A
Authority
CN
China
Prior art keywords
task
pending
directed acyclic
acyclic graph
user
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201811438026.9A
Other languages
Chinese (zh)
Other versions
CN109523187B (en
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 ByteDance Network Technology Co Ltd
Original Assignee
Beijing ByteDance Network 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 ByteDance Network Technology Co Ltd filed Critical Beijing ByteDance Network Technology Co Ltd
Priority to CN201811438026.9A priority Critical patent/CN109523187B/en
Publication of CN109523187A publication Critical patent/CN109523187A/en
Application granted granted Critical
Publication of CN109523187B publication Critical patent/CN109523187B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Abstract

The embodiment of the invention discloses a kind of method for scheduling task, device and equipment, are related to software process field.The described method includes: according to the mission bit stream of at least two pending tasks of user, the directed acyclic graph of structuring user's task;Based on the directed acyclic graph, control executes at least two pending task.The present invention executes the pending task according to directed acyclic graph by constructing directed acyclic graph according to the mission bit stream of pending task, and task execution process is effectively managed and dispatched, the working efficiency of developer is improved.

Description

Method for scheduling task, device and equipment
Technical field
The present embodiments relate to software process field more particularly to a kind of method for scheduling task, device and equipment.
Background technique
In practical R&D process, developer can create task according to different business demands.The substantial amounts of task, Dependence is complicated.There is no effective measures to be managed task execution process, the working efficiency of developer can be reduced, increases Add workload.
Traditional task schedule is usually to be executed according to the first come, first served sequence of task or executed by certain priority.Than Such as, a total of three task queues are for executing task schedule, task of newly arriving at this time, can be assigned directly to number of tasks compared with In that few task queue.In related art scheme, task schedule there is a problem of following: task scheduling algorithm is according to spy Fixed priority executes task, frequently can lead to task of very short time only being needed to execute completion originally, because arranging Behind the task that many needs are completed for a long time, and enter in undying waiting.
Summary of the invention
The embodiment of the present invention provides a kind of method for scheduling task, device and equipment, is carried out with realizing to task execution process Effective management and scheduling.
In a first aspect, the embodiment of the invention provides a kind of method for scheduling task, which comprises
According to the mission bit stream of at least two pending tasks of user, the directed acyclic graph of structuring user's task;
Based on the directed acyclic graph, control executes at least two pending task.
Second aspect, the embodiment of the invention provides a kind of task scheduling apparatus, comprising:
Directed acyclic graph constructing module, for the mission bit stream according at least two pending tasks of user, construction is used The directed acyclic graph of family task;
Task execution module, for being based on the directed acyclic graph, control executes at least two pending task.
The third aspect, the embodiment of the invention provides a kind of task scheduling equipments, comprising:
One or more processors;
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processing Device realizes the method for scheduling task as described in any in the embodiment of the present invention.
Fourth aspect, the embodiment of the invention provides a kind of computer readable storage mediums, are stored thereon with computer journey Sequence, which is characterized in that the method for scheduling task as described in any in the embodiment of the present invention is realized when the program is executed by processor.
The present invention is held by constructing directed acyclic graph according to the mission bit stream of pending task according to directed acyclic graph The row pending task solves the pending task that developer faces substantial amounts, and dependence is complicated, working efficiency Low problem realizes and task execution process is effectively managed and dispatched, improves the working efficiency of developer Effect.
Detailed description of the invention
Fig. 1 is a kind of flow chart for method for scheduling task that the embodiment of the present invention one provides;
Fig. 2 is a kind of directed acyclic graph that the embodiment of the present invention one provides;
Fig. 3 is a kind of topological sorting figure that the embodiment of the present invention one provides;
Fig. 4 is a kind of flow chart of method for scheduling task provided by Embodiment 2 of the present invention;
Fig. 5 is a kind of structural schematic diagram for task scheduling apparatus that the embodiment of the present invention three provides;
Fig. 6 is a kind of structural schematic diagram for task scheduling equipment that the embodiment of the present invention four provides.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched The specific embodiment stated is used only for explaining the present invention rather than limiting the invention.It also should be noted that in order to just Only the parts related to the present invention are shown in description, attached drawing rather than entire infrastructure.
Embodiment one
Fig. 1 is a kind of flow chart for method for scheduling task that the embodiment of the present invention one provides, and the present embodiment is applicable to out Hair personnel face the pending task of substantial amounts, and dependence is complicated, and ineffective situation, this method can be by this hair Task scheduling apparatus that bright embodiment provides executes, as shown in Figure 1, this method can specifically include:
Step 101, the mission bit stream according at least two pending tasks of user, the directed acyclic of structuring user's task Figure.
Wherein, mission bit stream is to be filled in task data on preset interface by user and generated, different types of Business, mission bit stream are also different.Mission bit stream may include: user information, task names, responsible person's contact method and data source letter At least one of breath, can obtain or timing acquisition mission bit stream in real time.Believed according to the task of at least two pending tasks Breath is to construct directed acyclic graph, as soon as it to complete a customer service and need specifically, a customer service includes multiple tasks At all tasks for including in the customer service, and between different task have logicality, i.e., between different task there is according to The relationship of relying, and different task corresponds to different data sources, in other words, according to the number of at least two pending tasks of user According to dependence between source, the dependence of at least two pending tasks is determined.At least two pending tasks that determine it Between dependence after, according at least two pending tasks dependence, the directed acyclic graph of structuring user's task.Fig. 2 For a kind of directed acyclic graph, wherein task B, task C, task D depend on task A, task B to also rely on task D, task E according to Rely in task C and task D.
Step 102 is based on the directed acyclic graph, and control executes at least two pending task.
Wherein, in the mission bit stream according at least two pending tasks of user, the directed acyclic of structuring user's task After figure, topological sorting is carried out to the directed acyclic graph, it is specific: (1) that one is chosen first in directed acyclic graph without before The vertex (in-degree zero) of drive, the directed acyclic graph after outputting this to topological sorting;(2) this top is deleted from directed acyclic graph It puts and all using it as the line of tail;Above-mentioned two step is repeated, until figure is empty, or figure vertex that is not empty but can not find no forerunner Until.Fig. 3 be in Fig. 2 a kind of form of directed acyclic graph after topological sorting (because the same directed acyclic graph topology is arranged Sequence is not unique, and for the present embodiment by taking one of which sequence as an example, the present embodiment is not intended to limit topological sorting form).Obtaining topology After sequence, the pending task that in-degree current in the directed acyclic graph is zero is put into scheduling queue, it is contemplated that execute task The hardware resources such as machine CPU, memory can be occupied, therefore by one execution task number threshold value of setting, such as 100, i.e., just It must not exceed 100 executing task quantity.When the quantity for the task that is carrying out is less than setting threshold value, execute in scheduling queue Pending task.After the completion of detecting that pending task has executed, corresponding pending is updated in directed acyclic graph Whether the state of business, detecting has remaining pending task in directed acyclic graph, if so, then according in directed acyclic graph it is remaining to The topological order of execution task obtains the pending task that in-degree is zero and is put into scheduling queue.
The embodiment of the present invention is by constructing directed acyclic graph according to the mission bit stream of pending task, and according to directed acyclic Figure executes the pending task, solves the pending task that developer faces substantial amounts, dependence is complicated, work The problem of making low efficiency realizes and task execution process is effectively managed and dispatched, improve the work of developer The effect of efficiency.
Based on the above technical solution, it is being based on the directed acyclic graph, control executes described at least two wait hold After row task step, if may include: to detect any pending task execution failure, the report of the pending task is generated Alert information, and the warning message is sent according to the contact information of the pending task.The advantages of this arrangement are as follows user The progress that task can be obtained in real time can take counter-measure when having and executing mission failure in time.
Embodiment two
Fig. 4 is a kind of flow chart of method for scheduling task provided by Embodiment 2 of the present invention, and the present embodiment is applicable to obtain The case where obtaining and executing required by task code, this method can be executed by task scheduling apparatus provided in an embodiment of the present invention, As shown in figure 4, this method can specifically include:
Step 201, the mission bit stream according at least two pending tasks of user, the directed acyclic of structuring user's task Figure.
Step 202 is based on the directed acyclic graph, controls the starting of at least two pending task.
Based on directed acyclic graph, the starting opportunity of at least two pending tasks is determined.Illustratively, by the oriented nothing The pending task that current in-degree is zero in ring figure is put into scheduling queue;When the quantity for the task that is carrying out is less than setting threshold value When, execute the pending task in scheduling queue.
Step 203, according to reflecting between the task type and task type and Code Template of the pending task of starting Relationship is penetrated, determines pending Code Template.
Wherein, different task corresponds to different business demands, and different business demands corresponds to different task types, different Task type correspond to different Code Templates, Code Template is used to generate the code for running corresponding task needs.
Step 204, the pending Code Template for starting the parameter input of the pending task of starting, obtain pending generation Code.
Wherein, user inputs parameter into the Code Template of generation according to the needs of actual task, according to defeated containing user The Code Template for entering parameter obtains the code for running the required by task.
The code that step 205, execution obtain.
Wherein, when the quantity for the task that is carrying out is less than setting threshold value, the code executed executes corresponding Task.
By determining corresponding Code Template according to different task types, user inputs the embodiment of the present invention according to demand Parameter obtains code to the Code Template, solves the task in face of different task type, needs to write different code, work The problem of low efficiency, realizes the working efficiency for improving developer, shortens the effect of working time.
Embodiment three
Fig. 5 is a kind of structural schematic diagram for task scheduling apparatus that the embodiment of the present invention three provides, the task schedule dress Any method for scheduling task provided by the executable embodiment of the present invention is set, has the corresponding functional module of execution method and beneficial Effect.As shown in figure 5, the specific structure of the task scheduling apparatus is as follows: directed acyclic graph constructing module 31, task execution module 32;
The directed acyclic graph constructing module 31, for the mission bit stream according at least two pending tasks of user, The directed acyclic graph of structuring user's task;
The task execution module 32, for being based on the directed acyclic graph, it is pending that control executes described at least two Task.
On the basis of the above embodiments, the directed acyclic graph constructing module 31 specifically can be used for: according to user's Dependence between the data source of at least two pending tasks determines the dependence of at least two pending tasks;Foundation The dependence of at least two pending tasks, the directed acyclic graph of structuring user's task.
On the basis of the above embodiments, the task execution module 32 specifically can be used for: by the directed acyclic graph In current in-degree be zero pending task be put into scheduling queue;When the quantity for the task that is carrying out is less than setting threshold value, Execute the pending task in scheduling queue.
On the basis of the above embodiments, the task execution module 32 specifically can be also used for: according to described pending Mapping relations between the task type and task type and Code Template of task, determine pending Code Template;It will be described The parameter of pending task inputs the pending Code Template, obtains pending code;Execute obtained code.
It on the basis of the above embodiments, can also include alarm module, the report after the task execution module 32 Alert module is used for: if detecting any pending task execution failure, generate the warning message of the pending task, and according to The contact information of the pending task sends the warning message.
Task scheduling apparatus described in above-described embodiment is used to execute method for scheduling task any described in above-described embodiment, Technical principle is similar with the technical effect of generation, and which is not described herein again.
Example IV
Fig. 6 is a kind of structural schematic diagram for task scheduling equipment that the embodiment of the present invention four provides.In the embodiment of the present disclosure Terminal device can include but is not limited to such as mobile phone, laptop, digit broadcasting receiver, PDA (individual digital Assistant), PAD (tablet computer), PMP (portable media player), car-mounted terminal (such as vehicle mounted guidance terminal) etc. The fixed terminal of mobile terminal and such as number TV, desktop computer etc..Electronic equipment shown in Fig. 6 is only one and shows Example, should not function to the embodiment of the present disclosure and use scope bring any restrictions.
As shown in fig. 6, electronic equipment 40 may include processing unit (such as central processing unit, graphics processor etc.) 41, It can be loaded into random access storage device according to the program being stored in read-only memory (ROM) 42 or from storage device 48 (RAM) program in 43 and execute various movements appropriate and processing.In RAM 43, also it is stored with electronic equipment 40 and operates institute The various programs and data needed.Processing unit 41, ROM 42 and RAM 43 are connected with each other by bus 44.Input/output (I/ O) interface 45 is also connected to bus 44.
In general, following device can connect to I/O interface 45: including such as touch screen, touch tablet, keyboard, mouse, camera shooting The input unit 46 of head, microphone, accelerometer, gyroscope etc.;Including such as liquid crystal display (LCD), loudspeaker, vibrator Deng output device 47;Storage device 48 including such as tape, hard disk etc.;And communication device 49.Communication device 49 can be with Electronic equipment 40 is allowed wirelessly or non-wirelessly to be communicated with other equipment to exchange data.Although Fig. 6 is shown with various dresses The electronic equipment 40 set, it should be understood that being not required for implementing or having all devices shown.Can alternatively it implement Or have more or fewer devices.
Particularly, in accordance with an embodiment of the present disclosure, it may be implemented as computer above with reference to the process of flow chart description Software program.For example, embodiment of the disclosure includes a kind of computer program product comprising be carried on computer-readable medium On computer program, which includes the program code for method shown in execution flow chart.In such reality It applies in example, which can be downloaded and installed from network by communication device 49, or from 48 quilt of storage device Installation, or be mounted from ROM 42.When the computer program is executed by processing unit 41, the side of the embodiment of the present disclosure is executed The above-mentioned function of being limited in method.
It should be noted that the above-mentioned computer-readable medium of the disclosure can be computer-readable signal media or meter Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device, Or above-mentioned any appropriate combination.In the disclosure, computer readable storage medium can be it is any include or storage journey The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this In open, computer-readable signal media may include in a base band or as the data-signal that carrier wave a part is propagated, In carry computer-readable program code.The data-signal of this propagation can take various forms, including but not limited to Electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be computer-readable and deposit Any computer-readable medium other than storage media, the computer-readable signal media can send, propagate or transmit and be used for By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium Program code can transmit with any suitable medium, including but not limited to: electric wire, optical cable, RF (radio frequency) etc. are above-mentioned Any appropriate combination.
Above-mentioned computer-readable medium can be included in above-mentioned electronic equipment;It is also possible to individualism, and not It is fitted into the electronic equipment.
Above-mentioned computer-readable medium carries one or more program, when said one or multiple programs are by the electricity When sub- equipment executes, so that the electronic equipment: according to the mission bit stream of at least two pending tasks of user, structuring user's are appointed The directed acyclic graph of business;Based on the directed acyclic graph, control executes at least two pending task.
The calculating of the operation for executing the disclosure can be write with one or more programming languages or combinations thereof Machine program code, above procedure design language include object oriented program language-such as Java, Smalltalk, C+ +, it further include conventional procedural programming language-such as " C " language or similar programming language.Program code can Fully to execute, partly execute on the user computer on the user computer, be executed as an independent software package, Part executes on the remote computer or executes on a remote computer or server completely on the user computer for part. In situations involving remote computers, remote computer can pass through the network of any kind --- including local area network (LAN) Or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as utilize Internet service Provider is connected by internet).
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually It can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it to infuse Meaning, the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart can be with holding The dedicated hardware based system of functions or operations as defined in row is realized, or can use specialized hardware and computer instruction Combination realize.
Being described in unit involved in the embodiment of the present disclosure can be realized by way of software, can also be by hard The mode of part is realized.Wherein, the title of unit does not constitute the restriction to the unit itself under certain conditions.
Above description is only the preferred embodiment of the disclosure and the explanation to institute's application technology principle.Those skilled in the art Member is it should be appreciated that the open scope involved in the disclosure, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic Scheme, while should also cover in the case where not departing from design disclosed above, it is carried out by above-mentioned technical characteristic or its equivalent feature Any combination and the other technical solutions formed.Such as features described above has similar function with (but being not limited to) disclosed in the disclosure Can technical characteristic replaced mutually and the technical solution that is formed.

Claims (11)

1. a kind of method for scheduling task, which is characterized in that the described method includes:
According to the mission bit stream of at least two pending tasks of user, the directed acyclic graph of structuring user's task;
Based on the directed acyclic graph, control executes at least two pending task.
2. the method according to claim 1, wherein being believed according to the task of at least two pending tasks of user Breath, the directed acyclic graph of structuring user's task, comprising:
According to dependence between the data source of at least two pending tasks of user, at least two pending tasks are determined Dependence;
According to the dependence of at least two pending tasks, the directed acyclic graph of structuring user's task.
3. control execution is described at least the method according to claim 1, wherein being based on the directed acyclic graph Two pending tasks, comprising:
The pending task that in-degree current in the directed acyclic graph is zero is put into scheduling queue;
When the quantity for the task that is carrying out is less than setting threshold value, the pending task in scheduling queue is executed.
4. the method according to claim 1, wherein control executes at least two pending task, comprising:
According to the mapping relations between the task type and task type and Code Template of the pending task, determine to Execute Code Template;
The parameter of the pending task is inputted into the pending Code Template, obtains pending code;
Execute obtained code.
5. control execution is described at least the method according to claim 1, wherein being based on the directed acyclic graph After two pending tasks, further includes:
If detecting any pending task execution failure, the warning message of the pending task is generated, and wait holding according to this The contact information of row task sends the warning message.
6. a kind of task scheduling apparatus, which is characterized in that described device includes:
Directed acyclic graph constructing module, for the mission bit stream according at least two pending tasks of user, structuring user's are appointed The directed acyclic graph of business;
Task execution module, for being based on the directed acyclic graph, control executes at least two pending task.
7. device according to claim 6, which is characterized in that the directed acyclic graph constructing module is specifically used for:
According to dependence between the data source of at least two pending tasks of user, at least two pending tasks are determined Dependence;
According to the dependence of at least two pending tasks, the directed acyclic graph of structuring user's task.
8. device according to claim 6, which is characterized in that the task execution module is specifically used for:
The pending task that in-degree current in the directed acyclic graph is zero is put into scheduling queue;
When the quantity for the task that is carrying out is less than setting threshold value, the pending task in scheduling queue is executed.
9. device according to claim 6, which is characterized in that the task execution module is specifically also used to:
According to the mapping relations between the task type and task type and Code Template of the pending task, determine to Execute Code Template;
The parameter of the pending task is inputted into the pending Code Template, obtains pending code;
Execute obtained code.
10. a kind of task scheduling equipment, which is characterized in that the equipment includes:
One or more processors;
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real Now such as method for scheduling task as claimed in any one of claims 1 to 5.
11. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor Such as method for scheduling task as claimed in any one of claims 1 to 5 is realized when execution.
CN201811438026.9A 2018-11-27 2018-11-27 Task scheduling method, device and equipment Active CN109523187B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811438026.9A CN109523187B (en) 2018-11-27 2018-11-27 Task scheduling method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811438026.9A CN109523187B (en) 2018-11-27 2018-11-27 Task scheduling method, device and equipment

Publications (2)

Publication Number Publication Date
CN109523187A true CN109523187A (en) 2019-03-26
CN109523187B CN109523187B (en) 2021-08-03

Family

ID=65793436

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811438026.9A Active CN109523187B (en) 2018-11-27 2018-11-27 Task scheduling method, device and equipment

Country Status (1)

Country Link
CN (1) CN109523187B (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111190725A (en) * 2019-08-09 2020-05-22 腾讯科技(深圳)有限公司 Task processing method and device, storage medium and server
CN111258740A (en) * 2020-02-03 2020-06-09 北京无限光场科技有限公司 Method and device for starting application program and electronic equipment
CN111831424A (en) * 2019-04-17 2020-10-27 杭州海康威视数字技术股份有限公司 Task processing method, system and device
CN111984390A (en) * 2020-08-31 2020-11-24 平安医疗健康管理股份有限公司 Task scheduling method, device, equipment and storage medium
CN112052077A (en) * 2019-06-06 2020-12-08 北京字节跳动网络技术有限公司 Method, device, equipment and medium for software task management
CN112131297A (en) * 2020-09-28 2020-12-25 广州亚信技术有限公司 Data processing method, device, equipment and storage medium
CN112214289A (en) * 2019-07-11 2021-01-12 腾讯科技(深圳)有限公司 Task scheduling method and device, server and storage medium
CN112288249A (en) * 2020-10-20 2021-01-29 杭州鲸算科技有限公司 Business process execution method and device, computer equipment and medium
CN112732979A (en) * 2020-12-29 2021-04-30 五八有限公司 Information writing method, information writing device, electronic equipment and computer readable medium
CN112948068A (en) * 2020-09-16 2021-06-11 深圳市明源云科技有限公司 Task scheduling method and device and electronic equipment
CN113360203A (en) * 2021-04-20 2021-09-07 广东电网有限责任公司电力调度控制中心 Task unloading method and device for power Internet of things
CN113535367A (en) * 2021-09-07 2021-10-22 北京达佳互联信息技术有限公司 Task scheduling method and related device
CN113760488A (en) * 2020-08-28 2021-12-07 北京沃东天骏信息技术有限公司 Method, device, equipment and computer readable medium for scheduling task
CN113792292A (en) * 2021-09-14 2021-12-14 山石网科通信技术股份有限公司 Response method and device of security script, storage medium and processor
CN115658749A (en) * 2022-10-25 2023-01-31 工银瑞信基金管理有限公司 Directed acyclic graph-based fund product sorting method and device and electronic equipment
CN116302381A (en) * 2022-09-08 2023-06-23 上海数禾信息科技有限公司 Parallel topology scheduling component and method, task scheduling method and task processing method
CN116340436A (en) * 2023-03-14 2023-06-27 山东浪潮数字商业科技有限公司 Data packet processing scheduling method and device, medium and equipment
CN117032999A (en) * 2023-10-09 2023-11-10 之江实验室 CPU-GPU cooperative scheduling method and device based on asynchronous running

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101452487A (en) * 2008-12-31 2009-06-10 中国建设银行股份有限公司 Data loading method and system, and data loading unit
CN105912387A (en) * 2015-08-25 2016-08-31 乐视网信息技术(北京)股份有限公司 Method and device for dispatching data processing operation
CN108304255A (en) * 2017-12-29 2018-07-20 北京城市网邻信息技术有限公司 Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101452487A (en) * 2008-12-31 2009-06-10 中国建设银行股份有限公司 Data loading method and system, and data loading unit
CN105912387A (en) * 2015-08-25 2016-08-31 乐视网信息技术(北京)股份有限公司 Method and device for dispatching data processing operation
CN108304255A (en) * 2017-12-29 2018-07-20 北京城市网邻信息技术有限公司 Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111831424A (en) * 2019-04-17 2020-10-27 杭州海康威视数字技术股份有限公司 Task processing method, system and device
CN111831424B (en) * 2019-04-17 2023-09-05 杭州海康威视数字技术股份有限公司 Task processing method, system and device
CN112052077A (en) * 2019-06-06 2020-12-08 北京字节跳动网络技术有限公司 Method, device, equipment and medium for software task management
CN112214289A (en) * 2019-07-11 2021-01-12 腾讯科技(深圳)有限公司 Task scheduling method and device, server and storage medium
CN111190725A (en) * 2019-08-09 2020-05-22 腾讯科技(深圳)有限公司 Task processing method and device, storage medium and server
CN111258740A (en) * 2020-02-03 2020-06-09 北京无限光场科技有限公司 Method and device for starting application program and electronic equipment
CN113760488A (en) * 2020-08-28 2021-12-07 北京沃东天骏信息技术有限公司 Method, device, equipment and computer readable medium for scheduling task
CN111984390A (en) * 2020-08-31 2020-11-24 平安医疗健康管理股份有限公司 Task scheduling method, device, equipment and storage medium
CN112948068A (en) * 2020-09-16 2021-06-11 深圳市明源云科技有限公司 Task scheduling method and device and electronic equipment
CN112948068B (en) * 2020-09-16 2024-03-12 深圳市明源云科技有限公司 Task scheduling method and device and electronic equipment
CN112131297A (en) * 2020-09-28 2020-12-25 广州亚信技术有限公司 Data processing method, device, equipment and storage medium
CN112288249A (en) * 2020-10-20 2021-01-29 杭州鲸算科技有限公司 Business process execution method and device, computer equipment and medium
CN112732979A (en) * 2020-12-29 2021-04-30 五八有限公司 Information writing method, information writing device, electronic equipment and computer readable medium
CN112732979B (en) * 2020-12-29 2023-02-17 五八有限公司 Information writing method, information writing device, electronic equipment and computer readable medium
CN113360203A (en) * 2021-04-20 2021-09-07 广东电网有限责任公司电力调度控制中心 Task unloading method and device for power Internet of things
CN113535367B (en) * 2021-09-07 2022-01-25 北京达佳互联信息技术有限公司 Task scheduling method and related device
CN113535367A (en) * 2021-09-07 2021-10-22 北京达佳互联信息技术有限公司 Task scheduling method and related device
CN113792292A (en) * 2021-09-14 2021-12-14 山石网科通信技术股份有限公司 Response method and device of security script, storage medium and processor
CN116302381A (en) * 2022-09-08 2023-06-23 上海数禾信息科技有限公司 Parallel topology scheduling component and method, task scheduling method and task processing method
CN116302381B (en) * 2022-09-08 2024-02-06 上海数禾信息科技有限公司 Parallel topology scheduling component and method, task scheduling method and task processing method
CN115658749A (en) * 2022-10-25 2023-01-31 工银瑞信基金管理有限公司 Directed acyclic graph-based fund product sorting method and device and electronic equipment
CN115658749B (en) * 2022-10-25 2023-05-26 工银瑞信基金管理有限公司 Fund product ordering method and device based on directed acyclic graph and electronic equipment
CN116340436A (en) * 2023-03-14 2023-06-27 山东浪潮数字商业科技有限公司 Data packet processing scheduling method and device, medium and equipment
CN117032999A (en) * 2023-10-09 2023-11-10 之江实验室 CPU-GPU cooperative scheduling method and device based on asynchronous running
CN117032999B (en) * 2023-10-09 2024-01-30 之江实验室 CPU-GPU cooperative scheduling method and device based on asynchronous running

Also Published As

Publication number Publication date
CN109523187B (en) 2021-08-03

Similar Documents

Publication Publication Date Title
CN109523187A (en) Method for scheduling task, device and equipment
CN110096344A (en) Task management method, system, server cluster and computer-readable medium
CN110083660A (en) A kind of method, apparatus of synchrodata, medium and electronic equipment
CN109815007A (en) Thread control method, device, electronic equipment and storage medium based on cloud monitoring
CN109634490A (en) A kind of list display method, device, equipment and storage medium
CN109408205A (en) Method for scheduling task and device based on hadoop cluster
CN109840142A (en) Thread control method, device, electronic equipment and storage medium based on cloud monitoring
CN109214741A (en) A kind of method for early warning and early warning system of monitor control index
CN110334109A (en) Relational database data query method, system, medium and electronic equipment
CN110391938A (en) Method and apparatus for deployment services
CN109241033A (en) The method and apparatus for creating real-time data warehouse
CN110430142A (en) Method and apparatus for controlling flow
CN109597810A (en) A kind of task cutting method, device, medium and electronic equipment
CN108920618A (en) A kind of store method, device, medium and the electronic equipment of object reference relationship
CN109960212A (en) Task sending method and device
CN109814957A (en) A kind of label addition method and device for IOS system
CN109491646B (en) Message entry method and device, electronic equipment and readable medium
CN110135903A (en) Advertisement position ranks method, system, medium and electronic equipment
CN109828830A (en) Method and apparatus for managing container
CN109684059A (en) Method and device for monitoring data
US20230196182A1 (en) Database resource management using predictive models
CN108959636A (en) Data processing method, device, system, computer-readable medium
CN110045925A (en) Data processing method, device, electronic equipment and computer readable storage medium
CN109933727A (en) User's portrait generation method and system, user's portrait application method and system
CN110120959A (en) Big data method for pushing, device, system, equipment and readable storage medium storing program for executing

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant