Yuri Nishikawa

Dr. Yuri Nishikawa

Intelligent Platform Research Center, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Japan
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010
Verified
Book Chapter
Closed access
PDF file
MYMasato Yoshimi
Masato Yoshimi
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
MMMitsunori Miki
Mitsunori Miki
THTomoyuki Hiroyasu
Tomoyuki Hiroyasu
HAHideharu Amano
Hideharu Amano
OMOskar Mencer
Oskar Mencer

1 November 2011
Verified
Conference Paper
Closed access
ASAkihiro Shitara
Akihiro Shitara
TNTetsuya Nakahama
Tetsuya Nakahama
MYMasahiro Yamada
Masahiro Yamada
TKToshiaki Kamata
Toshiaki Kamata
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
HAHideharu Amano
Hideharu Amano
Programming on the cluster with accelerators like GP-GPU tends to be a mixture of intra-node parallel library based on CUDA or OpenCL and inter-node communication library including MPI. In this work, we proposed, implemented and evaluated VEGETA, a middleware that can inject OpenCL program tasks written for multiple OpenCL accelerators in a single chassis to multiple OpenCL accelerators equipped in multiple chassis. Furthermore, we add a new feature called Virtual Direct Memory Access (VDMA) scheme, which supports direct data transfer to other node without writing back to the memory region on user application. In execution of a matrix multiplication benchmark on two, three and four nodes each provided performance improvement of 1.9, 2.8 and 3.8 times. Furthermore, as the result of executing advection term computation based on Cartesian grid method, 78% of the performance compared to that of MPI version was obtained even without use of VDMA, and moreover, 96% of that was achieved the system with VDMA.

1 August 2007
Verified
Conference Paper
Closed access
MYMasato Yoshimi
Masato Yoshimi
YIYow Iwaoka
Yow Iwaoka
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
TKToshinori Kojima
Toshinori Kojima
YOYasunori Osana
Yasunori Osana
HAHideharu Amano
Hideharu Amano
This paper introduces a scalable FPGA implementation of a stochastic simulation algorithm (SSA) called the next reaction method. There are some hardware approaches of SSAs that obtained high-throughput on reconfigurable devices such as FPGAs, but these works lacked in scalability. The design of this work can accommodate to the increasing size of target biochemical models, or to make use of increasing capacity of FPGAs. Interconnection network between arithmetic circuits and multiple simulation circuits aims to perform a data-driven multi-threading simulation. Approximately 8 times speedup was obtained compared to an execution on Xeon 2.80 GHz.

1 September 2007
Verified
Conference Paper
Closed access
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
MKMichihiro Koibuchi
Michihiro Koibuchi
MYMasato Yoshimi
Masato Yoshimi
KMKenichi Miura
Kenichi Miura
HAHideharu Amano
Hideharu Amano
This paper focuses on a performance of network-on-a- chip (NoC) and I/O of ClearSpeed's CSX600 coprocessor with 96 multithread processing elements. Two versions of the Himeno benchmark were implemented on the CSX600 to evaluate its performance when it encounters frequent memory transfers between shared and local memories, or between local memories. In order to efficiently use the NoC bandwidth, the dataflow was customized to the one- dimensional array structure of CSX600's NoC. The results of evaluation and profiling indicate that the performance was lower than 1/50 of the sustained performance. We show three key points to improve the performance on such a case: 1) exploiting bandwidth between mono and poly memory, 2) further program tuning, and 3) architectural reform.

21 June 2007 in Electronics and Communications in Japan (Part II: Electronics)
Verified
Journal Article
Closed access
PDF file
YOYasunori Osana
Yasunori Osana
MYMasato Yoshimi
Masato Yoshimi
YIYow Iwaoka
Yow Iwaoka
TKToshinori Kojima
Toshinori Kojima
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
HAHideharu Amano
Hideharu Amano

1 January 2018
Verified
Conference Paper
Closed access
Yuri NishikawaYuri Nishikawa
Yuri Nishikawa
HSHitoshi Sato
Hitoshi Sato
JOJun Ozawa
Jun Ozawa
Multiplayer tracking is a key technology for strategic analysis in team sports. Since existing solutions use high-resolution cameras and are also expensive to install, they are primarily for professionals and there are almost no solutions that consumers can easily obtain. We focused on K-Shortest Paths which performs well with low-end cameras located at a tripod-level height, where occasional detection failure may occur. We implemented a prototype that can generate visual tracking results based on the algorithm, investigated factors that influences tracking performance and computation time using multi-camera video sequences, and estimated computation time for tracking multiplayer in several team sports.