Query: multi-core scheduling algorithm

title: Implementation of Real Time Scheduling Algorithm on Multi Core Platform
abstract: With the increasing demand for computing power in embedded systems, multi core processor architectures have become increasingly common. This paper studies and analyzes various real time scheduling algorithms and test platform LITMUSRT under the embedded multi core platform, and proposes a multi core scheduling method for real time tasks with dependencies. The static real time scheduling algorithm RM (Rate Monotonic) the algorithm and the proposed multi core scheduling method for real time tasks with dependencies are implemented in LITMUSRT. Test cases show that the proposed multi core scheduling method with dependencies can be implemented in the actual Linux environment and can meet the real time requirements of tasks in real time scheduling.

title: Multi Core Gateway Architecture and Scheduling Algorithm for High Performance Gateway Implementation
abstract: As the functions of vehicles continue to diversify, the performances of the corresponding electronic control units (ECUs) are being significantly improved. Moreover, the communication speed and data size are also increasing. This can lead to a burden on the gateway, thereby causing problems to the gateway. Therefore, as the number of ECUs and communication performance increase, the performance of the gateway must also increase. In this paper, we propose a multi core gateway, an operational algorithm, and a new scheduling algorithm for efficient data transfer. In addition, we confirmed that the proposed algorithm could address the problems in existing algorithms (FIFO, SP, and EDF) through comparison.

title: Multi fold Scheduling Algorithm for Multi core Multi Processor Systems
abstract: Adapting parallel scheduling function in the design of multi scheduling algorithm results significant impact in the operation of high performance parallel systems. The various methods of parallelizing scheduling functions are widely applied in traditional multiprocessor systems. In this paper a novel algorithm is introduced which works not only for parallel execution of jobs but also focuses the parallelization of scheduling function. It gives attention on reducing the execution time, minimizing the load balance performance by selecting the volume of tasks for migration in terms of packets. Jobs are grouped into packets consisting of 2n jobs which are scheduled in parallel. Thus, an enhancement in the scheduling mechanism by packet formation is made to carry out high utilization of underlying architecture with increased throughput. The proposed method is assessed on a desktop computer equipped with multi core processors in cube based multiprocessor systems. The algorithm is implemented with different configuration of multi core systems. The simulation results indicate that the proposed technique reduces the overall makespan of execution with an improved performance of the system.

title: Workload Aware Dynamic Scheduling Algorithm for Multi core Systems
abstract: The key challenge of scheduling in multi core systems is to map highly irregular processes that require the inspection of thread behavior and efficiency of multi core systems. The motive is to schedule multiple tasks on multiple cores. In this paper, a novel scheduling technique is proposed that works on execution technique for tree type tasks structures that are mapped on different multi core systems designed using different multiprocessor systems. In particular, the performance is evaluated by applying the proposed technique to a particular class of multiprocessor system known as hybrid multiprocessor systems that are used as basic building blocks of a multi core system. The scheduling algorithm is applied by dividing tasks in terms of computation efficiency of these systems. The key novelty of the proposed method is that tasks which are executed partially may be migrated on systems which are under loaded and having good efficiency. In other words, the scheduling of tasks to cores must be automated to adapt to the changing program behavior and current load on the system. Before migration of remaining tasks, the efficiency of core on such systems is evaluated. A comparative study is carried out by applying other standard scheduling algorithms on the same multi core systems. Simulation results show that the proposed algorithm gives better performance while executing tasks on various multi core systems having different computational efficiency. In particular, the load imbalance is improved by 20 30% and execution time is reduced by 35 55% as compared to traditional algorithms. Further, we show that in many cases, our approach is able to deliver better performance by combining it with classical scheduling algorithms.

title: Design of a Multi Core Scheduling Scheme for Tera bit/s LDPC Decoding
abstract: $A$ scheduling scheme for multi core Low Density Parity Check (LDPC) decoding is proposed to make full use of logical resources and to maximize the decoding throughput in the high speed communication systems. In the proposed scheme, consecutive code blocks are processed in different decoding cores according to a variable allocation sequence which is decided by the parity checking result of the decoding sequence. And the scheme is mathematically analyzed with the Gaussian approximation analyzing algorithm and the Sum Product Algorithm (SPA) It is shown that the proposed scheme can improve the decoding throughput by up to 130% compared to the conventional multicore parallel architectures.

title: Multi Core Platforms Energy Saving Scheduling Algorithm

title: Workflow Task Scheduling Algorithm for Marine Environment Data Processing under Multi core Computing Environment
abstract: Shen, Y. Qi, D. Zhou, N. and Wang, X. 2018. Workflow task scheduling algorithm for marine environment data processing under multi core computing environment.  Liu, Z.L. and Mi, C. (eds. Advances in Sustainable Port and Ocean Engineering. Journal of Coastal Research, Special Issue No. 83, pp. 646 650. Coconut Creek (Florida) ISSN 0749 0208. When the current workflow task scheduling algorithm is used for marine environment data processing, there is a large amount of calculation, poor load balancing, and lower data transmission efficiency. Therefore, in this paper, a workflow task scheduling algorithm based on multi task replication strategy is proposed for the marine environment data processing under multi core computing environment. Firstly, based on the directed acyclic graph, the workflow task structure of marine environment data processing can be described, to establish workflow model, and build a multi level task replication model the DAG diagram of workflow. The model is combined with the workflow model of marine environment data processing to decide whether to execute the replication task, so as to achieve the task scheduling of marine environment data processing in multi core computing environment. The experimental results show that the computational process of workflow task scheduling is relatively simple, which improves the load balance and the amount of data transmission.

title: ROS Task Scheduling Algorithm in Multi Core System
abstract: This paper designs a task scheduling algorithm called RTSA (ROS Task Scheduling Algorithm) for Linux kernel in allusion to the inherent relevance and mapping relationship of ROS under the development framework of ROS and Linux, considering multiple factors such as multi core load, task computational overhead, communication overhead. This paper uses simulation to verify the correctness of RTSA, and compares RTSA with the Round Robin Scheduling algorithm, SSC algorithm and serial execution. It turns out that RTSA can effectively shorten task scheduling length, reduce communication overhead, and improve system performance.

title: Energy Efficient Multi Core Scheduling for Real Time DAG Tasks
abstract: In this work, we study energy aware real time scheduling of a set of sporadic Directed Acyclic Graph (DAG) tasks with implicit deadlines. While meeting all real time constraints, we try to identify the best task allocation and execution pattern such that the average power consumption of the whole platform is minimized. To the best of our knowledge, this is the first work that addresses the power consumption issue in scheduling multiple DAG tasks on multi cores and allows intra task processor sharing. We first adapt the decomposition based framework for federated scheduling and propose an energy sub optimal scheduler. Then we derive an approximation algorithm to identify processors to be merged together for further improvements in energy efficiency and to prove the bound of the approximation ratio. We perform a simulation study to demonstrate the effectiveness and efficiency of the proposed scheduling. The simulation results show that our algorithms achieve an energy saving of 27% to 41% compared to existing DAG task schedulers.

title: Periodic Task Scheduling Algorithm for Homogeneous Multi core Parallel Processing System
abstract: The paper proposed a new heuristic algorithm for periodic task scheduling, which is MAS (Multi core Alternate Sort) algorithm. In this paper model of multiple nodes unmanned control system was built based on DAG (Directed Acyclic Graph) The paper described the MAS algorithm and evaluation method. Two group of experiment are conducted to verify the availability of algorithm and analyze the characteristics of algorithm. At last, the paper discussed the generality and development margin of algorithm.