English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Nowadays, it has become feasible to use mobile nodes as contributing entitiesin computing systems. In this paper, we consider a computational grid in whichthe mobile devices can share their idle resources to realize parallelprocessing. The overall computing task can be arbitrarily partitioned intomultiple subtasks to be distributed to mobile resource providers (RPs). In thisprocess, the computation load scheduling problem is highlighted. Based on theoptimization objective, i.e., minimizing the task makespan, a buyer-sellermodel in which the task sponsor can inspire the SPs to share their computingresources by paying certain profits, is proposed. The Stackelberg Pricing Game(SPG) is employed to obtain the optimal price and shared resource amount ofeach SP. Finally, we evaluate the performance of the proposed algorithm bysystem simulation and the results indicate that the SPG-based load schedulingalgorithm can significantly improve the time gain in mobile grid systems.

Divisible Load Scheduling in Mobile Grid based on Stackelberg Pricing Game