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.

Ken Miura

dblp:47/5284 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · unresolved

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

Systems, architecture and hardware · 3 · 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
2 papers
Distributed systems · 86% High-performance computing · 14%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
peer-to-peer systems
0.112006
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks · IEEE Trans. Parallel Distributed Syst. 2006
Distributed systems
fault tolerance
0.012006
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks · IEEE Trans. Parallel Distributed Syst. 2006
Distributed systems
quorum systems
0.012006
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks · IEEE Trans. Parallel Distributed Syst. 2006
High-performance computing
scientific computing systems
0.011991
Gordon Bell prize lectures · SC 1991
High-performance computing › supercomputing
supercomputing applications
0.011991
Gordon Bell prize lectures · SC 1991

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

probabilistic weak quorum system · 0.1
YearPublicationVenuePosition
2012 Node architecture and MAC protocol for full duplex wireless and directional antennas
abstract
In this paper, we propose a novel node architecture introducing directional antennas into full duplex wireless (FDW) technology. In the proposed architecture, each element of switched-beam antenna is connected to a software switch for directional antenna selection. A node needs only one set of digital and analog cancellation circuits, which is almost the same circuit scale and complexity of the conventional omnidirectional FDW node. In addition, we propose a MAC protocol for the proposed node architecture with FDW and directional antennas for avoiding collisions and obtaining the advantages of both techniques. We evaluate the performance of the proposed protocol via computer simulations, and show that the proposed protocol can improve end-to-end throughput performance up to 114 percent in a line-type multihop network. Moreover, we extend the proposed MAC protocol for mitigating the performance degradation in two-way traffic in line-type multihop networks, and confirm its effectiveness. To the best of our knowledge, this is the first work that attempts to use directional antennas in FDW networks.
Ken Miura, Masaki Bandai
PIMRC1
2006 A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
abstract
Peer-to-peer (P2P) system is an overlay network of peer computers without centralized servers, and many applications have been developed for such networks such as file sharing systems. Because a set of peers dynamically changes, design and verification of efficient protocols is a challenging task. In this paper, we consider an object searching problem under a resource model such that there are some replicas in a system and the lower bound of the ratio /spl rho/=n'/n is known in advance, where n' is a lower bound of the number of peers that hold original or replica for any object type and n is the total number of peers. In addition, we consider object searching with probabilistic success, i.e., for each object search, object must be found with at least probability 0</spl sigma/<1. To solve such a problem efficiently, we propose a new communication structure, named probabilistic weak quorum systems (PWQS), which is an extension of coterie. Then, we propose a fault-tolerant protocol for searching for objects in a P2P system. In our method, each peer does not maintain global information such as the set of all peers and a logical topology with global consistency. In our protocol, each peer communicates only a small part of a peer set and, thus, our protocol is adaptive for huge scale P2P network.
Ken Miura, Taro Tagawa, Hirotsugu Kakugawa
IEEE Trans. Parallel Distributed Syst.1
1992 Gordon Bell Prize Lectures 1992
Alan H. Karp, Ken Miura, Horst D. Simon
SC2
1991 Gordon Bell prize lectures
abstract
The Gordon Bell Prize recognizes significant achievements in the application of supercomputers to scientific and engineering problems.In this special session the winners of the 1990 pm"ze will give presentations about i!heir winning entries in the competition.
Jack J. Dongarra, Alan H. Karp, Ken Miura, Horst D. Simon
SC3