首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.

Purpose

The objective of this study is to optimize task scheduling and resource allocation using an improved differential evolution algorithm (IDEA) based on the proposed cost and time models on cloud computing environment.

Methods

The proposed IDEA combines the Taguchi method and a differential evolution algorithm (DEA). The DEA has a powerful global exploration capability on macro-space and uses fewer control parameters. The systematic reasoning ability of the Taguchi method is used to exploit the better individuals on micro-space to be potential offspring. Therefore, the proposed IDEA is well enhanced and balanced on exploration and exploitation. The proposed cost model includes the processing and receiving cost. In addition, the time model incorporates receiving, processing, and waiting time. The multi-objective optimization approach, which is the non-dominated sorting technique, not with normalized single-objective method, is applied to find the Pareto front of total cost and makespan.

Results

In the five-task five-resource problem, the mean coverage ratios C(IDEA, DEA) of 0.368 and C(IDEA, NSGA-II) of 0.3 are superior to the ratios C(DEA, IDEA) of 0.249 and C(NSGA-II, IDEA) of 0.288, respectively. In the ten-task ten-resource problem, the mean coverage ratios C(IDEA, DEA) of 0.506 and C(IDEA, NSGA-II) of 0.701 are superior to the ratios C(DEA, IDEA) of 0.286 and C(NSGA-II, IDEA) of 0.052, respectively. Wilcoxon matched-pairs signed-rank test confirms there is a significant difference between IDEA and the other methods. In summary, the above experimental results confirm that the IDEA outperforms both the DEA and NSGA-II in finding the better Pareto-optimal solutions.

Conclusions

In the study, the IDEA shows its effectiveness to optimize task scheduling and resource allocation compared with both the DEA and the NSGA-II. Moreover, for decision makers, the Gantt charts of task scheduling in terms of having smaller makespan, cost, and both can be selected to make their decision when conflicting objectives are present.  相似文献   

2.
云计算中虚拟机资源分配算法   总被引:1,自引:0,他引:1  
为了解决云计算中虚拟机部署预留方案浪费大量资源和单目标部署方案不够全面问题,提出了一种基于组的多目标遗传算法虚拟机资源分配算法.该算法分成组编码和资源编码,资源编码根据虚拟机历史资源需求进行整合编码,通过改进的交叉和变异操作,将物理机器个数和虚拟机占用物理机器资源整合.实验结果表明,该算法有效减少了物理机器个数使用和提高了物理机器资源使用率,达到了节能目的.  相似文献   

3.
在实际的项目中会发现蚁群算法直接应用于云计算资源分配时经常会出现负载失衡的情况,导致资源利用率不高,同时导致任务完成时间太长,算法迭代次数过大。这种情况不仅会大大地降低云计算系统的效率,还会造成系统不稳定。因此针对蚁群算法进行了一系列改进,具体包括:引入伪随机比例规则,进行全局信息素强化,引入了交叉变异操作,将蚁群算法与遗传算法相融合。然后进行了MATLAB仿真实验,实验结果表明:改进算法的任务完成时间更短,算法迭代次数更少,负载均衡效果更好。由此可以得出结论:对蚁群算法的改进是有效的。  相似文献   

4.
Unreasonable resource allocation may shorten the service life of physical servers and affect the stability of the cloud data center. To solve this issue, a virtual machine (VM) allocation and placement strategy based on the types of applications is proposed. According to the strategy, appropriate VM is allocated based on the type of application. And the VM is placed on the server that the available resources is sufficient enough to support the application. Meanwhile, the load balance of the server is also considered when the VM is placed. Simulations on Cloudsim platform show that the performance of load balance of the VM placement strategy proposed is much better than that of the traditional VM placement strategy. And extensive experiments on cloudstack show that the VM placement strategy proposed is much more efficient than the traditional VM placement strategy in execution.  相似文献   

5.
负载均衡问题是当前云计算研究的重要问题。由于云计算中的负载均衡存在效率低、准确性不高以及资源需求动态变化等问题,建立了云计算环境下的负载均衡模型,通过在发送者策略中引入混沌算法和在接收者策略中引入萤火虫算法,提高了目标节点的最优化选择以及转移任务量的准确性。仿真实验表明,改进后的资源负载算法能够有效地避免负载处理的不均衡,提高系统整体处理能力。  相似文献   

6.
提出了一种基于加权处理的无线传感器网络非均匀分布节点定位算法-W-DV-Hop算法.算法对所有锚节点的平均跳距进行加权处理作为网络平均跳距,使网络平均每跳距离的估计更加准确,从而降低用锚节点的平均跳距作为网络每跳距离对定位精度的影响.仿真结果表明:在同等条件下,新算法相比DV-Hop算法能有效提高节点定位精度,且能延长节点寿命.  相似文献   

7.
无线传感器网络中一种能量高效的分布式分簇算法   总被引:1,自引:1,他引:0  
于振华  刘宇  纪明  蔡远利 《控制与决策》2009,24(9):1436-1440
提出了一种适用于无线传感器网络的能量高效的分布式分簇算法(EEDC),该算法使具有较高剩余能量及距离基站较近的节点有更大的机会成为簇头.理论分析表明该算法通信开销较小,而且有效地均衡了节点的能量消耗.为了确保EEDC 的正确性、完整性和可靠性,利用形式化方法———着色网对其关键属性进行建模和分析.仿真结果表明,EEDC 有效地延长了网络生命周期,提高了网络的能耗效率.  相似文献   

8.
The number of cloud service users has increased worldwide, and cloud service providers have been deploying and operating data centers to serve the globally distributed cloud users. The resource capacity of a data center is limited, so distributing the load to global data centers will be effective in providing stable services. Another issue in cloud computing is the need for providers to guarantee the service level agreements (SLAs) established with consumers. Whereas various load balancing algorithms have been developed, it is necessary to avoid SLA violations (e.g., service response time) when a cloud provider allocates the load to data centers geographically distributed across the world. Considering load balancing and guaranteed SLA, therefore, this paper proposes an SLA-based cloud computing framework to facilitate resource allocation that takes into account the workload and geographical location of distributed data centers. The contributions of this paper include: (1) the design of a cloud computing framework that includes an automated SLA negotiation mechanism and a workload- and location-aware resource allocation scheme (WLARA), and (2) the implementation of an agent-based cloud testbed of the proposed framework. Using the testbed, experiments were conducted to compare the proposed schemes with related approaches. Empirical results show that the proposed WLARA performs better than other related approaches (e.g., round robin, greedy, and manual allocation) in terms of SLA violations and the provider’s profits. We also show that using the automated SLA negotiation mechanism supports providers in earning higher profits.  相似文献   

9.
The Journal of Supercomputing - Cloud infrastructure provides resources needed for tasks for resource scheduling. This work uses a genetic algorithm based on encoded chromosome (GEC-DRP) to manage...  相似文献   

10.
采用家族谱系的描述方法,提出了一种适用于复杂现场监测的工业无线传感器网络路由和通信资源分配算法.该算法利用无线传感器网络的广播特性,采用分层、分时和分频相结合的策略实现路由和通信资源的分配,具有条理清晰、实现简单的特点.仿真测试表明,该算法能够有效提高无线网络的通信效率,可靠性高,并具有良好的可扩展性.  相似文献   

11.
Resource allocation is a complicated task in cloud computing environment because there are many alternative computers with varying capacities. The goal of this paper is to propose a model for task-oriented resource allocation in a cloud computing environment. Resource allocation task is ranked by the pairwise comparison matrix technique and the Analytic Hierarchy Process giving the available resources and user preferences. The computing resources can be allocated according to the rank of tasks. Furthermore, an induced bias matrix is further used to identify the inconsistent elements and improve the consistency ratio when conflicting weights in various tasks are assigned. Two illustrative examples are introduced to validate the proposed method.  相似文献   

12.
Time-aware utility-based resource allocation in wireless networks   总被引:1,自引:0,他引:1  
This paper presents a time-aware admission control and resource allocation scheme in wireless networks in the context of a future generation cellular network. The quality levels (and their respective utility) of different connections are specified using discrete resource-utility (R-U) functions. The scheme uses these R-U functions for allocating and reallocating bandwidth to connections, aiming to maximize the accumulated utility of the system. However, different applications react differently to resource reallocations. Therefore, at each allocation time point, the following factors are taken into account: the age of the connection, a disconnection (drop) penalty, and the sensitiveness to reallocation frequency. The evaluation of our approach shows a superior performance compared to a recent adaptive bandwidth allocation scheme (RBBS). In addition, we have studied the overhead that performing a reallocation imposes on the infrastructure. To minimize this overhead, we present an algorithm that efficiently reduces the number of reallocations while remaining within a given utility bound.  相似文献   

13.
A wireless sensor network (WSN) can be construed as an intelligent, largely autonomous, instrument for scientific observation at fine temporal and spatial granularities and over large areas. The ability to perform spatial analyses over sensor data has often been highlighted as desirable in areas such as environmental monitoring. Whilst there exists research on computing topological changes of dynamic phenomena, existing proposals do not allow for more expressive in-network spatial analysis. This paper addresses the challenges involved in using WSNs to identify, track and report topological relationships between dynamic, transient spatial phenomena and permanent application-specific geometries focusing on cases where the geometries involved can be characterized by sets of nodes embedded in a finite 2-dimensional space. The approach taken is algebraic, i.e., analyses are expressed as algebraic expressions that compose primitive operations (such as Adjacent, or AreaInside). The main contributions are distributed algorithms for the operations in the proposed algebra and an empirical evaluation of their performance in terms of bit complexity, response time, and energy consumption.  相似文献   

14.
Energy-efficient distributed clustering in wireless sensor networks   总被引:2,自引:0,他引:2  
The deployment of wireless sensor networks in many application areas requires self-organization of the network nodes into clusters. Clustering is a network management technique, since it creates a hierarchical structure over a flat network. Quite a lot of node clustering techniques have appeared in the literature, and roughly fall into two families: those based on the construction of a dominating set and those which are based solely on energy considerations. The former family suffers from the fact that only a small subset of the network nodes are responsible for relaying the messages, and thus cause rapid consumption of the energy of these nodes. The latter family uses the residual energy of each node in order to decide about whether it will elect itself as a leader of a cluster or not. This family’s methods ignore topological features of the nodes and are used in combination with the methods of the former family. We propose an energy-efficient distributed clustering protocol for wireless sensor networks, based on a metric for characterizing the significance of a node, w.r.t. its contribution in relaying messages. The protocol achieves small communication complexity and linear computation complexity. Experimental results attest that the protocol improves network longevity.  相似文献   

15.
云计算环境下基于路径优先级的任务调度算法   总被引:1,自引:0,他引:1  
为了最小化云计算系统的任务调度长度,结合表启发式调度技术和任务复制的思想提出基于路径优先权的任务调度算法.采用一种新方法计算DAG图中任务节点及边的权值,从最高优先权的路径开始依次选择任务进行调度,并通过有选择性地复制任务节点的父任务来减少任务间信息传送的时间花费,最后将任务安排到使其执行完成时间最早的虚拟机上.通过随机产生的DAG图与HEFT算法进行对比分析,实验结果表明了该算法能获得较短的调度长度.  相似文献   

16.
Cloud computing has become a new computing paradigm that has huge potentials in enterprise and business. Green cloud computing is also becoming increasingly important in a world with limited energy resources and an ever-rising demand for more computational power. To maximize utilization and minimize total cost of the cloud computing infrastructure and running applications, resources need to be managed properly and virtual machines shall allocate proper host nodes to perform the computation. In this paper, we propose performance analysis based resource allocation scheme for the efficient allocation of virtual machines on the cloud infrastructure. We experimented the proposed resource allocation algorithm using CloudSim and its performance is compared with two other existing models.  相似文献   

17.
Data aggregation in wireless sensor networks using ant colony algorithm   总被引:2,自引:0,他引:2  
Data aggregation is important in energy constraint wireless sensor networks which exploits correlated sensing data and aggregates at the intermediate nodes to reduce the number of messages exchanged network. This paper considers the problem of constructing data aggregation tree in a wireless sensor network for a group of source nodes to send sensory data to a single sink node. The ant colony system provides a natural and intrinsic way of exploring search space in determining data aggregation. Moreover, we propose an ant colony algorithm for data aggregation in wireless sensor networks. Every ant will explore all possible paths from the source node to the sink node. The data aggregation tree is constructed by the accumulated pheromone. Simulations have shown that our algorithm can reduce significant energy costs.  相似文献   

18.
由于云计算要面临庞大的资源分配并且具有动态性等特点,仅从单一方面来权衡资源分配策略的优劣已经不能满足需求.针对上述问题,从用户和资源提供者两个方面出发,将蝙蝠算法引入资源分配策略中,提出了以任务完成时间较短且成本最低为约束条件的调度模型.通过CloudSim平台进行模拟仿真表明,该资源分配算法能有效地兼顾完成时间和成本,在缩短任务完成时间的同时保证成本最小,提高了资源利用率.  相似文献   

19.
This paper deals with the problem of accurately tracking a single target, which has various trajectories, moving through the environment of underwater wireless sensor networks (UWSNs). This paper addresses the issues of estimating the states of the target, improving energy efficiency by using a distributed architecture. Each underwater wireless sensor node composing the UWSNs is battery-powered, so the energy conservation problem is a critical issue. This paper provides algorithms increasing the energy efficiency of each sensor node by using the proposed Wake-Up/Sleep (WUS) scheme. An interacting multiple model (IMM) filter is applied to the proposed distributed architecture in order to cope with a target maneuver. Simulation results illustrate the performance of the proposed tracking filter according to the various target maneuver patterns.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号