Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Toshikazu Ebisuzaki

dblp:93/1208 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-3918-1166ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 97% Computational science and engineering · 3%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
High-performance computing · 72% Hardware accelerators and domain-specific architectures · 28%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequence similarity search
0.512021
PZLAST: an ultra-fast amino acid sequence similarity search server against public metagenomes · Bioinform. 2021
Bioinformatics and computational biology › genome annotation
functional annotation
0.112021
PZLAST: an ultra-fast amino acid sequence similarity search server against public metagenomes · Bioinform. 2021
Bioinformatics and computational biology
metagenomics
0.112021
PZLAST: an ultra-fast amino acid sequence similarity search server against public metagenomes · Bioinform. 2021
Bioinformatics and computational biology › structural bioinformatics
protein structure determination
0.112007
A 281 Tflops calculation for X-ray protein structure analysis with special-purpose computers MDGRAPE-3 · SC 2007
High-performance computing
scientific computing systems
0.022000
1.34 Tflops Molecular Dynamics Simulation for NaCl with a Special-Purpose Computer: MDM · SC 2000
GRAPE-4: a one-Tflops special-purpose computer for astrophysical N-body problem · SC 1994
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.012000
1.34 Tflops Molecular Dynamics Simulation for NaCl with a Special-Purpose Computer: MDM · SC 2000
Mathematical optimization › evolutionary computation
genetic algorithm
0.012007
A 281 Tflops calculation for X-ray protein structure analysis with special-purpose computers MDGRAPE-3 · SC 2007
Hardware accelerators and domain-specific architectures
scientific computing accelerator
0.011994
GRAPE-4: a one-Tflops special-purpose computer for astrophysical N-body problem · SC 1994

Methods — techniques the papers use, named apart from their topics

ontology-based summarization · 0.5many-core processor acceleration · 0.5nonequispaced discrete fourier transformation · 0.2genetic algorithm · 0.2ewald summation · 0.1pipeline LSI · 0.0direct summation · 0.0
YearPublicationVenuePosition
2021 PZLAST: an ultra-fast amino acid sequence similarity search server against public metagenomes
abstract
SUMMARY: : Similarity searches of amino acid sequences against the public metagenomic data can provide users insights about the function of sequences based on the environmental distribution of similar sequences. However, a considerable reduction in the amount of data or the accuracy of the result was necessary to conduct sequence similarity searches against public metagenomic data, because of the vast data size more than Terabytes. Here, we present an ultra-fast service for the highly accurate amino acid sequence similarity search, called PZLAST, which can search the user's amino acid sequences to several Terabytes of public metagenomic sequences in ∼10-20 min. PZLAST accomplishes its search speed by using PEZY-SC2, which is a Multiple Instruction Multiple Data many-core processor. Results of PZLAST are summarized by the ontology-based environmental distribution of similar sequences. PZLAST can be used to predict the function of sequences and mine for homologs of functionally important gene sequences. AVAILABILITY AND IMPLEMENTATION: PZLAST is freely accessible at https://pzlast.riken.jp/meta without requiring registration. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Hiroshi Mori, Hitoshi Ishikawa, Koichi Higashi, Yoshiaki Kato, Toshikazu Ebisuzaki, Ken Kurokawa
Bioinform.5
2007 A 281 Tflops calculation for X-ray protein structure analysis with special-purpose computers MDGRAPE-3
abstract
We have achieved a sustained calculation speed of 281 Tflops for the optimization of the 3-D structures of proteins from the X-ray experimental data by the Genetic Algorithm - Direct Space (GA-DS) method. In this calculation we used MDGRAPE-3, special-purpose computer for molecular simulations, with the peak performance of 752 Tflops. In the GA-DS method, a set of selected parameters which define the crystal structures of proteins is optimized by the Genetic Algorithm. As a criterion to estimate the model parameters, we used the reliability factor R1 which indicates the statistical difference between the calculated and the measured diffraction data. To evaluate this factor it is necessary to reconstruct the diffraction patterns of the model structures every time the model is updated. Therefore, in this method the nonequispaced Discrete Fourier Transformation (DFT) used to calculate the diffraction patterns dominates most of the computation time. To accelerate DFT calculations, we used the special-purpose computer, MDGRAPE-3. A molecule, Carbamoyl-Phosphate Synthetase was investigated. The final reliability factors were much smaller than the typical values obtained in other methods such as the Molecular Replacement (MR) method. Our results successfully demonstrate that high-performance computing with GA-DS method on special-purpose computers is effective for the structure determination of biological molecules and the method has a potential to be widely used in near future.
Yousuke Ohno, Eiji Nishibori, Tetsu Narumi, Takahiro Koishi, Tahir H. Tahirov, Hideo Ago, Masashi Miyano, Ryutaro Himeno, Toshikazu Ebisuzaki, Makoto Sakata, Makoto Taiji
SC9
2000 1.34 Tflops Molecular Dynamics Simulation for NaCl with a Special-Purpose Computer: MDM
abstract
We performed molecular dynamics (MD) simulation of 9 million pairs of NaCl ions with the Ewald summation and obtained a calculation speed of 1.34 Tflops. In this calculation we used a special-purpose computer, MDM, which we are developing for the calculations of the Coulomb and van der Waals forces. The MDM enabled us to perform large scale MD simulations without truncating the Coulomb force. It is composed of WINE-2, MDGRAPE-2 and a host computer. WINE-2 accelerates the calculation for wavenumber-space part of the Coulomb force, while MDGRAPE-2 accelerates the calculation for real-space part of the Coulomb and van der Waals forces. The host computer performs other calculations. We performed MD simulation with the early version of the MDM system: 45 Tflops of WINE-2 and 1 Tflops of MDGRAPE-2. The peak performance of the final MDM system will reach 75 Tflops in total by the end of the year 2000.
Tetsu Narumi, Ryutaro Susukita, Takahiro Koishi, Kenji Yasuoka, Hideaki Furusawa, Atsushi Kawai, Toshikazu Ebisuzaki
SC7
1998 Performance of Parallel Solution of a Block-Tridiagonal Linear System on Fujitsu VPP500
Kousuke Sumiyoshi, Toshikazu Ebisuzaki
Parallel Comput.2
1994 GRAPE-4: a one-Tflops special-purpose computer for astrophysical N-body problem
abstract
We describe the GRAPE-4 (Gravity Pipe 4) system, a special-purpose computer for astrophysical N-body simulations. In N-body simulations, most of the computing time is spent to calculate the force between particles, since the number of interactions is proportional to the square of the number of particles. For many problems the accuracy of fast algorithms such as the particle-mesh scheme is not sufficient and we have to use the straightforward direct summation. In order to accelerate the force calculation, we have developed a series of hardware, the GRAPE (Gravity Pipe) systems. The basic idea of our GRAPE systems is to develop a hardware specialized for the force calculation. The rest of the calculation is performed on the general-purpose computer connected to GRAPE. The GRAPE-4 system is our newest hardware, scheduled to be completed in early 1995. Planned peak speed is 1.15 Tflops. This speed is achieved by running 1920 pipeline LSIs, each provides 600 Mflops, in parallel. A prototype system has been completed July 1994, and the full system is now under manufacturing.>
Junichiro Makino, Makoto Taiji, Toshikazu Ebisuzaki, Daiichiro Sugimoto
SC3
1990 GRAPE: a special-purpose computer for N-body problems
abstract
GRAPE (GRAvity PipE) is a special-purpose computer designed to accelerate the numerical integration of the astrophysical N-body problem. The prototype hardware, GRAPE-1, is designed as the backend processor that calculates the gravitational interaction between particles. All other calculations are performed on the host computer connected to GRAPE-1. For large-N calculations (N>or approximately=10/sup 4/), GRAPE-1 achieves about 200 Mflops equivalent in one board of the size of about 40 cm by 30 cm, consuming 2.5 W of power. The specialized pipelined architecture of the GRAPE-1 optimized for the large N calculation is the key to the high performance. The authors describe the design, construction and programming of GRAPE-1. The architecture is quite simple, and it is easy to put one pipeline into one LSI chip and make many pipelines work in parallel, without creating a communication bottleneck.>
Junichiro Makino, Tomoyoshi Ito, Toshikazu Ebisuzaki, Daiichiro Sugimoto
ASAP3