2026-07-26T10:43:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4283 2024-03-06T10:29:25Z ddc:004 open_access

A Graph based approach for Co-scheduling jobs on Multi-core computers Zhu, Huanzhou He, Ligang Co-scheduling algorithm Multicore processor Cache interference Parallel Job In a multicore processor system, running multiple applications on different cores in the same chip could cause resource contention, which leads to performance degradation. Recent studies have shown that job co-scheduling can effectively reduce the contention. However, most existing co-schedulers do not aim to find the optimal co-scheduling solution. It is very useful to know the optimal co-scheduling performance so that the system and scheduler designers can know how much room there is for further performance improvement. Moreover, most co-schedulers only consider serial jobs, and do not take parallel jobs into account. This paper aims to tackle the above issues. In this paper, we first present a new approach to modelling the problem of co-scheduling both parallel and serial jobs. Further, a method is developed to find the optimal co-scheduling solutions. The simulation results show that compare to the method that only considers serial jobs, our developed method to co-schedule parallel jobs can improve the performance by 31% on average. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Huanzhou Zhu and Ligang He 2013 Is Part Of OASIcs, Volume 35, 2013 Imperial College Computing Student Workshop InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICCSW.2013.144 urn:nbn:de:0030-drops-42837 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2013.144 eng https://creativecommons.org/licenses/by/3.0/legalcode