[go: up one dir, main page]

WO2018137611A1 - Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu - Google Patents

Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu Download PDF

Info

Publication number
WO2018137611A1
WO2018137611A1 PCT/CN2018/073799 CN2018073799W WO2018137611A1 WO 2018137611 A1 WO2018137611 A1 WO 2018137611A1 CN 2018073799 W CN2018073799 W CN 2018073799W WO 2018137611 A1 WO2018137611 A1 WO 2018137611A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
type
data
task
child
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.)
Ceased
Application number
PCT/CN2018/073799
Other languages
English (en)
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.)
Guizhou Baishancloud Technology Co Ltd
Original Assignee
Guizhou Baishancloud 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 Guizhou Baishancloud Technology Co Ltd filed Critical Guizhou Baishancloud Technology Co Ltd
Publication of WO2018137611A1 publication Critical patent/WO2018137611A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources

Definitions

  • the embodiments of the present invention are not limited to the field of computing technologies, and particularly relate to a task processing method, a node, a medium, a device, and a content distribution network.
  • a video transcoding task is often assigned to multiple processing nodes for transcoding.
  • each processing node needs to obtain complete pending data from the storage system separately, and then select some data for processing, which undoubtedly increases the network burden.
  • a processing node fails to process data, another processing node needs to re-acquire complete pending data from the storage system, which also increases the network burden.
  • An object of the embodiments of the present invention is to provide a task processing method, a node, a medium, a device, and a content distribution network, so as to reduce network load.
  • a task processing method is provided in a content distribution network, where the content distribution network includes: a storage node, a task scheduling node, and a plurality of task processing nodes, each task processing node includes: a first type of child node And a plurality of second type of child nodes, wherein the devices corresponding to the second type of child nodes are different, and the method includes:
  • the first type of child node obtains a to-be-processed task assigned by the task scheduling node to the task processing node where the first type of child node is located;
  • the first type of child node acquires to-be-processed data corresponding to the to-be-processed task from the storage node;
  • the first type of child node splits the data to be processed into a plurality of child data; the first type of child node allocates a plurality of child data to at least one second type of child node in the task processing node where the first type of child node is located. data processing;
  • the first type of child node merges the sub-data processed by each second type of child node in the task processing node where the first type of child node is located.
  • the method further includes: the first type of child node sends the merged data to the storage node.
  • the task scheduling node is assigned to the first type in the first type of child node.
  • the method further includes:
  • the task scheduling node obtains working state information of each task processing node and distance information of each task processing node to the storage node;
  • the task scheduling node determines a task processing node that executes the to-be-processed task according to the working state information and the distance information, and allocates the to-be-processed task to the determined task processing node.
  • the distance between each child node in each task processing node is less than the first preset distance.
  • the method further includes:
  • the first type of child node obtains a processing result of data processing of each second type of child node in the task processing node where the first type of child node is located;
  • the first type of child node allocates data processed by the failed second type of child node to the task processing node where the first type of child node is located, except for the second type of child node whose processing result is a failure.
  • Two types of child nodes perform data processing.
  • the embodiment of the present invention further provides a task processing node, which is located in a content distribution network, and each task processing node includes: a first type of child node and a plurality of second type of child nodes, wherein each second type of child node corresponds to
  • the devices of the first type include: a task obtaining unit, a data obtaining unit, a data splitting unit, a data distributing unit, and a data combining unit.
  • a task obtaining unit configured to obtain a task to be processed that is allocated by the task scheduling node to the task processing node where the first type of child node is located;
  • a data obtaining unit configured to acquire, from the storage node, data to be processed corresponding to the task to be processed
  • a data splitting unit configured to split the to-be-processed data into multiple sub-data
  • a data distribution unit configured to allocate multiple sub-data to the first-type sub-node
  • At least one second type of child node in the task processing node performs data processing
  • the data merging unit is configured to merge the sub-data processed by each second type of child node in the task processing node where the first type of child node is located.
  • the first type of child node further includes: a data sending unit, configured to send the merged data to the storage node.
  • the distance between each child node in each task processing node is less than the first preset distance.
  • the first type of child node further includes: a processing result obtaining unit and a redistribution unit,
  • a processing result obtaining unit configured to obtain, after the data distribution unit allocates the plurality of sub-data to the at least one second type of child node in the task processing node where the first type of child node is located, to obtain the first type of child node The processing result of data processing by each second type of child node in the task processing node;
  • a redistribution unit configured to allocate, to the task processing node where the first type of child node is located, the data processed by the failed second type child node, other than the second type child node whose processing result is a failure
  • a content distribution network provided by an embodiment of the present invention includes: a storage node, a task scheduling node, and a plurality of the foregoing task processing nodes,
  • the task scheduling node obtains load information of each task processing node and distance information of each task processing node to the storage node, determines a task processing node that executes the to-be-processed task according to the load information and the distance information, and allocates the to-be-processed task to the determined task processing. node;
  • the storage node stores the to-be-processed data corresponding to the task to be processed.
  • the embodiment of the present invention provides a computer readable storage medium, where the computer program stores a computer program, and when the program is executed by the processor, the steps of the foregoing method are implemented.
  • a computer device provided by an embodiment of the present invention includes a memory, a processor, and a computer program stored on the memory and operable on the processor, and the processor implements the steps of the foregoing method when executing the program.
  • the embodiment of the present invention provides a task processing method, a node, and a content distribution network.
  • the first type of child node obtains a task to be processed that is assigned by the task scheduling node to the task processing node where the first type of child node is located; Data to be processed corresponding to the task to be processed; splitting the data to be processed into a plurality of sub-data; assigning a plurality of sub-data to at least one second-type sub-node in the task processing node where the first-type sub-node is located for data processing And merging the processed sub-data of each second type of child node in the task processing node where the first type of child node is located.
  • the invention adopts the setting of the first type of child node, so that the second type of child node can directly acquire data from the first type of child node, and since the first type of child node performs data splitting, each second type of child node only You need to get the data you need to process from the first type of child nodes, which reduces the network burden.
  • the probability that the data transmission process is affected by the network instability factor is smaller, and the stability of the data transmission is improved.
  • FIG. 1 is a schematic structural diagram of a content distribution network according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a task processing method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of another task processing method according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of another task processing method according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a first type of child node according to an embodiment of the present invention.
  • a task processing method provided by an embodiment of the present invention is applied to a content distribution network, where the content distribution network may include: a storage node 001, a task scheduling node 003, and a plurality of task processing nodes 002, each task
  • the processing node 002 includes: a first type of child node 100 and a plurality of second type child nodes 200.
  • the devices corresponding to the second type of child nodes 200 are different.
  • the method may include:
  • the first type of child node 100 obtains a task to be processed that the task scheduling node 003 assigns to the task processing node 002 where the first type of child node 100 is located;
  • the storage node 001, the task scheduling node 003, and the plurality of task processing nodes 002 can be connected to each other.
  • each sub-node in each task processing node may be smaller than the first preset distance, or each sub-node in each task processing node is located in the same local area network. In this way, each sub-node within each task processing node can communicate efficiently.
  • the task processing node may be a cache node in the content distribution network.
  • multiple devices in a certain area may be planned as multiple child nodes in a task processing node according to service requirements, for example, planning a communication device of a telecommunication carrier in a certain city as multiple tasks in a task processing node. node.
  • each task processing node 002 there may be multiple task processing nodes 002 that are in communication with the storage node 001.
  • the first type of child nodes 100 and the plurality of second type of child nodes 200 in each task processing node 002 may be located in a preset geographic area. in.
  • the first type of child node 100 acquires to-be-processed data corresponding to the to-be-processed task from the storage node 001.
  • the to-be-processed task may be a video transcoding task, and the to-be-processed data may be a video file.
  • the distance between the storage node 001 and the task processing node 002 may be greater than the second preset distance. It may be understood that, for cost reasons, the storage node 001 and the task processing node 002 are often not disposed in the same area, and the distance between the two is far. .
  • the first-type child node 100 of the embodiment of the present invention can directly allocate the split to each second-type child node 200 without using each second.
  • the type sub-node 200 obtains the data to be processed from the storage node 001, respectively, which reduces the amount of data transmitted and the occupation of the network bandwidth.
  • the first type of child node 100 splits the to-be-processed data into multiple sub-data.
  • the first type of child node 100 allocates a plurality of sub-data to at least one second type of child node 200 in the task processing node 002 where the first type of child node 100 is located for data processing;
  • the first type of child node 100 merges the sub-data processed by each second type of child node 200 in the task processing node 002 where the first type of child node 100 is located.
  • the first type of child node 100 may send the merged data to the storage node 001.
  • the task processing method provided by the embodiment of the present invention enables the second type of child node to directly acquire data from the first type of child node through the setting of the first type of child node, and at the same time, the data is removed due to the first type of child node. Therefore, each second type of child node only needs to obtain the data that it needs to process from the first type of child node, which greatly reduces the network burden. At the same time, since the number of data transmissions between the node and the storage system is greatly reduced, the probability that the data transmission process is affected by the network instability factor is smaller, and the stability of the data transmission is improved.
  • the method may further include:
  • the task scheduling node 003 obtains the working state information of each task processing node 002 and the distance information of each task processing node 002 to the storage node 001;
  • the task scheduling node 003 determines, according to the working state information and the distance information, a task processing node that executes the to-be-processed task, and allocates the to-be-processed task to the determined task processing node.
  • the first type of child node 100 determines that the second type of child node is a child node of the unexecutable task.
  • the situation that the first type of child node 100 cannot obtain the working state information of the second type of child node is different, for example, the network connection of the first type child node 100 and the second type child node has a problem, or The second type of child node is down.
  • the working state of the second type child node 200 may include: load information of the second type child node 200, and the like.
  • the second type of child node 200 may be determined to be a second type of child node of the executable task and the task to be processed is allocated to the child node.
  • the processing result of the task processing node that processes the to-be-processed task may be obtained.
  • the process returns to step S001. In this way, the feedback mechanism ensures the successful execution of the task and improves the reliability of the system.
  • another task processing method provided by the embodiment of the present invention may further include: after step S400:
  • the first type of child node obtains a processing result of data processing of each second type of child node in the task processing node where the first type of child node is located;
  • the first type of child node allocates data processed by the failed second type of child node to the task processing node where the first type of child node is located, except for the second type of child node whose processing result is a failure.
  • the second type of child node performs data processing.
  • step S410 receives the processing results of the other second type of child nodes and continues to determine whether the processing results are all successful. Through this feedback mechanism, the data is successfully processed, the reliability of the system is improved, and the success rate of task execution is improved.
  • the task processing method provided by the embodiment of the present invention when the second type of child node fails to process data, the other second type of child node does not need to acquire data from the storage node, but directly fails the previous processing by the first type of child node.
  • the sub-data is sent to another second type of sub-node, which greatly reduces the amount of data transmitted, reduces the network burden, improves the concurrent execution of the task, and improves the data throughput capability of the system.
  • the embodiment of the present invention further provides a computer readable storage medium, where the computer program stores a computer program, and when the program is executed by the processor, the steps of the foregoing method are implemented.
  • a computer device further includes a memory, a processor, and a computer program stored on the memory and operable on the processor, and the processor implements the steps of the method when executing the program.
  • the embodiment of the present invention further provides a task processing node.
  • a task processing node is provided in the content distribution network.
  • the content distribution network may include: a storage node 001, a task scheduling node 003, and a plurality of task processing nodes 002, each task processing.
  • the node 002 includes: a first type of child node 100 and a plurality of second type child nodes 200, wherein each second type of child node 200 corresponds to different devices.
  • the first type of child node 100 may include : task obtaining unit 110, data obtaining unit 120, data splitting unit 130, data allocating unit 140, and data combining unit 150,
  • the task obtaining unit 110 is configured to obtain a task to be processed that the task scheduling node 003 assigns to the task processing node 002 where the first type of child node 100 is located;
  • the storage node 001, the task scheduling node 003, and the plurality of task processing nodes 002 can be connected to each other.
  • each sub-node in each task processing node may be smaller than the first preset distance, such as a CDN edge node of the same content distribution network, or the same equipment room, or the same area, or each task processing node.
  • Each child node is located in the same local area network. In this way, each sub-node within each task processing node can communicate efficiently.
  • the task processing node may be a cache node in the content distribution network.
  • multiple devices in a certain area may be planned as multiple child nodes in a task processing node according to service requirements, for example, planning a communication device of a telecommunication carrier in a certain city as multiple tasks in a task processing node. node.
  • each task processing node 002 there may be multiple task processing nodes 002 that are in communication with the storage node 001.
  • the first type of child nodes 100 and the plurality of second type of child nodes 200 in each task processing node 002 may be located in a preset geographic area. in.
  • the data obtaining unit 120 is configured to acquire, from the storage node 001, data to be processed corresponding to the task to be processed;
  • the to-be-processed task may be a video transcoding task, and the to-be-processed data may be a video file.
  • the distance between the storage node 001 and the task processing node 002 may be greater than the second preset distance. It may be understood that, for cost reasons, the storage node 001 and the task processing node 002 are often not disposed in the same area, and the distance between the two is far. .
  • the first-type child node 100 of the embodiment of the present invention can directly allocate the split to each second-type child node 200 without using each second.
  • the type sub-node 200 obtains the data to be processed from the storage node 001, respectively, which reduces the amount of data transmitted and the occupation of the network bandwidth.
  • a data splitting unit 130 configured to split the data to be processed into multiple sub-data
  • a data distribution unit 140 configured to allocate a plurality of sub-data to at least one second-type sub-node 200 in the task processing node 002 where the first-type child node 100 is located for data processing;
  • the data merging unit 150 is configured to merge the sub-data processed by the second type sub-nodes 200 in the task processing node 002 where the first-type child node 100 is located.
  • the first type of child node 100 may further include: a processing result obtaining unit and a redistribution unit.
  • a processing result obtaining unit configured to obtain the first type of child node after the data distribution unit 140 allocates the plurality of sub-data to the at least one second type of child node in the task processing node where the first type of child node is located for data processing The processing result of data processing performed by each second type of child node in the task processing node;
  • a redistribution unit configured to allocate, to the task processing node where the first type of child node is located, the data processed by the failed second type child node, other than the second type child node whose processing result is a failure
  • the processing result obtaining unit receives the processing result of the other second type of child nodes and continues to determine whether the processing result is successful.
  • the first type of child node 100 may further include: a data sending unit, configured to send the merged data to the storage node 001.
  • the task processing node provided by the embodiment of the present invention enables the second type of child node to directly acquire data from the first type of child node through the setting of the first type of child node, and at the same time, the data is removed due to the first type of child node. Therefore, each second type of child node only needs to obtain the data that it needs to process from the first type of child node, which greatly reduces the network burden.
  • an embodiment of the present invention further provides a content distribution network, which may include: a storage node 001, a task scheduling node 003, and a plurality of task processing nodes 002 described in the foregoing embodiments.
  • the task scheduling node 003 obtains the working state information of each task processing node 002 and the distance information of each task processing node 002 to the storage node 001, and determines the task processing node 002 that executes the to-be-processed task according to the load information and the distance information, and allocates the to-be-processed task. Processing node 002 for the determined task;
  • the storage node 001 stores the to-be-processed data corresponding to the task to be processed.
  • the first type of child node 100 determines that the second type of child node is a child node of the unexecutable task.
  • the situation that the first type of child node 100 cannot obtain the working state information of the second type of child node is different, for example, the network connection of the first type child node 100 and the second type child node has a problem, or The second type of child node is down.
  • the working state of the second type child node 200 may include: load information of the second type child node 200, and the like.
  • the second type of child node 200 may be determined to be a second type of child node of the executable task and the task to be processed is allocated to the child node.
  • the task scheduling node 003 can allocate a to-be-processed task to each task processing node according to the network condition, the geographical distribution, the number of processing nodes, the processing power of the processing node, and the load condition of each task processing node.
  • the content distribution network provided by the embodiment of the present invention enables the second type of child node to directly acquire data from the first type of child node through the setting of the first type of child node, and at the same time, the data is removed due to the first type of child node. Therefore, each second type of child node only needs to obtain the data that it needs to process from the first type of child node, which greatly reduces the network burden.
  • computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridge, magnetic tape, magnetic disk storage or other magnetic storage device, or may Any other medium used to store the desired information and that can be accessed by the computer.
  • communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .
  • the setting of the first type of child node enables the second type of child node to directly obtain data from the first type of child node, and since the first type of child node performs data splitting, each second The type child node only needs to obtain the data that it needs to process from the first type of child node, which effectively reduces the network burden.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multi Processors (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

L'invention concerne un procédé de traitement de tâche, un nœud, un support, un dispositif et un réseau de distribution de contenu. Le procédé comprend les étapes suivantes : acquérir, par un sous-nœud d'un premier type, une tâche à traiter attribuée par un nœud d'ordonnancement de tâches à un nœud de traitement de tâches où se trouve le sous-nœud du premier type ; acquérir des données à traiter correspondant à la tâche à traiter auprès d'un nœud de stockage ; diviser les données à traiter en une pluralité de sous-données ; attribuer la pluralité de sous-données à au moins un sous-nœud d'un deuxième type dans le nœud de traitement de tâches où se trouve le sous-nœud du premier type pour le traitement de données ; et fusionner les sous-données traitées par chaque sous-nœud du deuxième type dans le nœud de traitement de tâches où se trouve le sous-nœud du premier type. En agençant le sous-nœud du premier type, la présente invention signifie que le sous-nœud du deuxième type peut acquérir directement des données à partir du sous-nœud du premier type. Comme le sous-nœud du premier type divise les données, chaque sous-nœud du deuxième type n'a besoin d'acquérir, à partir du sous-nœud du premier type, que des données qu'il doit traiter lui-même, ce qui réduit la charge du réseau.
PCT/CN2018/073799 2017-01-24 2018-01-23 Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu Ceased WO2018137611A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710059992.9A CN107707592A (zh) 2017-01-24 2017-01-24 任务处理方法、节点及内容分发网络
CN201710059992.9 2017-01-24

Publications (1)

Publication Number Publication Date
WO2018137611A1 true WO2018137611A1 (fr) 2018-08-02

Family

ID=61169448

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/073799 Ceased WO2018137611A1 (fr) 2017-01-24 2018-01-23 Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu

Country Status (2)

Country Link
CN (1) CN107707592A (fr)
WO (1) WO2018137611A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109214132B (zh) * 2018-10-30 2023-06-30 中国运载火箭技术研究院 一种面向lvc仿真的非耦合流式大通量异步任务处理系统
CN111506400A (zh) * 2020-03-13 2020-08-07 平安国际智慧城市科技股份有限公司 计算资源分配系统、方法、装置和计算机设备
CN114845141A (zh) * 2022-04-18 2022-08-02 上海哔哩哔哩科技有限公司 边缘转码方法及装置
CN116743752A (zh) * 2023-08-11 2023-09-12 山东恒宇电子有限公司 一种分布式网络通讯实现数据处理负载均衡系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102638456A (zh) * 2012-03-19 2012-08-15 杭州海康威视系统技术有限公司 基于云计算的海量实时视频码流智能分析方法及其系统
CN103685558A (zh) * 2013-12-30 2014-03-26 常州大学 一种无线传感器网络及其任务处理方法
CN104239144A (zh) * 2014-09-22 2014-12-24 珠海许继芝电网自动化有限公司 一种多级分布式任务处理系统
CN104244025A (zh) * 2013-06-09 2014-12-24 北京同步科技有限公司 集群转码系统及其方法
CN104378665A (zh) * 2014-11-24 2015-02-25 深圳市天威视讯股份有限公司 一种基于数字电视的分布式转码系统及方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104102475B (zh) * 2013-04-11 2018-10-02 腾讯科技（深圳）有限公司 分布式并行任务处理的方法、装置及系统
CN103279351B (zh) * 2013-05-31 2016-06-29 北京高森明晨信息科技有限公司 一种任务调度的方法及装置
CN105893497A (zh) * 2016-03-29 2016-08-24 杭州数梦工场科技有限公司 一种任务处理方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102638456A (zh) * 2012-03-19 2012-08-15 杭州海康威视系统技术有限公司 基于云计算的海量实时视频码流智能分析方法及其系统
CN104244025A (zh) * 2013-06-09 2014-12-24 北京同步科技有限公司 集群转码系统及其方法
CN103685558A (zh) * 2013-12-30 2014-03-26 常州大学 一种无线传感器网络及其任务处理方法
CN104239144A (zh) * 2014-09-22 2014-12-24 珠海许继芝电网自动化有限公司 一种多级分布式任务处理系统
CN104378665A (zh) * 2014-11-24 2015-02-25 深圳市天威视讯股份有限公司 一种基于数字电视的分布式转码系统及方法

Also Published As

Publication number Publication date
CN107707592A (zh) 2018-02-16

Similar Documents

Publication Publication Date Title
US11762703B2 (en) Multi-region request-driven code execution system
US10372499B1 (en) Efficient region selection system for executing request-driven code
US8671134B2 (en) Method and system for data distribution in high performance computing cluster
CN106445473B (zh) 一种容器部署方法及装置
US20190260827A1 (en) Edge computing system, edge server, and system control method
US11831562B2 (en) Distributed database-driven resource management and locking in a cloud native mobile core network node architecture
WO2018149221A1 (fr) Procédé de gestion de dispositif, et système de gestion de réseau
WO2018137611A1 (fr) Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu
CN105808323A (zh) 一种虚拟机创建方法及系统
CN110244901B (zh) 任务分配方法及装置、分布式存储系统
CN103744719A (zh) 锁管理方法及系统、锁管理系统的配置方法及装置
CN112532674A (zh) 一种网络边缘计算系统的创建方法、装置及介质
US10802896B2 (en) Rest gateway for messaging
US9672073B2 (en) Non-periodic check-pointing for fine granular retry of work in a distributed computing environment
CN105893497A (zh) 一种任务处理方法和装置
US10164904B2 (en) Network bandwidth sharing in a distributed computing system
CN111163140A (zh) 资源获取和分配的方法、装置和计算机可读存储介质
US20160337470A1 (en) Method and server for assigning relative order to message by using vector clock and delivering the message based on the assigned relative order under distributed environment
US8903871B2 (en) Dynamic management of log persistence
EP3672203A1 (fr) Procédé de distribution pour le calcul de données distribué, dispositif, serveur et support de stockage
CN112099728A (zh) 一种执行写操作、读操作的方法及装置
WO2017045640A1 (fr) Procédé et appareil de programmation de bandes passantes de flux associés dans un centre de données
WO2018072450A1 (fr) Procédé de réplication de base de données géographique élastique
US10951732B2 (en) Service processing method and device
CN105607955A (zh) 一种计算任务分配的方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18745147

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18745147

Country of ref document: EP

Kind code of ref document: A1