Abstract
Cyber-Physical System (CPS) becomes increasingly popular in recent years. The powerful computation capacity and low network latency of CPS attracts application developers and content providers to offload their computationally intensive workloads to CPS servers. In this paper, we propose an intermigration scheduling algorithm to support device mobility for CPS. Our scheduling goal is to maximize the overall throughput of the system as well as support for mobility with low migration cost under the premise of guarantee the real-time requirements of tasks. Many service subscribers of CPS have strong mobility and they will move back and forth between base stations frequently, so the scheduling algorithm must support for mobility. But always migration tasks to the closest base station along with the movement of service subscribers is not a wise idea due to the load imbalance and high migration cost. Thus, it is important to propose a scheduling algorithm that can support for mobility with low migration cost. Also, in experiments, we use thread pool to improve the performance of our system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
