Optimization of the Load Balancing Policy for Tiled Many-Core Processors

Ye Liu*, Shinpei Kato, Masato Edahiro

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Tiled many-core processors (i.e., KNL and the TILE-Gx72 processor), on which processing cores are fitted onto a single chip and cores are interconnected via mesh-based networks, are different from the traditional many-core systems. Their operating system (OS) should be optimized to take into account the unique characteristics (for instance, cores are integrated into a single chip) of tiled many-core processors. This is because these characteristics were not taken into consideration when OSes designed for the traditional multicore (many-core) systems were deployed on tiled many-core processors. In this paper, we propose an optimized load balancing policy to improve the performance of multi-threaded applications. Making a thread select an appropriate idle (lightweight) tile (processing core) across all tiles on the single chip rather than a portion of tiles is able to reduce the overhead triggered by the load balancing policy, the penalty of cache misses because of the scheduling and more threads sharing the same tile (processing core), and the contention for memory controllers due to cache misses. The experimental results demonstrate that the optimized load balancing policy can provide up to 2.7 × performance improvement on KNL and mitigate the performance degradation to separate extents on the TILE-Gx72 processor.

Original languageEnglish
Article number8565841
Pages (from-to)10176-10188
Number of pages13
JournalIEEE Access
Publication statusPublished - 2019


  • Tiled many-core processors
  • load balancing
  • scalability problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)


Dive into the research topics of 'Optimization of the Load Balancing Policy for Tiled Many-Core Processors'. Together they form a unique fingerprint.

Cite this