共查询到20条相似文献,搜索用时 93 毫秒
1.
基于生灭过程的机群系统高可用性分析与设计 总被引:6,自引:0,他引:6
文章在对机群系统的运行特性进行分析的基础上,运用马氏过程描述了机群系统中的高可用性(High Availability),并从理论上建立了基于生灭过程的机群高可用模型。文中在给出机群高可用管理软件结构的基础上,设计了一种基于集中式结构的主副容错协议;通过可用度的分析结果得出:机群高可用系统采用了可修复性技术后,只要有一个HA节点能正常工作,该系统是“可用”的。 相似文献
2.
高素林张盈希任奕菲冯光升 《无线电通信技术》2022,(5):822-829
移动边缘计算(Mobile Edge Computing, MEC)作为一种新兴的计算模式可以将智能设备上的任务调度到MEC服务器中执行以解决智能设备资源受限问题。多用户场景下以时延和任务依赖性为约束的任务调度问题是移动边缘计算中的研究热点之一。针对该问题建立了任务调度模型,然后依据场景特性将任务调度问题转换为最小化能量消耗问题。针对任务调度问题的实时性和持续性进一步将优化问题缩放至较小规模的优化问题,并依据优化问题的解设计了一个实时调度算法。最后使用遗传算法作为对比算法进行仿真实验。实验结果表明实时调度算法比遗传算法更有效地降低了智能设备整体能量消耗,并在高并发、高时延要求等情况下仍保持良好的性能。 相似文献
3.
4.
将移动边缘计算技术(MEC)与非正交多址技术(NOMA)结合,同时考虑公平性,该文研究了采用NOMA上行部分卸载的MEC系统公平能效问题。首先将基于公平函数的用户速率与功耗比值定义为公平能效函数,随后提出了两种公平能效调度准则下的能效调度算法,即最大化最小速率准则下DK-SCA算法及最大化系统能效准则下DK-SCALE算法,通过算法实现分别得到两种公平能效调度准则下用户最佳本地CPU处理频率及最佳传输功率。最后通过仿真表明,与基准方案相比,所提基于NOMA的部分卸载方案能够有效地将本地计算和基于NOMA的边缘卸载结合,达到最佳的公平能效性能。 相似文献
5.
6.
在移动边缘计算中(Mobile Edge Computing,MEC),任务卸载可以有效地解决移动设备资源受限的问题,但是将全部任务都卸载到边缘服务器并非最优.本文提出一种面向移动边缘计算的多用户细粒度任务卸载调度新方法,把计算任务看作一个有向无环图(Directed Acyclic Graph,DAG),对节点的执行位置和调度顺序进行了优化决策.考虑系统的延迟把计算卸载看作一个约束多目标优化问题(Constrained Multi-object Optimization Problem,CMOP),提出了一个改进的NSGA-Ⅱ算法来解决CMOP.所提出的算法能够实现本地和边缘的并行处理从而减少延迟.实验结果表明,算法能够在实际应用程序中做出最优决策. 相似文献
7.
8.
在车联网(IOV)环境中,如果将车辆的计算任务都放置在云平台执行,无法满足对于信息处理的实时性,考虑移动边缘计算技术以及任务卸载策略,将用户的计算任务卸载到靠近设备边缘的服务器去执行。但是在密集的环境下,如果所有的任务都卸载到附近的边缘服务器去执行,同样会给边缘服务器带来巨大的负载。该文提出基于模拟退火机制的车辆用户移动边缘计算任务卸载新方法,通过定义用户的任务计算卸载效用,综合考虑时耗和能耗,结合模拟退火机制,根据当前道路的密集程度对系统卸载效用进行优化,改变用户的卸载决策,选择在本地执行或者卸载到边缘服务器上执行,使得在给定的环境下的所有用户都能得到满足低时延高质量的服务。仿真结果表明,该算法在减少用户任务计算时间的同时降低了能量消耗。 相似文献
9.
10.
移动边缘计算环境下,用户可将本地的计算密集型任务卸载至边缘服务器,从而缩短工作流的完工时间并节省设备能耗。然而,许多研究忽略了用户移动导致的网络连接变化对工作流调度的影响。针对现有算法中存在的卸载不合理问题,文中提出了基于移动感知的工作流调度算法MaWS。该算法通过预测用户移动轨迹得出未来可通信的基站集合,并融入遗传算法,制定合理的任务执行顺序和执行位置。仿真结果表明,相比HEFT和Greedy等算法,MaWS算法能够有效缩短10%~15%的工作流完工时间并降低8%~13%的设备能耗,为移动边缘计算下的工作流调度提出一种有效方案。 相似文献
11.
异构计算系统执行应用效率的提高高度依赖有效的调度算法。该文提出一种新的列表调度算法,称为改进的预测优先任务和乐观处理器选择调度(IPPOSS)。通过在任务优先级排序阶段引入任务的后向预测成本,来减少调度长度。与现有工作相比,该文使用改进预测成本矩阵(IPCM),更合理地进行了任务优先级排序,从而在处理器选择阶段获得了更好的解,并保持2次时间复杂度。IPCM考虑了任务优先级排序阶段的各种计算、通信因素,比预测优先任务调度(PPTS)提出的预测成本矩阵(PCM)更容易获得合理的优先级列表。随机生成应用的有向无环图(DAG)和真实世界应用的DAG的实验结果分析表明,IPPOSS的性能优于相关算法。 相似文献
12.
ZHAO Yong CHEN Liang LI Youfu TIAN Wenhong 《中国通信》2014,(12):125-140
Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications. 相似文献
13.
14.
15.
16.
17.
针对多任务场景下的传感器调度问题,该文提出一种面向目标协同检测与跟踪的多传感器调度方法。首先,该方法基于部分可观马尔科夫决策过程(POMDP)构建传感器调度模型,并基于后验克拉美-罗下界(PCRLB)设计优化目标函数。其次,考虑传感器切换时间和目标数目的时变性,采用随机分布粒子计算新生目标的检测概率,给出了固定目标数目和时变目标数目情形下的传感器调度方法。最后,为满足在线调度的实时性需求,采用自适应多种群协同差分进化(AMCDE)算法求解传感器调度方案。仿真结果表明,该方法能够有效应对多任务场景,实现多传感器资源的合理调度。 相似文献
18.
XIE Yufeng LIU Leibo DAI Rui WEI Shaojun 《电子学报:英文版》2008,(3):421-426
In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper addresses the problem of battery- aware task scheduling on multiprocessor systems to extend the battery lifetime, and proposed a Critical-path based battery-aware task scheduling (CPbBATS) algorithm with a novel efficient flow. Experiments on hundreds of task graphs each having 10 to 100 tasks show that, compared with algorithm that simply sequences tasks with their highest voltages and utilizes the slack by the latest possible task, the CPbBATS achieved 3.3%-6.1% reduction on apparent charge lost which means longer battery lifetime, 3.6%-8.3% reduction on actual charge lost which means lower energy consumption, and average 31.99% reduction on the CPU runtime which means much lower computa- tional complexity. 相似文献
19.
20.
Rojin Naseri Mohammad Abdollahi Azgomi Ali Naghash Asadi 《International Journal of Communication Systems》2024,37(5):e5686
The cloud computing systems, such as the Internet of Things (IoT), are usually introduced with a three-layer architecture (IoT-Fog-Cloud) for the task offloading that is a solution to compensate for resource constraints in these systems. Offloading at the right location is the most significant challenge in this field. It is more appropriate to offload tasks to fog than to cloud based on power and performance metrics, but its resources are more limited than the resources of the cloud. This paper tries to optimize these factors in the fog by specifying the number of usable servers in the fog. For this purpose, we model a fog computing system using the queueing theory. Furthermore, binary search and reinforcement learning algorithms are proposed to determine the minimum number of servers with the lowest power consumption. We evaluate the cost of the fog in different scenarios. By solving the model, we find that the proposed dispatching policy is very flexible and outperformed the known policies by up to 31% and in no case is it worse than either of them, and the overall offloading cost increases when fog rejects tasks with a high probability. Our offloading method is more effective than running all fog servers simultaneously, based on simulation results. It is evident from the similarities between the simulation results and those derived from the analytical method that the model and results are valid. 相似文献