Making up VMs from Many Weak Nodes of Edge Computing
来源:互联网 发布:战龙三国左慈进阶数据 编辑:程序博客网 时间:2024/06/07 02:13
In last blog we have discuss virtualization and using virtual machine to provide services for users. However, differences between cloud computing and edge computing make it impossible to apply theories of creating VMs and load balance mechanisms of cloud computing to edge computing directly. Firstly, resources of smart edge devices that make up edge computing nodes are relatively small and limited. Besides, due to the physical nodes of fog computing join and quit system frequently, tasks and resource change dynamically.
A graph repartition method is proposed by Song Ningning et al. to solve the above problem of edge computing[1]. The main idea of it is that dividing powerful physical machine into several virtual machine nodes and combining a number of weak physical machine to one virtual machine.
I、Dividing Powerful Physical Machine Nodes to Several VMs
The physical nodes in an edge computing system can be expressed as a non-directed and weight value connected graph
- We assume that resource required by a standard VM in this system is noted as
Δ . If resource of a physical machine greater thanΔ , then it will be divided intok VMs and a virtual physical node.k can be obtained by using this formula:k=res(Vpi)/Δ , whereres(Vpi) means resource of a physical machineVpi . A virtual physical node is composed by remnant resource that is not enough to make up one VM after removingk VMs from original physical machine. - All virtual physical nodes and original physical nodes that are smaller than
Δ are in collectionV′p . InitializingVnew={} and letEnew={} .
II、Combining Weak Physical Nodes to One VM
- In the collection
Ep , we select the edgee=<u,v> that is biggest link weight value and nodeu is an element of the collection ofV′p and not in the collectionVnew . When there are multiple choices, we choose the biggest one and putv into collectionVnew and pute into collectionEnew . Repeat this operation until all nodes inV′p are traversed and form a new collectionT={Vnew,Enew} . - Removing some low weighted edges in
T to form a forestF={fw} andres(fw)>Δ . - Physical nodes and virtual physical nodes of all the trees in the forest
F are aggregated to form a virtual machine node. - When physical nodes come in or drop out of the system, the system should repeat this algorithm to obtain a new partition scheme.
The process can be shown in the following picture.
Original Paper: Ningning, Song & Chao, Gong & Xingshuo, An & Qiang, Zhan. (2016). Fog computing dynamic load balancing mechanism based on graph repartitioning. China Communications. 13. 156-164. 10.1109/CC.2016.7445510.
- Making up VMs from Many Weak Nodes of Edge Computing
- The Coming of Edge Computing
- Eclipse - a tale of two VMs (and many classloaders)
- Types of Edge Computing Implementations——边缘计算的实现
- Application Scenarios of Edge Computing——边缘计算的应用场景
- Edge Computing Implementation Based on VM
- Edge Computing Implementation Based on Docker Containers
- Many world of warcraft account are available to choose from
- Making Use of JavaScript
- making sense of multitouch
- Making Sense of Multitouch
- Making Sense of Multitouch
- Making sense of LayoutInflater
- Making sense of word2vec
- Principle of Computing(1)
- Principle of Computing(2)
- The demise of Threat Management Gateway: Is Microsoft backing away from the edge?
- UVa 10223 - How many nodes ?
- 数据仓库中的几种数据模型
- SGISTL源码探究-关联式容器:map
- 崩溃.crash 文件分析
- Redis 脚本
- IntelliJ IDEA使用(3)——IDEA配置MAVEN
- Making up VMs from Many Weak Nodes of Edge Computing
- 从零开始前端学习[5]:关于html5默认标签样式的介绍以及定义清除
- 杭电4341-Gold miner(分组背包)
- Python OpenCV3 图像操作
- 吴恩达神经网络反向传播算法matlab作业疑问的解答
- python的for if语法
- 使用编辑之vim编辑器
- jqm 日期选择-c#.net
- 割点和桥