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

Tsutomu Hoshino

dblp:43/6963 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2001
0000-0002-8484-2752ORCID · corroborated

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

Systems, architecture and hardware · 8 · 5 first-authorArtificial intelligence and machine learning · 1

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
Parallel and multicore computing · 77% High-performance computing · 23%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel architecture
0.011983
PACS: A Parallel Microprocessor Array for Scientific Calculations · ACM Trans. Comput. Syst. 1983
Parallel and multicore computing › parallel computing
parallel scientific computing
0.011983
PACS: A Parallel Microprocessor Array for Scientific Calculations · ACM Trans. Comput. Syst. 1983
High-performance computing › numerical linear algebra › linear solver
poisson solver
0.011983
PACS: A Parallel Microprocessor Array for Scientific Calculations · ACM Trans. Comput. Syst. 1983
High-performance computing › scientific computing
scientific computing application
0.011983
PACS: A Parallel Microprocessor Array for Scientific Calculations · ACM Trans. Comput. Syst. 1983

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

barrier synchronization · 0.0
YearPublicationVenuePosition
2001 A Cellular Automata System with FPGA
Tomoyoshi Kobori, Tsutomu Maruyama, Tsutomu Hoshino
FCCM3
2001 A Music Synthesizer on FPGA
Takashi Saito, Tsutomu Maruyama, Tsutomu Hoshino, Saburo Hirano
FPL3
2000 A C to HDL Compiler for Pipeline Processing on FPGAs
abstract
In this paper, we show a compiler that generates high speed pipeline circuits for loop and recursive programs written in C programming language, which are the most time exhaustive parts in many application problems. The compiler has following features. First, all operations (except for memory accesses) are divided into cascades of 8-bit width (at maximum) operations in order to achieve high speed clock cycle. Second, in order to fulfil the pipeline, variables that have data feedback dependencies between loop cycles are specially scheduled based on several kinds of optimizing techniques. Furthermore, computations of each loop cycle are speculatively started in every clock cycle even if an array on the same memory bank may be accessed more than once in a loop cycle and there may be data feedback dependencies caused by the array accesses. When the array is accessed more than once, the pipeline is stalled while the array access operations are executed sequentially, and when the feedback dependencies are detected, the speculative computations are cancelled, and restarted after the updates of array are finished. Experiments on simple combinatorial programs showed that the pipeline circuits generated by the compiler run about 39-47 MHz on ALTERA EPF10KA serious (which is as fast as hand optimized circuits), and the speed up by the speculative execution is more than two.
Tsutomu Maruyama, Tsutomu Hoshino
FCCM2
1994 Egrets of a Feather Flock Together
abstract
Group foraging and colonial formation in avian species are examined with an artificial life (alife) model using genetic algorithms (GA) and neural networks. Horn's classical model predicts that colonial birds are more successful than territorial ones in a patchy resource environment, and the reverse is true when resources are evenly distributed. The weak point of the model is confusion between colony formation and flock foraging and implicit assumption of perfect knowledge of resource distribution by foraging birds. The authors made an alife model that realized both flock foraging and colonial formation simultaneously during evolution in a patchy environment. The reference organisms were egrets, which make colonial nests in the breeding season and colonial roosts in the nonbreeding season. In the computer model, artificial egrets used the presence of other egrets as an indicator to locate resource-rich patches in a resource-clumped environment. On the contrary, egrets were less reliant on other individuals as a source of foraging information in evenly distributed resource conditions. Colonial nesting was also induced only in a patchy environment where the foraging efficiency was always higher than the evenly distributed condition. Local enhancement played an important role in achieving colonial and flock foraging.
Yukihiko Toquenaga, Isamu Kajitani, Tsutomu Hoshino
Artif. Life3
1988 Mapping schemes of the particle-in-cell method implemented on the PAX computer
Tsutomu Hoshino, Robert Hiromoto, Satoshi Sekiguchi, S. Majima
Parallel Comput.1
1987 Mesh-connected parallel computer PAX for scientific applications
Tsutomu Hoshino, Tomonori Shirakawa, Keiichi Tsuboi
Parallel Comput.1
1985 Parallelized ADI Scheme Using GECR (Gauss-Elimination-Cyclic-Reduction) Method and Implementation of Navier-Stokes Equation in the PAX computer
Tsutomu Hoshino, Takeshi Kamimura, Toshihiro Iida, Tomonori Shirakawa
ICPP1
1983 Highly Parallel Processor Array "PAX" for Wide Scientific Applications
Tsutomu Hoshino, Tomonori Shirakawa, Takeshi Kamimura, Takahisa Kageyama, Kiyo Takenouchi, Hidehiko Abe, Satoshi Sekiguchi, Yoshio Oyanagi, Toshio Kawai
ICPP1
1983 PACS: A Parallel Microprocessor Array for Scientific Calculations
abstract
PACS-32 is a prototype supercomputer used for a broad range of scientific calculations.It has a synchronizable MIMD processor array, and on the basis of this facility, it provides efficient nearest neighbor communication.Processors are combined into a rectangular array with endaround connections, and can synchronize at user-specified points with little overhead.The hardware has been constructed with 32 processors, and the operating software includes a highlevel language.The PACS-32 system has performed in a number of applications, such as Poisson equation solving, nuclear reactor calculation, aerodynamics, Monte Carlo simulation of plasma particles, and molecular dynamics modeling in solid state physics.The processor efficiency measure ranges from 78 percent through 99 percent in these applications.
Tsutomu Hoshino, Toshio Kawai, Tomonori Shirakawa, Jun'ichi Higashino, Akira Yamaoka, Hachidai Ito, Kazuo Sawada
ACM Trans. Comput. Syst.1