CN111275420A - Micro-computing power scheduling system oriented to heterogeneous environment - Google Patents

Micro-computing power scheduling system oriented to heterogeneous environment Download PDF

Info

Publication number
CN111275420A
CN111275420A CN202010062054.6A CN202010062054A CN111275420A CN 111275420 A CN111275420 A CN 111275420A CN 202010062054 A CN202010062054 A CN 202010062054A CN 111275420 A CN111275420 A CN 111275420A
Authority
CN
China
Prior art keywords
node
nodes
alliance
representative
calculation
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
CN202010062054.6A
Other languages
Chinese (zh)
Other versions
CN111275420B (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202010062054.6A priority Critical patent/CN111275420B/en
Publication of CN111275420A publication Critical patent/CN111275420A/en
Application granted granted Critical
Publication of CN111275420B publication Critical patent/CN111275420B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • 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
    • 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/104—Peer-to-peer [P2P] networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A micro-computing scheduling system oriented to heterogeneous environment comprises a node alliance constructed in a block chain network, wherein the node alliance comprises selected representative nodes; the rest nodes in the node alliance are connected with the representative node, and the representative node is in communication connection with the external blockchain network to perform data exchange; the representative node divides the calculation tasks according to the calculation resources of each node in the node alliance, dynamically adjusts the calculation task allocation of each node according to the use state of the calculation resources of each node, and then performs reward allocation according to the calculation amount contributed by each node. The system can reasonably organize and distribute tasks for the micro-computing power nodes, so that the micro-computing power nodes can more easily obtain benefits in the computing power competition of the block chain system, and the effective utilization of computing power resources is promoted.

Description

Micro-computing power scheduling system oriented to heterogeneous environment
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a micro-computing power scheduling system oriented to a heterogeneous environment.
Background
The core idea of the traditional block chain consensus mechanism is to ensure data consistency and consensus security by introducing the computational competition (Proof of workload of-word, PoW) of distributed nodes. In the block chain system, each node (i.e. miner) jointly solves a SHA256 mathematical problem (i.e. mining) which is complex to solve but easy to verify based on the mutual competition of respective computer computing power, and the node which solves the problem the fastest obtains block accounting weight and the yield generated by the system automatically. The consensus mechanism based on computational competition is the current block chain mainstream solution, which has the characteristic of 'Winner-takes-all'. This feature results in monopoly revenue for high computational power nodes but no revenue for low computational power nodes, and thus low computational power nodes participate in the blockchain activity very rarely. Due to the characteristic of heterogeneous computing power of the nodes in large-scale distributed resource management, reasonable benefits of low-computing-power nodes are difficult to obtain by adopting a traditional block chain consensus mechanism. It is necessary to solve these problems.
Disclosure of Invention
The technical problem to be solved by the invention is to overcome the defects of the prior art, and provide a micro computing power scheduling system oriented to the heterogeneous environment, which can realize reasonable organization and task allocation of micro computing power nodes, so that the micro computing power nodes can more easily obtain benefits in computing power competition of a block chain system, and the effective utilization of computing power resources is promoted.
The invention provides a micro-computing power scheduling system oriented to a heterogeneous environment, which comprises a node alliance constructed in a block chain network, wherein the node alliance comprises a selected representative node; the rest nodes in the node alliance are connected with the representative node, and the representative node is in communication connection with the external blockchain network to perform data exchange; the representative node divides the calculation tasks according to the calculation resources of each node in the node alliance, dynamically adjusts the calculation task allocation of each node according to the use state of the calculation resources of each node, and then performs reward allocation according to the calculation amount contributed by each node.
As a further technical scheme of the invention, the node alliance consists of nodes within a geographically set distance or nodes within the same unit or organization.
Further, the representative node may extend or prune the nodes in the node federation.
Further, the representative node employs the recent contribution partition mechanism and the current contribution partition mechanism to perform reward distribution on the nodes in the node alliance.
Further, the near contribution partitioning mechanism is specifically: after the node alliance obtains the reward, the representative node divides the reward according to the calculated amount contributed by each node in the set time, and if any node exits the node alliance before division of the reward, the node alliance divides the reward according to the calculated amount contributed by the node.
Further, the node obtains the reward according to the recent contribution dividing mechanism as follows:
Figure BDA0002373478580000021
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure BDA0002373478580000022
rewards earned for a federation of nodes.
Further, the current contribution partitioning mechanism is specifically: the representative node predicts the rewards that will be available at a set time in the future and then pre-pays the rewards based on the current computing power of each node in the federation of nodes.
Further, the node receives the following rewards based on the current contribution partitioning mechanism:
Figure BDA0002373478580000023
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure BDA0002373478580000024
predicting node alliance-to-T for representative node1The prize earned at that moment.
According to the invention, by utilizing the calculation task division and the reward division, low-computation-force nodes can be effectively scheduled in a heterogeneous environment, and more resources are provided for distributed resource management based on block chains; reasonable organization and task allocation of the micro-computing power nodes are realized, so that the micro-computing power nodes can more easily obtain benefits in computing power competition of a block chain system, and effective utilization of computing power resources is promoted.
Drawings
FIG. 1 is a schematic diagram of the system of the present invention.
Detailed Description
In a distributed network, there are a large number of large servers and workgroup computers, as well as a vast number of personal computers, which are all computational resources in the distributed network; with the development of blockchain networks, these computing resources are being utilized in the computing competition of blockchain systems to obtain block accounting rights and system benefits, such as benefits of bitcoins and related digital virtual currencies, in a manner that provides proof of workload. In the block chain system, compared with the micro-computing resources provided by a personal computer, a large server and a workgroup computer which have strong computing resources have obvious computing speed advantage, and because the consensus mechanism based on computing competition has the characteristic that winners eat all the money, namely, the nodes dug to the mine firstly obtain the whole money of the mine, and the nodes dug to the mine later do not generate any money any more, the micro-computing nodes are difficult to obtain the money in the computing competition.
In order to enable the micro-computing nodes to be actively added into the blockchain system, a large amount of idle computing resources in the network are fully utilized, and the micro-computing resources are scheduled by allocating proper rewards to the low-computing nodes, wherein the rewards are obtained by participation of a micro-computing node union in external computing competition.
Referring to fig. 1, the present embodiment provides a micro-computing scheduling system oriented to a heterogeneous environment, including a node federation constructed in a blockchain network, where the node federation includes a selected representative node; the rest nodes in the node alliance are connected with the representative node, and the representative node is in communication connection with the external blockchain network to perform data exchange; the representative node divides the calculation tasks according to the calculation resources of each node in the node alliance, dynamically adjusts the calculation task allocation of each node according to the use state of the calculation resources of each node, and then performs reward allocation according to the calculation amount contributed by each node.
A federation of nodes consists of nodes within a geographically set distance or within the same unit or organization.
The representative node may augment or tailor the nodes in the node federation. And adding the new node into the node alliance.
And the representative node adopts a recent contribution dividing mechanism and a current contribution dividing mechanism to carry out reward distribution on the nodes in the node alliance.
The near contribution dividing mechanism is specifically as follows: after the node alliance obtains the reward, the representative node divides the reward according to the calculated amount contributed by each node in the set time, and if any node exits the node alliance before division of the reward, the node alliance divides the reward according to the calculated amount contributed by the node.
The rewards the nodes obtain according to the recent contribution dividing mechanism are as follows:
Figure BDA0002373478580000041
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure BDA0002373478580000042
rewards earned for a federation of nodes.
The current contribution partitioning mechanism is specifically: the representative node predicts the rewards that will be available at a set time in the future and then pre-pays the rewards based on the current computing power of each node in the federation of nodes.
The node obtains the reward according to the present contribution dividing mechanism as follows:
Figure BDA0002373478580000043
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure BDA0002373478580000044
predicting node alliance-to-T for representative node1The prize earned at that moment.
When the computational competition of the node union lags behind other mining nodes in the blockchain network and does not reach the estimated reward value, namely
Figure BDA0002373478580000045
The partition method can still ensure the reward of the low-calculation-power nodes, and the income obtained by the low-calculation-power nodes is superior to the recent contribution partition; if the league exceeds the predicted reward, i.e.
Figure BDA0002373478580000046
The partitioning method partitions the excess rewards to the representative nodes as rewards for distributing computing tasks, and the low-computing-power nodes obtain lower income than the latest contribution partitioning.
By means of calculation task division and reward division, low-calculation-force nodes can be effectively scheduled in a heterogeneous environment, and more resources are provided for distributed resource management based on block chains; reasonable organization and task allocation of the micro-computing power nodes are realized, so that the micro-computing power nodes can more easily obtain benefits in computing power competition of a block chain system, and effective utilization of computing power resources is promoted.
The foregoing illustrates and describes the principles, general features, and advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are intended to further illustrate the principles of the invention, and that various changes and modifications may be made without departing from the spirit and scope of the invention, which is intended to be protected by the appended claims. The scope of the invention is defined by the claims and their equivalents.

Claims (8)

1. The micro-computing power scheduling system oriented to the heterogeneous environment is characterized by comprising a node alliance constructed in a block chain network, wherein the node alliance comprises selected representative nodes; the rest nodes in the node alliance are connected with the representative node, and the representative node is in communication connection with an external blockchain network to perform data exchange; the representative node divides the calculation tasks according to the calculation resources of each node in the node alliance, dynamically adjusts the calculation task allocation of each node according to the use state of the calculation resources of each node, and then performs reward allocation according to the calculation amount contributed by each node.
2. The system of claim 1, wherein the node federation consists of nodes within a geographically set distance or nodes within the same unit or organization.
3. The system of claim 1, wherein the representative node can extend or reduce nodes in a node federation.
4. The system of claim 1, wherein the representative node employs a recent contribution partitioning mechanism and a current contribution partitioning mechanism to allocate rewards to nodes in the node federation.
5. The system according to claim 4, wherein the recent contribution partitioning mechanism is specifically: after the node alliance obtains the reward, the representative node divides the reward according to the calculated amount contributed by each node in the set time, and if any node exits the node alliance before division of the reward, the node alliance divides the reward according to the calculated amount contributed by the node.
6. The system according to claim 5, wherein the rewards obtained by the nodes according to the recent contribution partitioning mechanism are:
Figure FDA0002373478570000011
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure FDA0002373478570000012
rewards earned for a federation of nodes.
7. The system according to claim 4, wherein the current contribution partitioning mechanism is specifically: the representative node predicts the rewards that will be available at a set time in the future and then pre-pays the rewards based on the current computing power of each node in the federation of nodes.
8. The system according to claim 7, wherein the node obtains the reward according to the current contribution partitioning mechanism as:
Figure FDA0002373478570000021
wherein i is the corresponding node, T0And T1Respectively calculating the starting time and the ending time of the node task; mhps (t) is the computational power level of node i at t,
Figure FDA0002373478570000022
predicting node alliance-to-T for representative node1The prize earned at that moment.
CN202010062054.6A 2020-01-19 2020-01-19 Micro-computing power scheduling system oriented to heterogeneous environment Active CN111275420B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010062054.6A CN111275420B (en) 2020-01-19 2020-01-19 Micro-computing power scheduling system oriented to heterogeneous environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010062054.6A CN111275420B (en) 2020-01-19 2020-01-19 Micro-computing power scheduling system oriented to heterogeneous environment

Publications (2)

Publication Number Publication Date
CN111275420A true CN111275420A (en) 2020-06-12
CN111275420B CN111275420B (en) 2022-10-14

Family

ID=70998839

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010062054.6A Active CN111275420B (en) 2020-01-19 2020-01-19 Micro-computing power scheduling system oriented to heterogeneous environment

Country Status (1)

Country Link
CN (1) CN111275420B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111324442A (en) * 2020-03-02 2020-06-23 李斌 Micro-computing power scheduling system oriented to heterogeneous environment
CN112003660A (en) * 2020-07-17 2020-11-27 北京大学深圳研究生院 Dimension measurement method of resources in network, calculation force scheduling method and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102655685A (en) * 2012-05-29 2012-09-05 福州大学 Task fault-tolerance allocation method for wireless sensor networks
CN103249129A (en) * 2013-04-17 2013-08-14 南京邮电大学 Optimal relay cooperation motivating method for wireless heterogeneous network
CN107734005A (en) * 2017-09-21 2018-02-23 扬州大学 One kind is based on intelligent body coalition formation method under Mobile Agent Technology
CN109934710A (en) * 2018-11-08 2019-06-25 杭州基尔区块链科技有限公司 The intelligent common recognition mechanism suitable for intellectual property alliance chain based on bilateral card

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102655685A (en) * 2012-05-29 2012-09-05 福州大学 Task fault-tolerance allocation method for wireless sensor networks
CN103249129A (en) * 2013-04-17 2013-08-14 南京邮电大学 Optimal relay cooperation motivating method for wireless heterogeneous network
CN107734005A (en) * 2017-09-21 2018-02-23 扬州大学 One kind is based on intelligent body coalition formation method under Mobile Agent Technology
CN109934710A (en) * 2018-11-08 2019-06-25 杭州基尔区块链科技有限公司 The intelligent common recognition mechanism suitable for intellectual property alliance chain based on bilateral card

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111324442A (en) * 2020-03-02 2020-06-23 李斌 Micro-computing power scheduling system oriented to heterogeneous environment
CN112003660A (en) * 2020-07-17 2020-11-27 北京大学深圳研究生院 Dimension measurement method of resources in network, calculation force scheduling method and storage medium
CN112003660B (en) * 2020-07-17 2022-03-18 北京大学深圳研究生院 Dimension measurement method of resources in network, calculation force scheduling method and storage medium

Also Published As

Publication number Publication date
CN111275420B (en) 2022-10-14

Similar Documents

Publication Publication Date Title
Chen et al. A game-based deep reinforcement learning approach for energy-efficient computation in MEC systems
Hoang et al. FBRC: Optimization of task scheduling in fog-based region and cloud
CN110247793B (en) Application program deployment method in mobile edge cloud
CN111275420B (en) Micro-computing power scheduling system oriented to heterogeneous environment
CN109791509A (en) High performance computing system and method
CN110109756A (en) A kind of network target range construction method, system and storage medium
CN105302650B (en) A kind of more resource fairness distribution methods of dynamic towards under cloud computing environment
Šlapak et al. Cost-effective resource allocation for multitier mobile edge computing in 5G mobile networks
Wu et al. Meccas: Collaborative storage algorithm based on alternating direction method of multipliers on mobile edge cloud
CN104580503A (en) Efficient dynamic load balancing system and method for processing large-scale data
Sedaghat et al. Autonomic resource allocation for cloud data centers: A peer to peer approach
Liu et al. A near-optimal approach for online task offloading and resource allocation in edge-cloud orchestrated computing
Wu et al. Towards collaborative storage scheduling using alternating direction method of multipliers for mobile edge cloud
CN105740085A (en) Fault tolerance processing method and device
Convolbo et al. DRASH: A data replication-aware scheduler in geo-distributed data centers
Chen et al. Miner revenue optimization algorithm based on Pareto artificial bee colony in blockchain network
CN114371931A (en) Service cluster resource allocation method and device and computer equipment
Yin et al. Effective task offloading heuristics for minimizing energy consumption in edge computing
CN103955397B (en) A kind of scheduling virtual machine many policy selection method based on micro-architecture perception
Yu et al. Adaptive resource scheduling in permissionless sharded-blockchains: A decentralized multiagent deep reinforcement learning approach
Pang et al. Online scheduling algorithms for unbiased distributed learning over wireless edge networks
CN111324442A (en) Micro-computing power scheduling system oriented to heterogeneous environment
Li et al. A study on flat and hierarchical system deployment for edge computing
Liu et al. Mobile satellite network virtual mapping algorithm based on node risk
CN111538560B (en) Virtual machine deployment method and device, electronic equipment and storage medium thereof

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