An efficient and fair scheduling policy for multiprocessor platforms

Marinakis, Theodoros; Haritatos, Alexandros-Herodotos; Nikas, Konstantinos; Goumas, Georgios; Anagnostopoulos, Iraklis

doi:10.1109/iscas.2017.8050758

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is accomplished by determining the ideal instruction rate (Instructions Per Cycle) of an application during a predefined time quantum by introducing a light-weight resourcecontention scenario at the beginning of execution. The authors of [9] demonstrate this metric to be an effective measure of an application's progress.…”

Section: B Progressmentioning

confidence: 99%

Priority-Aware Scheduling under Shared-Resource Contention on Chip Multicore Processors

Kundan

Anagnostopoulos

2021

2021 IEEE International Symposium on Circuits and Systems (ISCAS)

Self Cite

View full text Add to dashboard Cite

In this paper, we present a priority-aware scheduling methodology for concurrent application execution on chip multicore processors. Our methodology improves the performance of up to 4 high-priority applications while also preventing resource starvation for low-priority ones by means of progress-aware scheduling. We compare our results with Linux's completely fair scheduler and two state-of-the-art progress aware schedulers. Experimental results on an Intel Xeon Gold 6130 CPU demonstrate an average increase in high-priority application performance of 36.4% over Linux while also maintaining high throughput for low-priority applications. In addition, we show that our methodology achieves high-priority application performance comparable to a state-of-the-art hardware cache partitioning method (Intel's POCAT). Our method achieves average performance within 14.5% to 0.2% of POCAT without the need for hardware support.

show abstract

Section: B Progressmentioning

confidence: 99%