Selective Scheduling Based on Number of Processor Cores for Parallel Processing

Scheduling is essential for the proper functioning of multi-core processors for parallel processing. Scheduling of tasks onto multi-core processors is an interesting problem that is well defined and documented in the literature. Multi-core processor systems are increasingly commonplace, and have found their way into desktop machines, laptops, and even mobile devices. The rise of the multi-core processor, in which multiple CPU cores are packed onto a single chip, is the source of this proliferation. These chips have become popular as computer architects have had a difficult time making a single CPU much faster without using too much power. With the advent of multi core processors, there is a need to schedule multiple tasks on multiple cores. In this paper we are proposing a new scheduler algorithm which schedules the multiple tasks on multiple cores of a single chip processor. One task is assign to a single core and the one is on another core processor within a single chip processor for parallel processing. The main goal of this work is to allow jobs to scale well with the number of cores. The proposed algorithm will allow each processor core to execute at least one task on single instance of time. This means if the number of processor cores is four then four tasks will be execute simultaneously on all four cores.