Efficient Auction-Knapsack-based Scheduling Strategy for Mobile Agents
一种高效的基于拍卖背包机制的移动Agent调度策略

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.