Scheduling operating system processing on small-scale multiprocessors

Trends in multiprocessor and distributed operating systems designs

“…In the OS-preempt scheme the master avoids doing any application processing whenever there is a process waiting in its local queue. Wendorf et al [1989] show that the OS preempt policy provides the best performance and it can perform as well as a fully symmetric system.…”

“…A preemptive reschedule is performed whenever a higher-priority thread becomes ready to run on the master. Wendorf et al [1989] have evaluated some scheduling policies for master-slave systems. This study was conducted on a configuration with a small number of processors.…”

Dynamic task partition for video decoding on heterogeneous dual-core platforms

“…For SMP platforms where all processing cores have the same architecture and shares a common memory space, the solution to the dynamic task partition problem is quite straightforward and efficient [Janssens et al 1986;Manimaran and Murthy 1998;Cancian and Friedrich 2002;Wendorf et al 1989], but it is non-trivial for heterogeneous multi-core platforms [Baruah 2004, Hoelzenspies et al 2008]. Although there are many studies on task scheduling for asymmetric multiprocessor (AMP) systems, the focus of these studies are on dynamic task scheduling for processors with homogeneous architecture in a master/slave cooperation configuration [Wendorf et al 1989;Greenberg and Wright 1991;Avritzer et al 1990;Momtchev and Marquet 2002]. One can intuitively write down some task-execution cost functions based on architectural efficiency, power efficiency, runtime load estimates, etc., and try to design an OS kernel to solve the cost functions optimally in a simulated environment.…”