CN110011832B - Configuration issuing method and device for planned tasks - Google Patents
Configuration issuing method and device for planned tasks Download PDFInfo
- Publication number
- CN110011832B CN110011832B CN201910159495.5A CN201910159495A CN110011832B CN 110011832 B CN110011832 B CN 110011832B CN 201910159495 A CN201910159495 A CN 201910159495A CN 110011832 B CN110011832 B CN 110011832B
- Authority
- CN
- China
- Prior art keywords
- task object
- planned
- network point
- controlled network
- plan
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0695—Management of faults, events, alarms or notifications the faulty arrangement being the maintenance, administration or management system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0889—Techniques to speed-up the configuration process
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method and a device for configuration issuing of a plan task. Aiming at a controlled network node of the intelligent network node management system, the method calls a plurality of corresponding threads to match a plan task object list, and the plan task object list records the corresponding relation between a plan task object and the controlled network node; when the plan task object matched with any controlled network point is inquired, the inquired plan task object configuration is issued to any controlled network point, so that the configuration issue of the plan task object is flexibly and conveniently realized.
Description
Technical Field
The application relates to the technical field of networks, in particular to a method and a device for configuration and issuing of a planned task.
Background
An intelligent Network Management system, or centralized control, is a service platform integrating Management, monitoring and service configuration, and is used for managing VPN branch devices.
Disclosure of Invention
In view of this, the present application provides a method and an apparatus for issuing configuration of a scheduled task, which achieve stability and efficiency of issuing configuration of a scheduled task object.
In order to achieve the above purpose, the present application provides the following technical solutions:
according to a first aspect of the present application, a method for configuration and delivery of a planned task is provided, including:
aiming at a controlled network point of the intelligent network point management system, calling a plurality of corresponding threads to match a plan task object list, wherein the plan task object list records the corresponding relation between a plan task object and the controlled network point;
and when the plan task object matched with any controlled network point is inquired, the inquired plan task object configuration is issued to any controlled network point.
According to a second aspect of the present application, a device for configuring and issuing a planned task object is provided, including:
the matching unit is used for calling a plurality of corresponding threads to match a plan task object list aiming at a controlled network node of the intelligent network node management system, wherein the plan task object list records the corresponding relation between a plan task object and the controlled network node;
and the configuration unit is used for sending the configuration of the inquired plan task object to any controlled network point when the plan task object matched with any controlled network point is inquired.
According to the technical scheme, the plurality of threads corresponding to the controlled network points are called to match the planned task objects in the planned task object list, so that when the planned task objects matched with any controlled network point are inquired, the inquired planned task object configuration is issued to any controlled network point, the issuing efficiency of the planned task object configuration is improved, the configuration issuing process of the planned task objects cannot be hindered due to the fact that a single thread fails in the thread execution process, and the stability of the intelligent network point management system is improved.
Drawings
FIG. 1 is a flow chart of a method for configuration delivery of a planned task according to an exemplary embodiment of the present application;
FIG. 2 is a flow diagram of another method for configuration delivery of a planned task in an exemplary embodiment according to the present application;
FIG. 3 is a schematic block diagram of an electronic device in an exemplary embodiment in accordance with the present application;
FIG. 4 is a block diagram of a configuration issuing device for planning tasks in an exemplary embodiment according to the present application.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
The present application provides a configuration issuing scheme of a planning task, and for further explanation of the present application, the following embodiments are provided:
fig. 1 is a flowchart illustrating a configuration issuing method of a planned task according to an exemplary embodiment of the present application, where the method is applied to an intelligent website management system, and as shown in fig. 1, the method may include the following steps:
In an embodiment, the scheduled task object list includes a plurality of data segments, each data segment stores at least a part of the corresponding relationship between the attribute information of the scheduled task object and the controlled node identifier, and when the data segments are stored, the corresponding relationship between the attribute information of all the scheduled task objects and the controlled node identifier can be selected to be stored in each data segment, so that even if a certain data segment cannot be stored or read due to physical damage, the processor can call threads to access other data segments to realize corresponding functions, and the safety of the system is improved.
In another embodiment, all the scheduled task objects can be selected to be stored in each data segment, and only a part of the scheduled task objects are stored, unlike the case where all the scheduled task objects are stored in each data segment, so that the redundancy of storage is reduced, and the utilization efficiency of physical resources is improved.
The multiple threads can respectively match different data sections of the planned task object list, and different from the fact that the whole thread cannot continuously execute subsequent tasks due to exception in the polling process of a single thread in the related technology, the multiple threads are respectively executed, so that even if a certain thread dies due to exception, the thread pool can redistribute the threads to ensure the sequential execution of the tasks, and the stability of the system is improved.
In an embodiment, the structure of the data segment (i.e. segment) may be an array and a linked list structure, where any data segment has an element of the linked list structure corresponding to the data segment, and the element is composed of a plurality of scheduled task objects and nodes formed by corresponding relationships between the scheduled task objects and the controlled mesh points. Each node may include a data field to store a correspondence between a planned task object corresponding to the node and a controlled mesh point corresponding to the planned task and a pointer field.
The mapping relation between the data segments and the elements can be a hash function, so that when the elements are read or inserted from the data segments, the elements need to be positioned to the data segments through a hash algorithm, hash conflicts are reduced, all the elements stored in the planned task object list can be uniformly distributed in all the data segments, and the access efficiency of the task objects in the planned task object list is improved.
In an embodiment, the matching duration of each planned task object may be counted, and when the matching duration of any planned task object exceeds a first preset threshold, the task object is cancelled, and resources occupied by the planned task objects which are not successfully matched even if the matching duration of any planned task object exceeds the threshold are released in time, so that the operating efficiency of the system is improved.
And 102, when a plan task object matched with any controlled network point is inquired, transmitting the plan task configuration of the inquired plan task object to any controlled network point.
In one embodiment, scheduled task objects in a preconfigured database may be periodically polled and stored in the scheduled task object list when the execution time of the task object is reached or approached.
In the process of pre-configuring the planning tasks, the planning tasks are configured in the database instead of being directly added into the created planning task object list, so that the pre-configuration adding process of the planning task objects and the polling process of the task objects to be executed by calling threads are performed in different storage areas, the association relation between different execution processes about physical space is weakened, and the thread stacking for accessing the areas due to the use of the same area is avoided.
In an embodiment, the multiple threads may respectively match different data segments of the planned task object list, where any one of the data segments has a linked list corresponding thereto, and the linked list is composed of multiple planned task objects and nodes formed by correspondence between the planned task objects and the controlled mesh points.
When a single plan task object list which is not segmented is accessed, lock competition often exists among threads, namely, a lock mechanism of the plan task object list only allows the same thread to access at the same time, other threads need to be queued, and after the threads in progress finish accessing, the threads can access in sequence.
For the scheduled task object list containing different data segments, it can be simply understood that each data segment has a corresponding lock, so that in the process of accessing the data of different data segments in the container by multiple threads, when one thread occupies the lock access mechanism of one data segment, the data of other data segments can be accessed by other threads, the lock competition among threads is greatly reduced, and the concurrent access efficiency can be effectively improved.
In an embodiment, when the execution time of the planned task object issued by the configuration of any controlled node is obtained, and when the execution time exceeds a second preset threshold, the planned task object issued by the configuration to any controlled node is cancelled.
By the embodiment, the multi-thread corresponding to each controlled network point is called to respectively match the planned task object list, so that the matching time of each task object stored in the planned task object list is greatly shortened, and the running efficiency of the intelligent network point management system for task configuration and issuing of the controlled network points is improved.
Fig. 2 is a flowchart of another configuration issuing method of a planned task according to an exemplary embodiment of the present application, and as shown in fig. 2, the method may include the following steps:
In an embodiment, a scheduled task object list for a project may be created in an initialization process when the project is started, where the scheduled task object list may be in a linked list structure, the created scheduled task object list may be an empty table, or a corresponding relationship between a fixed website identifier and a scheduled task object may be pre-stored on the basis of the empty table, which is not limited in this application.
In one embodiment, the plurality of threads respectively start polling the scheduled tasks configured in the database, the polling process is different from the sequential execution process of a single thread, and the execution time between the threads can be objectively overlapped with each other.
Taking thread 1 and thread 2 as examples, if the polling operation of thread 1 on scheduled task object 1 in the database is a1, a2, a3, and the polling operation of thread 2 on scheduled task object 2 in the database is b1, b2, b3, the execution sequence of the polling process for scheduled task object 1 and scheduled task object 2 in the database in the related art is a1, a2, a3, b1, b2, b3 or b1, b2, b3, a1, a2, a3, so that the polling sequence of each scheduled task object is necessarily observed.
And the two threads poll the planned task object 1 and the planned task object 2 in the database at the same time, so that the actual execution sequence of the system on the planned task object 1 and the planned task object 2 is changed into a1, b1, a2, b2, a3, b3 or b1, a1, b2, a2, b3 and a3, and the execution time is also shortened to half of the original execution time, therefore, the access of the multiple threads to the database respectively forms multi-thread multiplexing of one processor for accessing the database, the threads do not influence each other, and the utilization efficiency of limited physical resources is improved.
In an embodiment, a preset time interval is set to trigger polling of each scheduled task object configured in a database, an execution time corresponding to the scheduled task object is obtained, and if the execution time is close to the execution time, the task object is stored in a pre-created scheduled task object list.
In a specific example, if the time difference between the current time and the acquired execution time is less than a preset time threshold, the task object is triggered to be stored in a pre-created planned task object list, and a certain time difference value is set between the triggered execution and the planned execution, so that delayed execution of the planned task object due to frequent abnormal conditions is avoided.
In an embodiment, the planned task object configured in the database may be pre-configured or created in real time by an administrator, and the created planned task object may include attribute information such as a planned task object identifier, a task type, a website identifier, a creation time, a task state, and the like, where the task type may include a software upgrade, an AP upgrade, a feature library upgrade, a device restart, a network node disabled, a network node deleted, and the like, and the task state may include a network node waiting to be executed, a network node being executed, a network node successfully executed, a network node failed to be executed, and the like.
In this embodiment, a combination of the acquired attribute information of each scheduled task object is used as a set of input, and the input is mapped based on a preset hash function to obtain a corresponding hash value.
In an embodiment, the attribute information of the planned task object to be executed may include ID information, execution state, and the like of the planned task object, and the content of the specific attribute information is not limited in the present application.
In an embodiment, the created correspondence between the controlled mesh point identifier and the hash value may be in the form of a key value pair, where each attribute information of the planned task object is used as a value, and the mesh point identifier is used as a key value, and in the process of implementing the underlying layer, the value corresponding to the attribute information of each planned task object may be stored in the storage space identifier "key value" in a self-balancing tree manner such as a hash table or a B-tree, so that the value may be accessed by calling the key value, and the efficiency of the system for reading data is improved.
Taking the algorithm of the hash table as an example, the hash value corresponding to the attribute information may be determined through a preset hash function, and then the hash value may be used as a value corresponding to the mesh point identifier as a key value, so that when the number of planned task objects of a controlled mesh point is large, the controlled mesh point may be corresponded through setting a plurality of mesh point identifiers, and then each planned task object may be hashed in the plurality of mesh point identifiers more uniformly. In addition, a common overflow area may be established to store data that conflicts from computations.
And step 206, storing the corresponding relation into a data segment corresponding to a preset classification rule in the planned task object list.
In an embodiment, the segmentation may be performed in advance according to the dot identifiers, and as a specific embodiment, the segmentation may be performed by: for the network point identifiers with the identification sequence number between 001 and 100, the corresponding relations between the planned task objects of the controlled network points corresponding to the network point identifiers and the network point identifiers are all stored in the same data segment, and similarly, for the network point identifiers with the identification sequence number between 101 and 200, the corresponding relations between the planned tasks of the controlled network points corresponding to the network point identifiers and the network point identifiers are stored in the same data segment, and so on. The identification sequence number of the website identification may also be classified according to other methods, or the obtained corresponding relationship may be classified according to other attribute information, such as the sequence number of the established corresponding relationship, which is not limited in the present application.
In an embodiment, the preset rule may use a hash function, the planned task object list may be divided into a plurality of data segments according to a hash value, each correspondence to be stored may be a node in a data segment, in a specific implementation process, the mesh point identifier may be used as a pre-map, and the planned task object corresponding to the mesh point identifier is stored into the data segment corresponding to the hash value based on the hash value corresponding to the mesh point identifier.
In an embodiment, the scheduled task object list can be polled in a keep-alive interface of an http long link established between the intelligent website management system and the controlled website device. In a specific embodiment, the serial number sent by the device is obtained, and the mesh point identifier is found out according to the serial number sent by the device, so that the scheduling task objects stored in the scheduling task object list are matched according to the mesh point identifier calling thread.
In an embodiment, each thread may correspond to one or more controlled mesh points, such that concurrent execution of the task matching process is achieved by invoking multiple threads to match task objects in the planned task object list.
In step 208, it is determined whether a scheduled task object matching any of the controlled nodes is found within the time threshold, if yes, step 209 is performed, otherwise step 213 is performed.
And step 209, transmitting the queried planned task object configuration to the corresponding controlled network point.
In an embodiment, a plan task object issued to a controlled network point is determined, and the execution state of the plan task object is modified, so that the execution state of the plan task object can be known according to the attribute information of the plan task object. In a specific embodiment, the execution state information of the scheduled task object stored in the scheduled task object list may be modified, and the execution state information corresponding to the scheduled task object stored in the database may be optionally modified.
In step 211, it is determined whether the duration of the execution time exceeds a preset threshold, and if so, step 213 is executed.
In an embodiment, the scheduled task object may be deleted at the same time or after the scheduled task object is cancelled, only the scheduled task object in the scheduled task object list may be selected to be deleted, or the scheduled task object configured in the database may be deleted at the same time.
In the above embodiment, the scheduled task objects in the scheduled task object list are polled by invoking multiple threads, so that the execution times among the threads can be objectively overlapped with each other, that is, when the polling of one thread on a certain data segment is not finished, another data segment can start to receive the access of other threads at the same time, and the access of the scheduled task objects of different data segments is not affected, thereby realizing the concurrent execution of the scheduled task objects to be configured and issued by the intelligent network management system, further realizing the effective management of the intelligent network management system on the task configuration and issuing of the controlled network equipment, simplifying the equipment operation of the controlled network, realizing the efficiency of efficient multi-point execution of a manager, and flexibly and conveniently realizing the configuration and issuing of the scheduled task objects.
FIG. 3 is a schematic block diagram of an electronic device in an exemplary embodiment in accordance with the present application. Referring to fig. 3, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, but may also include hardware required by other services. The processor reads the corresponding computer program from the nonvolatile memory to the memory and then runs the computer program to form a configuration issuing device of the planned task on a logic level. Of course, besides the software implementation, the present application does not exclude other implementations, such as logic devices or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or logic devices.
Referring to fig. 4, in a software implementation, the configuration issuing device for the planning task may include:
a matching unit 401, configured to invoke a plurality of corresponding threads to match a planned task object list for a controlled node of the intelligent node management system, where a corresponding relationship between a planned task object and the controlled node is recorded in the planned task object list;
and the configuration unit 402, when a plan task object matched with any controlled network point is queried, configured and issued to the any controlled network point.
Optionally, the method further includes:
a counting unit 403 for counting the matching duration for each planned task object;
and a first canceling unit 404 for canceling any one of the planned task objects when the matching time of the task object exceeds a first preset threshold.
Optionally, the method further includes:
an obtaining unit 405, configured to obtain a time for any controlled network to execute a configured and issued scheduled task object;
and a second canceling unit 406, configured to cancel the scheduled task object issued to any of the controlled nodes when the execution time exceeds a second preset threshold.
Optionally, the invoking unit includes: and the multiple threads respectively match different data sections of the planned task object list, wherein the data sections store the corresponding relation between the attribute information of the planned task object and the controlled network point identifier.
The device corresponds to the method, and more details are not repeated.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. In other instances, features described in connection with one embodiment may be implemented as discrete components or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (8)
1. A configuration issuing method of a planned task object is applied to an intelligent network management system, and the method comprises the following steps:
aiming at a controlled network point of the intelligent network point management system, calling a plurality of corresponding threads to match a plan task object list, wherein the threads correspond to the controlled network point, and the plan task object list records the corresponding relation between a plan task object and the controlled network point;
when a plan task object matched with any controlled network point is inquired, the inquired plan task object configuration is issued to any controlled network point;
the method for matching the planned task object list by calling the corresponding threads comprises the following steps of:
and the multiple threads are used for respectively matching different data sections of the plan task object list.
2. The method of claim 1, wherein each thread corresponds to one or more controlled mesh points.
3. The method of claim 1, further comprising:
counting the matching time length of each plan task object;
and when the matching time length of any one planned task object exceeds a first preset threshold value, canceling the task object.
4. The method of claim 1, further comprising:
acquiring the execution time of any controlled network on a configured and issued plan task object;
and when the execution time exceeds a second preset threshold value, canceling the configuration of the planned task object issued to any controlled network point.
5. The method of claim 1, further comprising:
regularly polling a planned task object in a pre-configured database;
and when the execution time of the planning task object is reached or approached, storing the planning task object into the planning task object list.
6. A configuration issuing device for a planned task is applied to an intelligent network management system, and the device comprises:
the matching unit is used for calling a plurality of corresponding threads to match a planned task object list aiming at a controlled network point of the intelligent network point management system, wherein the threads correspond to the controlled network point, and the corresponding relation between a planned task object and the controlled network point is recorded in the planned task object list;
the configuration unit is used for configuring and issuing the inquired plan task object to any controlled network point when the plan task object matched with the controlled network point is inquired;
the planned task object list comprises a plurality of data segments, each data segment stores the corresponding relation between the attribute information of at least a part of the planned task object and the controlled network point identifier, and the matching unit comprises:
and the multiple threads are used for respectively matching different data sections of the plan task object list.
7. The apparatus of claim 6, further comprising:
the statistical unit is used for counting the matching time length of each plan task object;
and the first canceling unit cancels the task object when the matching time of any one of the planned task objects exceeds a first preset threshold.
8. The apparatus of claim 6, further comprising:
the acquisition unit is used for acquiring the execution time of any controlled network on the configured and issued planned task object;
and the second canceling unit cancels the configuration of the planned task object issued to any controlled network point when the execution time exceeds a second preset threshold value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910159495.5A CN110011832B (en) | 2019-03-04 | 2019-03-04 | Configuration issuing method and device for planned tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910159495.5A CN110011832B (en) | 2019-03-04 | 2019-03-04 | Configuration issuing method and device for planned tasks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110011832A CN110011832A (en) | 2019-07-12 |
| CN110011832B true CN110011832B (en) | 2022-01-25 |
Family
ID=67166277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910159495.5A Active CN110011832B (en) | 2019-03-04 | 2019-03-04 | Configuration issuing method and device for planned tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110011832B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113722007B (en) * | 2021-08-24 | 2023-11-03 | 杭州迪普科技股份有限公司 | Configuration method, device and system of VPN branch equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105656660A (en) * | 2014-12-02 | 2016-06-08 | 中兴通讯股份有限公司 | Task management and scheduling method, device and system |
| CN106657195A (en) * | 2015-11-02 | 2017-05-10 | 北大方正集团有限公司 | Task processing method and relay device |
| CN106789166A (en) * | 2016-11-28 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | A kind of method and device of network element batch configuration |
| CN107193579A (en) * | 2017-03-29 | 2017-09-22 | 武汉斗鱼网络科技有限公司 | The implementation method and device of plan target |
| CN107608773A (en) * | 2017-08-24 | 2018-01-19 | 阿里巴巴集团控股有限公司 | task concurrent processing method, device and computing device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060294058A1 (en) * | 2005-06-28 | 2006-12-28 | Microsoft Corporation | System and method for an asynchronous queue in a database management system |
-
2019
- 2019-03-04 CN CN201910159495.5A patent/CN110011832B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105656660A (en) * | 2014-12-02 | 2016-06-08 | 中兴通讯股份有限公司 | Task management and scheduling method, device and system |
| CN106657195A (en) * | 2015-11-02 | 2017-05-10 | 北大方正集团有限公司 | Task processing method and relay device |
| CN106789166A (en) * | 2016-11-28 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | A kind of method and device of network element batch configuration |
| CN107193579A (en) * | 2017-03-29 | 2017-09-22 | 武汉斗鱼网络科技有限公司 | The implementation method and device of plan target |
| CN107608773A (en) * | 2017-08-24 | 2018-01-19 | 阿里巴巴集团控股有限公司 | task concurrent processing method, device and computing device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110011832A (en) | 2019-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109033123B (en) | Big data-based query method and device, computer equipment and storage medium | |
| CN107423942B (en) | Service transfer method and device | |
| CN106708608A (en) | Distributed lock service method and acquisition method, and corresponding device | |
| CN111709723B (en) | RPA business process intelligent processing method, device, computer equipment and storage medium | |
| CN112866314B (en) | Method for switching slave nodes in distributed master-slave system, master node device and storage medium | |
| CN110011832B (en) | Configuration issuing method and device for planned tasks | |
| CN113946427A (en) | Task processing method, processor and storage medium for multi-operating system | |
| CN115756955A (en) | Data backup and data recovery method and device and computer equipment | |
| CN116521363B (en) | Code packaging method, computer equipment and storage medium | |
| CN110968406B (en) | Method, device, storage medium and processor for processing task | |
| CN110928941A (en) | Data fragment extraction method and device | |
| US7127446B1 (en) | File system based task queue management | |
| CN114780217B (en) | Task scheduling method, device, computer equipment and medium | |
| CN116308848A (en) | Information processing method, apparatus, computer device, and storage medium | |
| CN114201284A (en) | Timed task management method and system | |
| CN108073453B (en) | Method and device for scheduling CPU (Central processing Unit) resources in distributed cluster | |
| CN108829709A (en) | Distributed database management method, apparatus, storage medium and processor | |
| US11531642B2 (en) | Synchronous object placement for information lifecycle management | |
| CN114647663A (en) | Resource processing method, device and system, electronic equipment and storage medium | |
| CN112685334A (en) | Method, device and storage medium for block caching of data | |
| US8738864B2 (en) | Automated data interface generation | |
| CN113886349A (en) | Charging system parameter loading sharing method and device and computing equipment | |
| CN111767299A (en) | Database operation method, device and system, storage medium and electronic equipment | |
| CN111078258A (en) | Version upgrading method and device | |
| CN111221847A (en) | Monitoring data storage method and device and computer readable storage medium |
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 |