Yasuichi Nakayama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yasuichi Nakayama has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Akihiro Kaieda
Department of Computer Science, The University of Electro-Communications, Chofu, Tokyo 182-8585, Japan
1 shared publicationAtsuhiro Tanaka
NEC Corporation, Kawasaki 216-8555, Japan
1 shared publication- Hisashi Oguma
NTT DoCoMo R&D Center, Yokosuka, Kanagawa 239-8536, Japan
1 shared publication Issei Kino
NEC Corporation, Kawasaki 216-8555, Japan
1 shared publicationKohei Noshita
Tokyo, Japan
1 shared publication- Satoshi Kobayashi
University of Electro-Communications
1 shared publication
Latest Publications
- 9 August 2002
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 14 (10) , 841-857
Lesser Bear: A lightweight process library for SMP computers—scheduling mechanism without a lock operation
We have designed and implemented a lightweight process (thread) library called ‘Lesser Bear’ for SMP computers. Lesser Bear has thread‐level parallelism and high portability. Lesser Bear executes threads in parallel by creating UNIX processes as virtual processors and a memory‐mapped file as a huge shared‐memory space. To schedule thread in parallel, the shared‐memory space has been divided into working spaces for each virtual processor, and a ready queue has been distributed.However the previous version of Lesser Bear sometimes requires a lock operation for dequeueing. We therefore proposed a scheduling mechanism that does not require a lock operation. To achieve this, each divided space forms a link topology through the queues, and we use a lock‐free algorithm for the queue operation. This mechanism is applied to Lesser Bear and evaluated by experimental results. Copyright © 2002 John Wiley & Sons, Ltd.
- 9 August 2002
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 14 (10) , 841-857
Lesser Bear: A lightweight process library for SMP computers—scheduling mechanism without a lock operation
We have designed and implemented a lightweight process (thread) library called ‘Lesser Bear’ for SMP computers. Lesser Bear has thread‐level parallelism and high portability. Lesser Bear executes threads in parallel by creating UNIX processes as virtual processors and a memory‐mapped file as a huge shared‐memory space. To schedule thread in parallel, the shared‐memory space has been divided into working spaces for each virtual processor, and a ready queue has been distributed.However the previous version of Lesser Bear sometimes requires a lock operation for dequeueing. We therefore proposed a scheduling mechanism that does not require a lock operation. To achieve this, each divided space forms a link topology through the queues, and we use a lock‐free algorithm for the queue operation. This mechanism is applied to Lesser Bear and evaluated by experimental results. Copyright © 2002 John Wiley & Sons, Ltd.
- 27 February 2001
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 13 (2) , 141-152
Analysis and measurement of the effect of kernel locks in SMP systems
- 27 February 2001
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 13 (2) , 141-152
Analysis and measurement of the effect of kernel locks in SMP systems
- 1 January 2001
- Published by Springer Nature
- p. 277-286
Approximate Identification and Finite Elasticity
- 1 January 2001
- Published by Springer Nature
- p. 277-286
Approximate Identification and Finite Elasticity
- 1 June 1996
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 19 (2) , 94-99
A Parallel Algorithm for Solving Hard Tsume-Shogi Problems1
For the last four years, the power of Tsume-shogi solvers (i.e., programs for solving Japanese-chess problems) has advanced remarkably. Hard problems with 19 to 25 steps are now being attacked by several different types of search algorithms in the ho
- 1 June 1996
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 19 (2) , 94-99
A Parallel Algorithm for Solving Hard Tsume-Shogi Problems1
For the last four years, the power of Tsume-shogi solvers (i.e., programs for solving Japanese-chess problems) has advanced remarkably. Hard problems with 19 to 25 steps are now being attacked by several different types of search algorithms in the ho