%0 Journal Article
%T Efficient Auction-Knapsack-based Scheduling Strategy for Mobile Agents<br>一种高效的基于拍卖背包机制的移动Agent调度策略
%A LIU Ai-zhen
%A WANG Jia-zhen
%A PENG De-yun
%A WEN Jia-fu
%A <br>刘爱珍
%A 王嘉祯
%A 彭德云
%A 文家福
%J 计算机应用研究
%D 2007
%I 
%X Based on analyzing CPU resource allocation feature for process/thread scheduling,this paper integrated knapsack problem and auction mechanism into auction-knapsack-based problem.Then proposed a new preprocess-based dynamic programming strategy to aim to maximize revenue of mobile agent system.Analyses and experiments show the method have features such as good efficiency,more practicality,best time spending and so on.
%K mobile agent
%K auction
%K scheduling strategy
%K knapsack problem
%K dynamic programming<br>移动代理
%K 拍卖
%K 调度策略
%K 背包问题
%K 动态规划
%K 拍卖机制
%K 包机制
%K 移动
%K Mobile
%K Agents
%K 调度策略
%K Scheduling
%K Strategy
%K 规划策略
%K 预处理方法
%K 试验
%K 情况
%K 规划算法
%K 动态
%K 目标
%K 收入最大化
%K 统一
%K 背包问题
%K 分配
%K 操作系统
%K 资源
%K 分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=EF4AD2E7BFCF0B30F3C394FD5102BB11&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=B31275AF3241DB2D&sid=286FB2D22CF8D013&eid=318E4CC20AED4940&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=9