Multi-Job Multi-Edge Allocation in Edge Computing Environments

With the rapid advancement of Internet of Things (IoT) and social networking application, the clouds is moving towards the network edges. It is foreseeable that more and more data will be processed in edge, and research organizations estimate that over 90% of the data will be stored and processed locally. This paper focus on the resource allocation for the multi-job multi-edge environments. We formulate the allocation problem as the concurrent job scheduling problem (CJSP), which is shown to be NP-complete. We propose the Weight Balance (WB) Algorithm to solve a special case of CJSP and we show that WB is optimal under some conditions. We then expand WB to solve the general CJSP. Extensive simulations demonstrate that the performance of our algorithm at small user and edge scale is almost as good as the optimal algorithm.