Date Added: Feb 2012
The theory of scheduling has expanded rapidly during the past years. As multi-core architectures begin to emerge, operating system issues are to be considered for best use of multi-core processes. Due to the architectural differences in the state of art multi-core processors such as shared caches, memory controllers etc., it becomes the responsibility of the operating system to make use of intelligent scheduling mechanisms instead of simply scheduling tasks. In this paper, the authors try to explore the rapidly expanding area of scheduling by classifying the multi-core scheduling into traditional shortest job scheduling for multi-core, tree based threaded scheduling and block level scheduling. They have conducted simulation of the traditional shortest job first for multi-core processors the details of which are discussed below.