基于Stackelberg定价博弈的移动网格可分负载调度
Divisible Load Scheduling in Mobile Grid based on Stackelberg Pricing Game
摘要：
如今，在计算系统中使用移动节点作为贡献实体已经变得可行。在本文中，我们考虑了一个计算网格中的移动设备可以共享其空闲资源，实现并行处理。整个计算任务可以被任意划分为多个子任务，以分配给移动资源提供者（RP）。在这个过程中，计算负载调度问题是突出的。基于优化目标，即，提出了一种以最小化任务完成时间为目标的买方-卖方模型，在该模型中，任务发起者可以通过支付一定的利润激励SP共享其计算资源。采用Stackelberg定价博弈（SPG）方法，得到每个SP的最优价格和共享资源量。最后，通过系统仿真对算法的性能进行了评估，结果表明基于SPG的负载调度算法可以显著提高移动网格系统的时间增益。
英文摘要：
Nowadays, it has become feasible to use mobile nodes as contributing entities in computing systems. In this paper, we consider a computational grid in which the mobile devices can share their idle resources to realize parallel processing. The overall computing task can be arbitrarily partitioned into multiple subtasks to be distributed to mobile resource providers (RPs). In this process, the computation load scheduling problem is highlighted. Based on the optimization objective, i.e., minimizing the task makespan, a buyer-seller model in which the task sponsor can inspire the SPs to share their computing resources by paying certain profits, is proposed. The Stackelberg Pricing Game (SPG) is employed to obtain the optimal price and shared resource amount of each SP. Finally, we evaluate the performance of the proposed algorithm by system simulation and the results indicate that the SPG-based load scheduling algorithm can significantly improve the time gain in mobile grid systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
