Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, while in the non-preemptive case, the set of colors assigned to each vertex has to be contiguous. We study these versions of the multicoloring problem on trees, under the sum-of-completiontimes objective. In particular, ...

Algorithms for the scheduling of tasks within a parallel program onto available processors generally assume that communication only occurs at the start or end of each task, i.e., a task can only commence execution when all necessary data has been sent to it. This is termed \non-preemptive task scheduling". This paper examines the problem of the preemptive parallel program which is represented b...

The embedded systems work on real time operating systems (ERTOS). There are many CPU scheduling policies in general operating systems out of which ERTOS most commonly follow the priority and round robin scheduling. The aim of this research work is to evaluate performance of these scheduling policies. Simulation is adopted as tool to find the best policy that can be implemented to boost the perf...