Two-level processor scheduling for multiprogrammed NUMA multiprocessors

Akira Fukuda, Ryousuke Fujiki, Hisa aki Kai

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抄録

Non-Uniform Memory Access multiprocessors have potential gains for achieving high performance. Theses machines are frequently used as computation servers with multiple parallel processes (we use this word instead of jobs) executing at the same time. In such environments, the efficiency of a parallel process can be significantly affected by the processor scheduling strategy. Two-level scheduling strategy, which is a kind of space-multiplexing scheduling strategy, is a promising one for large-scale multiprocessors. This paper describes the structure and interface of the two-level scheduling strategy. We also propose basic alternatives in this strategy: as alternatives of handling free processors, 1) Running-Process-First scheme and 2) Waiting-Process-First scheme; as alternatives of handling idle processors, 1) Idle-Processor-Hold scheme and 2) Idle-Processor-Release scheme. These alternatives are examined through simulation experiments.

元の言語英語
ホスト出版物のタイトルProceedings - IEEE Computer Society's International Computer Software & Applications Conference
編集者 Anon
出版者Publ by IEEE
ページ343-351
ページ数9
ISBN(印刷物)0818644400
出版物ステータス出版済み - 1993
イベントProceedings of the 17th Annual International Computer Software & Applications Conference - COMPSAC 93 - Phoenix, AZ, USA
継続期間: 11 1 199311 5 1993

その他

その他Proceedings of the 17th Annual International Computer Software & Applications Conference - COMPSAC 93
Phoenix, AZ, USA
期間11/1/9311/5/93

Fingerprint

Scheduling
Multiplexing
Servers
Data storage equipment
Experiments

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Fukuda, A., Fujiki, R., & Kai, H. A. (1993). Two-level processor scheduling for multiprogrammed NUMA multiprocessors. : Anon (版), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference (pp. 343-351). Publ by IEEE.

Two-level processor scheduling for multiprogrammed NUMA multiprocessors. / Fukuda, Akira; Fujiki, Ryousuke; Kai, Hisa aki.

Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. 版 / Anon. Publ by IEEE, 1993. p. 343-351.

研究成果: 著書/レポートタイプへの貢献会議での発言

Fukuda, A, Fujiki, R & Kai, HA 1993, Two-level processor scheduling for multiprogrammed NUMA multiprocessors. : Anon (版), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Publ by IEEE, pp. 343-351, Proceedings of the 17th Annual International Computer Software & Applications Conference - COMPSAC 93, Phoenix, AZ, USA, 11/1/93.
Fukuda A, Fujiki R, Kai HA. Two-level processor scheduling for multiprogrammed NUMA multiprocessors. : Anon, 編集者, Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. Publ by IEEE. 1993. p. 343-351
Fukuda, Akira ; Fujiki, Ryousuke ; Kai, Hisa aki. / Two-level processor scheduling for multiprogrammed NUMA multiprocessors. Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. 編集者 / Anon. Publ by IEEE, 1993. pp. 343-351
@inproceedings{ea0c08b615884e43891843bae665902f,
title = "Two-level processor scheduling for multiprogrammed NUMA multiprocessors",
abstract = "Non-Uniform Memory Access multiprocessors have potential gains for achieving high performance. Theses machines are frequently used as computation servers with multiple parallel processes (we use this word instead of jobs) executing at the same time. In such environments, the efficiency of a parallel process can be significantly affected by the processor scheduling strategy. Two-level scheduling strategy, which is a kind of space-multiplexing scheduling strategy, is a promising one for large-scale multiprocessors. This paper describes the structure and interface of the two-level scheduling strategy. We also propose basic alternatives in this strategy: as alternatives of handling free processors, 1) Running-Process-First scheme and 2) Waiting-Process-First scheme; as alternatives of handling idle processors, 1) Idle-Processor-Hold scheme and 2) Idle-Processor-Release scheme. These alternatives are examined through simulation experiments.",
author = "Akira Fukuda and Ryousuke Fujiki and Kai, {Hisa aki}",
year = "1993",
language = "English",
isbn = "0818644400",
pages = "343--351",
editor = "Anon",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software & Applications Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Two-level processor scheduling for multiprogrammed NUMA multiprocessors

AU - Fukuda, Akira

AU - Fujiki, Ryousuke

AU - Kai, Hisa aki

PY - 1993

Y1 - 1993

N2 - Non-Uniform Memory Access multiprocessors have potential gains for achieving high performance. Theses machines are frequently used as computation servers with multiple parallel processes (we use this word instead of jobs) executing at the same time. In such environments, the efficiency of a parallel process can be significantly affected by the processor scheduling strategy. Two-level scheduling strategy, which is a kind of space-multiplexing scheduling strategy, is a promising one for large-scale multiprocessors. This paper describes the structure and interface of the two-level scheduling strategy. We also propose basic alternatives in this strategy: as alternatives of handling free processors, 1) Running-Process-First scheme and 2) Waiting-Process-First scheme; as alternatives of handling idle processors, 1) Idle-Processor-Hold scheme and 2) Idle-Processor-Release scheme. These alternatives are examined through simulation experiments.

AB - Non-Uniform Memory Access multiprocessors have potential gains for achieving high performance. Theses machines are frequently used as computation servers with multiple parallel processes (we use this word instead of jobs) executing at the same time. In such environments, the efficiency of a parallel process can be significantly affected by the processor scheduling strategy. Two-level scheduling strategy, which is a kind of space-multiplexing scheduling strategy, is a promising one for large-scale multiprocessors. This paper describes the structure and interface of the two-level scheduling strategy. We also propose basic alternatives in this strategy: as alternatives of handling free processors, 1) Running-Process-First scheme and 2) Waiting-Process-First scheme; as alternatives of handling idle processors, 1) Idle-Processor-Hold scheme and 2) Idle-Processor-Release scheme. These alternatives are examined through simulation experiments.

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

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

M3 - Conference contribution

AN - SCOPUS:0027795095

SN - 0818644400

SP - 343

EP - 351

BT - Proceedings - IEEE Computer Society's International Computer Software & Applications Conference

A2 - Anon, null

PB - Publ by IEEE

ER -