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

Naoyuki Fujita

dblp:02/1982 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0003-3946-1288ORCID · corroborated

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

Systems, architecture and hardware · 6 · 1 first-authorApplied, 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 87% High-performance computing · 13%
Network and information security
1 paper
Network security · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › file systems
distributed file system
0.112006
Bandwidth challenge - Secure file sharing · SC 2006
Storage systems › secure storage
secure file sharing
0.112006
Bandwidth challenge - Secure file sharing · SC 2006
Network security › secure communication › network-layer security
IPsec
0.012006
Bandwidth challenge - Secure file sharing · SC 2006
Network security › secure communication
network-layer security
0.012006
Bandwidth challenge - Secure file sharing · SC 2006
High-performance computing › data transfer
high-speed data transfer
0.012006
Bandwidth challenge - Secure file sharing · SC 2006

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

protocol switching · 0.1data stream striping · 0.1TCP/IP parameter tuning · 0.1
YearPublicationVenuePosition
2021 Efficient Examples of Earth Observation Satellite Data Processing Using the Jaxa Supercomputer System and the Future for the Next Supercomputer System
abstract
By we continuously observe the entire earth with artificial satellites, it will be possible to accurately know the time-series changes in observation data for each region. In addition, it is possible to obtain knowledge that cannot be obtained by observation from the ground, such as local weather changes. These data are used to understand the global climate change in each region. It is very important that researchers get earth observation data as soon as possible. This is because we can greatly contribute to the progress of understanding on global environmental changes. We introduce two examples of satellite data processing using the JAXA supercomputer system (JAXA Supercomputer System Generation 2, hereinafter JSS2) and explain that JSS2 is an effective system for satellite data processing. In addition, we explain the prospect of satellite data processing using the next JAXA supercomputer (JAXA Supercomputer System Generation 3, hereinafter JSS3).
Masaki Yamada, Akira Fujioka, Naoyuki Fujita, Makiko Hashimoto, Yoko Ueda, Takanobu Aoki, Takahiro Minami, Masaya Torii, Tadahiro Yamamoto
IGARSS3
2019 Automatic Power Saving Method by Energy Aware Job Scheduler
abstract
Recently, increasing power usage of HPC systems is a critical issue. Therefore, effective power saving method for eliminating electricity waste are very important to develop.
Hiroaki Imade, Takahiro Kagami, Tomohiro Otawa, Kouichi Hirai, Yoshio Sakaguchi, Naoyuki Fujita
CLUSTER6
2014 An Experimental Analysis for Hardware Resource Management Using a New Strip Packing Problem
abstract
The use of PC cluster systems composed of many PCs is largely spread in these days. If there are many waiting jobs even when there is free resource, it is a waste of resource. So the algorithm to execute jobs as many as possible has been researched for decades. However this optimization problem is difficult to solve. So we propose algorithms based on a strip packing problem to arrange jobs. We performed numerical experiments and we show these results.
Rika Ito, Naoyuki Fujita
PDP2
2013 Partially reconfigurable flux calculation scheme in advection term computation
abstract
Fast Aerodynamics Routines (FaSTAR) is one of the most recent fluid dynamics software package. The problem of FaSTAR is hard to be executed in parallel machines because of its irregular and unpredictable data structure. Exploiting reconfigurable hardware with their advantages to make up for the inadequacy of the existing high performance computers had gradually become the solutions. However, a single FPGA is not enough for the FaSTAR package because the whole module is very large. Instead of using many FPGAs, partially reconfigurable hardware available in recent FPGAs is explored for this application. Advection term computation module in FaSTAR is chosen as a target subroutine. We proposed a reconfigurable flux calculation scheme using partial reconfiguration technique to save hardware resources to fit in a single FPGA. We developed flux computational module and five flux calculation schemes are implemented as reconfigurable modules. This implementation has advantages of up to 62.75% resource saving and enhancing the configuration speed by 6.28 times. Performance evaluation also shows that 2.65 times acceleration is achieved compared to Intel Core 2 Duo at 2.4 GHz.
Mohamad Sofian Abu Talip, Takayuki Akamine, Mao Hatto, Yasunori Osana, Naoyuki Fujita, Hideharu Amano
FPT5
2012 Reconfigurable out-of-order mechanism generator for unstructured grid computation in computational fluid dynamics
abstract
FaSTAR developed by JAXA is a leading edge CFD (Computational Fluid Dynamics) program package which supports various solvers based on unstructured grids. The computation based on unstructured grid causes a lot of pipeline stalls by RAW (Read After Write) hazard when reconfigurable accelerators are implemented in FPGAs. In order to cope with this problem, the OoO (Out-of-Order) mechanism generator is proposed. By setting parameters depending on the target computation, the OoO mechanism with appropriate structure of the execution unit and waiting buffer is generated. The OoO mechanisms are applied to five subroutines in FaSTAR, and it achieved 2.6 times performance as the case of in-order execution, and 2.9 times as the software executed by Intel Core2Duo processor with reasonable amount of overhead.
Takayuki Akamine, Kenta Inakagata, Yasunori Osana, Naoyuki Fujita, Hideharu Amano
FPL4
2009 Modularizing flux limiter functions for a Computational Fluid Dynamics accelerator on FPGAs
abstract
CFD is taken notice as a cost effective design tool for aircraft components. UPACS is a convenient CFD platform, since it supports a large degree of versatility using various kinds of solvers. However, its major drawback is a long simulation time. We have developed a UPACS accelerator named FLOPS-2D with multiple FPGA boards, and implemented some core functions. Here, by using flexibility of FPGAs, the selectable functions are proposed. All possible flux limiter functions in MUSCLs are implemented independently, and only required functions are selected and implemented with other modules to form the optimal structure. All implemented functions achieved at least 24 times higher performance than that with the Core 2 Duo, and configurable solvers using a desired flux limiter function and the number of arithmetic pipelines are developed.
Kenta Inakagata, Hirokazu Morishita, Yasunori Osana, Naoyuki Fujita, Hideharu Amano
FPL4
2008 Exploiting memory hierarchy for a Computational Fluid Dynamics accelerator on FPGAs
abstract
Computational Fluid Dynamics (CFD) is an important tool for aeronautical engineers. Instead of expensive super-computers or clusters, using custom pipelines built on FPGAs is expected to be a cost effective solution to accelerate CFD. The problem is that to keep the pipeline busy is difficult because of the memory bandwidth. To deal with this problem, an effective memory access method using Block-RAMs is implemented based on a careful survey about memory access pattern. This work is targetting on two major subroutines in UPACS, a CFD software package. As a result, the amount of data transfer is reduced about 40%. This shows 46–170fold speed-up is expected by several Virtex-4 FPGAs compared to Itanium2 processor.
Hirokazu Morishita, Yasunori Osana, Naoyuki Fujita, Hideharu Amano
FPT3
2006 Bandwidth challenge - Secure file sharing
abstract
SRFS on Ether adds an ethernet interface to the Shared Rapid File System (SRFS) that is currently used as a distributed file system between nodes by the HPC-system. It can be used like NFS and has solved the problem of data coherency in the high-speed transmission of data in a broadband environment, which NFS has not. Moreover, adjustment of the TCP/IP parameters in the OS to improve speed is unnecessary, and special hardware is not needed, unlike with the SAN construction by iFCP and others. For additional speed, it stripes data streams automatically (default MAX 8 streams), switches protocols between TCP and UDP based on IOsize.In this bandwidth challenge, we demonstrate security using a host-to-host IPSec connection between Tampa and Tokyo. To show performance, we used a hardware IPSec accelerator and tuned TCP/IP with SRFS on Ether's.
Naoyuki Fujita, Hirofumi Ohkawa
SC1