Enhancing Capability of Gang scheduling by integration of Multi Core Processors

Abstract

In this paper, a new algorithm for gang scheduling is proposed. This method aims to reduce the average response time of gangs by increasing the serviceability of gangs in the shortest execution time possible. The performance of the proposed algorithm is examined and compared to the basic gang scheduling algorithm within the simulation. Objective of research is increase efficiency of scheduling dependent task using enhanced multithreading. gang scheduling of parallel implicit-deadline periodic task systems upon identical multiprocessor platforms is considered. In this scheduling problem, parallel tasks use several processors simultaneously. first algorithm is based on linear programming & is first one to be proved optimal for considered gang scheduling problem. Furthermore, it runs in polynomial time for a fixed number m of processors & an efficient implementation is fully detailed. second algorithm is an approximation algorithm based on a fixed-priority rule that is competitive under resource augmentation analysis in order to compute an optimal schedule pattern. Precisely, its speedup factor is bounded by (2?1/m). Both algorithms are also evaluated through intensive numerical experiments. In our research we have enhanced capability of Gang Scheduling by integration of multi core processor; Cache; make simulation of performance in MATLAB.