With more software architects and developers coding forrnparallel execution, how fair tasks are scheduled by thernoperating system becomes an important criteria. Softwarerncode may comprise of small sections that arernparallelizable and every possible performance gain shouldrnbe exploited by the software developer. In order tornexploit fine grain parallelism, software developers needrnthe confidence that the operating system is able to fairlyrnschedule their parallelized tasks.rnMost schedulers attempt to allocate resources to tasksrnfairly based on the task's priority. However, this fairnessrncannot be achieved in an ideal manner and hence it is onlyrnan approximate fairness. Actual experience with variousrnschedulers varies and currently, there is no tool tornqualitatively measure and compare them.rnThis paper presents a tool to measure fairness andrnprovides an intuitive representation of the results throughrnthe comparison of two different kernel schedulers of thernopen source Linux operating system.
展开▼
