CAJ | 학술논문

资源预留是实时系统中一种实现任务间时间隔离的方法。实时程序在多核处理器上以资源预留的方式运行，可将其划分为多个执行流，并将各执行流部署到处理器核上。为了节省计算资源占用和减少处理器能耗，在部署时应该使用尽量少的处理器核。本文将该问题映射为装箱问题（Bin packing），并提出基于首次适应算法（FF）的FF—SA算法进行求解。FF—SA算法首先利用首次适应算法（FF）得到执行流部署的初始解，其次再利用模拟退火算法（SA）进一步优化。实验结果表明，FF—SA算法比FF算法节省处理器核数。
자원예류시실시계통중일충실현임무간시간격리적방법。실시정서재다핵처리기상이자원예류적방식운행，가장기화분위다개집행류，병장각집행류부서도처리기핵상。위료절성계산자원점용화감소처리기능모，재부서시응해사용진량소적처리기핵。본문장해문제영사위장상문제（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.