Browse Prior Art Database

Push Method Scheduler

IP.com Disclosure Number: IPCOM000012042D
Original Publication Date: 2003-Apr-03
Included in the Prior Art Database: 2003-Apr-03

Publishing Venue

IBM

Abstract

The purpose of this article is to address the issue of CPU scheduling to increase probability of threads being able to run in shorter amounts of time by using a push method for kernel scheduling rather than a pull method for multiple CPU, multiple run queue thread scheduling. Current schedulers are pull based. Threads are stolen when CPUs go idle, or based on criteria of load on a CPU. Rather than waiting for a CPU to steal some thread from another CPU, if a CPU is ready to give a thread away, then it will push it to another CPU that is less loaded than the current CPU where the thread resides. By pushing threads, better load balancing can be achieved in conjunction to increasing the probability of time to execution.