Simulation on Task Scheduling for Multiprocessors Based on Improved Neural Network

2014 ◽  
Vol 513-517 ◽  
pp. 2293-2296
Author(s):  
Xiao Fang Li

This paper mainly discusses task scheduling for multiprocessors. Application requires higher performance of the multiprocessors task scheduling systems. The traditional algorithms majorly consider the accuracy and neglect the real-time performance. In order to improve the real-time performance while maintaining the accuracy, the paper proposes a task scheduling algorithm (GA-ACO) for multiprocessors based on improved neural network. It first builds mathematical models for task scheduling of multiprocessor systems, and then introduces genetic algorithms to quickly find feasible solutions. The simulation results show that the improved neural network algorithm not only has the global optimization ability of genetic algorithm, but also has both local search and the positive feedback capabilities of neural networks; compared with single optimization algorithm, it can quickly find the task scheduling solutions to meet real-time requirements, accelerate the speed of execution of the task, furthermore achieve reasonable, effective task allocation and scheduling for multi-processor.

2015 ◽  
Vol 8 (2) ◽  
Author(s):  
Lavanya Dhanesh ◽  
Dr. P. Murugesan

The main objective of the research is to improve the performance of the CPU at software level by reducing the Interrupt Latency of the Real time systems. Interrupt Latency provides an important metric in increasing the performance of the Real Time Kernal. So far the research has been investigated with respect to real-time interrupt latency reduction using non-pre-emptive task scheduling algorithms. A general disadvantage of the non-preemptive discipline is that it introduces additional blocking time in higher priority tasks, so reducing schedulability. If the interrupt latency is increased, the task switching delay shall be increasing with respect to each task. Hence most of the research work has been focussed to reduce interrupt latency by using the Pre-emptive Task scheduling algorithm. Based on the literature survey, A Deadline Monotonic Priority Assignment technique is used to reduce the latency with respect to the deadline. Deferred pre-emption scheduling and Fixed pre-emptive scheduling algorithm are used to reduce the interrupt latencies based on the queue fixed to the priority of the tasks to be handled. Here we suggest a new algorithm named “Priority Preemptive task scheduling algorithm” which preempts and serve the task with highest priority and also concentrates on the low priority tasks during the buffering time of the higher priority tasks.


1985 ◽  
Vol C-34 (12) ◽  
pp. 1130-1143 ◽  
Author(s):  
John A. Stankovic ◽  
Krithivasan Ramamritham ◽  
Shengchang Cheng

Sign in / Sign up

Export Citation Format

Share Document