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

Hiroshi Masuyama

dblp:55/4549 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author

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
Interconnection networks and networks-on-chip · 46% Hardware reliability and fault tolerance · 30% Distributed systems · 23%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › network topology › loop networks
double-loop network
0.011989
Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989
Distributed systems
fault tolerance
0.011989
Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989
Hardware reliability and fault tolerance › network fault tolerance
multinode failure tolerance
0.011989
Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989
Interconnection networks and networks-on-chip
network topology
0.011989
Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989
Hardware reliability and fault tolerance
reliability analysis
0.011989
Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989

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

fault tolerance analysis · 0.0
YearPublicationVenuePosition
2008 A Broadcasting Algorithm Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks
Toshihiko Sasama, Yasuhiro Abe, Hiroshi Masuyama
WEBIST (1)3
2008 Evaluation of K-/Lattice-Clustering Algorithms for Random Wireless Multi-Hop Networks
Toshihiko Sasama, Ryo Monde, Hiroshi Masuyama
WEBIST (1)3
1995 The maximum dimensional fault-free subcube allocatable in faulty hypercube
abstract
The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective degradation of the system. The paper presents the maximum number of faults on an n-cube on which there always exists at least one fault-free (n-2)-subcube.
Hiroshi Masuyama, Toshihiko Sasama, Hiroyuki Hashimoto
ICCCN1
1989 Tolerance of Double-Loop Computer Networks to Multinode Failures
abstract
The reliability of double-loop networks is examined along with their fault tolerance in cases when more than two nodes break down. It is demonstrated that double-loop structured networks are very desirable with respect to the measure of fault tolerance introduced.>
Hiroshi Masuyama, Tetsuo Ichimori
IEEE Trans. Computers1