Enhancing Capability of Gang Scheduling by Integration of Multi Core Processors & Cache

Abstract

Advantage of space sharing is elimination of multiprogramming, which eliminates context switching overhead. However, an equally clear disadvantage is time wasted when a CPU blocks & has nothing at all to do until it becomes ready again. Consequently, people had  looked for algorithms that attempt to schedule within in both time & space together, specially for processes that is create multiple threads, which usually need to communicate within one another.To see kind of problem that could occur when threads of a process (or processes of a job) are independently scheduled, In our research we had enhanced capability of Gang Scheduling by integration of multi core processor & Cache & make simulation of performance in MATLAB.The trick that makes gang scheduling work is that all CPUs are scheduled synchronously. This means that time is divided into discrete quanta. At start of each new quantum, all CPUs are rescheduled, within a new thread being started on each one