抄録
The Kyushu University Reconfigurable Parallel Processor system under development is a MIMD-type multiprocessor which consists of 128 processing elements, interconnected by a full (128×128) crossbar network. Reconfigurable memory architecture employed by the system allows the system to be configured as either a shared-memory TCMP (tightly coupled multiprocessor), a message-passing LCMP (loosely coupled multiprocessor), or a hybrid of the two. A parallel operating system under development is for the shared-memory TCMP, and aims at extracting various kinds of parallelism of the operating system itself to provide high-performance. To exploit the parallelism, the operating system is constructed by using a message-pool mechanism. A typical example of the parallelism is the parallel creation of multiple threads. In this paper, we propose four schemes for the parallel creation; the simple parallel scheme, the parallel template scheme, the chunk scheme, and the combination scheme. Simulation results show that the chunk scheme is the most desirable among the schemes.
| 元の言語 | 英語 |
|---|---|
| ページ（範囲） | 423-432 |
| ページ数 | 10 |
| ジャーナル | Journal of Information Processing |
| 巻 | 14 |
| 発行部数 | 4 |
| 出版物ステータス | 出版済み - 12 1 1991 |
| 外部発表 | Yes |
| イベント | 3rd Computer System Symposium - Tokyo, Jpn 継続期間: 3 26 1991 → 3 27 1991 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
これを引用
Message-pool-based parallel operating system for the Kyushu University Reconfigurable Parallel Processor - parallel creation of multiple threads. / Tsunedomi, Kunihiko; Fukuda, Akira; Murakami, Kazuaki; Tomita, Shinji.
：: Journal of Information Processing, 巻 14, 番号 4, 01.12.1991, p. 423-432.研究成果: ジャーナルへの寄稿 › Conference article
}
TY - JOUR
T1 - Message-pool-based parallel operating system for the Kyushu University Reconfigurable Parallel Processor - parallel creation of multiple threads
AU - Tsunedomi, Kunihiko
AU - Fukuda, Akira
AU - Murakami, Kazuaki
AU - Tomita, Shinji
PY - 1991/12/1
Y1 - 1991/12/1
N2 - The Kyushu University Reconfigurable Parallel Processor system under development is a MIMD-type multiprocessor which consists of 128 processing elements, interconnected by a full (128×128) crossbar network. Reconfigurable memory architecture employed by the system allows the system to be configured as either a shared-memory TCMP (tightly coupled multiprocessor), a message-passing LCMP (loosely coupled multiprocessor), or a hybrid of the two. A parallel operating system under development is for the shared-memory TCMP, and aims at extracting various kinds of parallelism of the operating system itself to provide high-performance. To exploit the parallelism, the operating system is constructed by using a message-pool mechanism. A typical example of the parallelism is the parallel creation of multiple threads. In this paper, we propose four schemes for the parallel creation; the simple parallel scheme, the parallel template scheme, the chunk scheme, and the combination scheme. Simulation results show that the chunk scheme is the most desirable among the schemes.
AB - The Kyushu University Reconfigurable Parallel Processor system under development is a MIMD-type multiprocessor which consists of 128 processing elements, interconnected by a full (128×128) crossbar network. Reconfigurable memory architecture employed by the system allows the system to be configured as either a shared-memory TCMP (tightly coupled multiprocessor), a message-passing LCMP (loosely coupled multiprocessor), or a hybrid of the two. A parallel operating system under development is for the shared-memory TCMP, and aims at extracting various kinds of parallelism of the operating system itself to provide high-performance. To exploit the parallelism, the operating system is constructed by using a message-pool mechanism. A typical example of the parallelism is the parallel creation of multiple threads. In this paper, we propose four schemes for the parallel creation; the simple parallel scheme, the parallel template scheme, the chunk scheme, and the combination scheme. Simulation results show that the chunk scheme is the most desirable among the schemes.
UR - http://www.scopus.com/inward/record.url?scp=0026309095&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026309095&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0026309095
VL - 14
SP - 423
EP - 432
JO - Journal of Information Processing
JF - Journal of Information Processing
SN - 0387-6101
IS - 4
ER -