Distributive Processor Task Scheduling for the Cyber-Physical Systems– A Traveling Salesman Problem Approach

Abstract

Task scheduling is one of the critical processes in cyber-physical systems to meet real-time deadlines. In the cyber-physical system, the processor is distributed at different locations physically and collaborative computation between them may make the computation to meet the real-time deadline. This distributive processor system has various task communication delays, which need to be considered during task scheduling. This distributive processor with varying delays of communication can be considered as a traveling salesman problem. This traveling salesman problem model-based task scheduling for distributive multiprocessor is solved using a genetic algorithm. This proposed scheduling mechanism shows improved performance comparing to the traditional scheduling algorithm.