Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors

Yukio Ohishi, Keizo Saisho, Akira Fukuda

Research output: Contribution to journalArticlepeer-review


In this article, we simulate and evaluate various Two-level Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Two-level Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limited Algorithm for processor group configuration, (a) Idle-processor-keep Method and (b) Idle-processor-release Method for idle processor processing, and (a) Running-process-first Method and (b) Waiting-process-first Method for free processor assignment. The result shows: (1) Cluster-limited Algorithm is superior to Claster-free Algorithm in general, 2) Cluster-limited Algorithm is not influenced so much by various alternatives, (3) Idle-processor-keep Method and Waiting-process-first Method are superior for Cluster-free Algorithm.

Original languageEnglish
Pages (from-to)36-46
Number of pages11
JournalSystems and Computers in Japan
Issue number2
Publication statusPublished - Feb 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors'. Together they form a unique fingerprint.

Cite this