检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:武奎俊
机构地区:[1]杭州电子科技大学计算机应用技术研究所,浙江杭州310018
出 处:《电子技术(上海)》2015年第10期51-53,46,共4页Electronic Technology
摘 要:资源预留是实时系统中一种实现任务间时间隔离的方法。实时程序在多核处理器上以资源预留的方式运行,可将其划分为多个执行流,并将各执行流部署到处理器核上。为了节省计算资源占用和减少处理器能耗,在部署时应该使用尽量少的处理器核。本文将该问题映射为装箱问题(Bin packing),并提出基于首次适应算法(FF)的FF—SA算法进行求解。FF—SA算法首先利用首次适应算法(FF)得到执行流部署的初始解,其次再利用模拟退火算法(SA)进一步优化。实验结果表明,FF—SA算法比FF算法节省处理器核数。Resource reservation is a way of implementing temporal isolation between tasks in real-time system. Real-time applications that run on multi-core processors by means of resource reservation can be divided into various flows, which are then deployed on physical cores. In order to save resources and reduce processors consumption, it is preferable to use as few physical cores as possible in flow deployment. In this paper, this problem is mapped to the bin-packing problem. We then propose FF-SA algorithm to solve the problem, which first uses first-fit algorithm(FF) to obtain initial solution, and then utilizes simulated annealing(SA) algorithm to further optimize the initial solution.Theresults show that compared with FF algorithm, FF-SA algorithm occupies fewer processor cores.
分 类 号:TP332[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49