Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors

Yukio Ohishi, Keizo Saisho, Akira Fukuda

Research output: Contribution to journalArticle

Abstract

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
Volume29
Issue number2
DOIs
Publication statusPublished - Jan 1 1998

Fingerprint

Scheduling algorithms
Multiprocessor
Scheduling Algorithm
Performance Evaluation
Data storage equipment
Scheduling
Evaluate
Partitioning
Assignment
Configuration
Alternatives
Processing

All Science Journal Classification (ASJC) codes

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

Cite this

Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors. / Ohishi, Yukio; Saisho, Keizo; Fukuda, Akira.

In: Systems and Computers in Japan, Vol. 29, No. 2, 01.01.1998, p. 36-46.

Research output: Contribution to journalArticle

@article{8ca22e8b7ba0463c8002cb2fcc76fcc0,
title = "Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors",
abstract = "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.",
author = "Yukio Ohishi and Keizo Saisho and Akira Fukuda",
year = "1998",
month = "1",
day = "1",
doi = "10.1002/(SICI)1520-684X(199802)29:2<36::AID-SCJ5>3.0.CO;2-R",
language = "English",
volume = "29",
pages = "36--46",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - Performance evaluation of two-Level scheduling algorithms for NUMA multiprocessors

AU - Ohishi, Yukio

AU - Saisho, Keizo

AU - Fukuda, Akira

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031998671&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031998671&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-684X(199802)29:2<36::AID-SCJ5>3.0.CO;2-R

DO - 10.1002/(SICI)1520-684X(199802)29:2<36::AID-SCJ5>3.0.CO;2-R

M3 - Article

AN - SCOPUS:0031998671

VL - 29

SP - 36

EP - 46

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 2

ER -