Search For:

Displaying 1-5 out of 5 total
Compression of View on Anonymous Networks—Folded View—
Found in: IEEE Transactions on Parallel and Distributed Systems
By Seiichiro Tani
Issue Date:February 2012
pp. 255-262
View is a labeled directed graph containing all information about the network that a party can learn by exchanging messages with its neighbors. View can be used to solve distributed problems on an anonymous network (i.e., a network that does not guarantee ...
Design and Implementation of Advanced Multicast Router Based on Cluster Computing
Found in: Parallel and Distributed Systems, International Conference on
By Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima
Issue Date:July 2005
pp. 328-335
<p>This paper presents the design principles of an advanced multicast router and evaluates its performance in experiments. Our multicast router features cluster computing, which has been used to develop a high performance search engine and GRID compu...
Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer
Found in: Parallel and Distributed Processing Symposium, International
By Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, Kazuyoshi Matsuhiro
Issue Date:May 2000
pp. 535
A novel distributed-resource abstraction environment is introduced. You can access any resource in a computer network as a memory mapped I/O device, as if it was attached to the local bus of your PC. This network technology gives us several benefits. From ...
Exact Quantum Algorithms for the Leader Election Problem
Found in: ACM Transactions on Computation Theory (TOCT)
By Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Issue Date:March 2012
pp. 1-24
This article gives a separation between quantum and classical models in pure (i.e., noncryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of the leader election proble...
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks
Found in: Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC '09)
By Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Issue Date:August 2009
pp. 3-3
This paper proves that, if quantum communication and computation are available and the number of parties is given, the leader election problem can exactly (i.e., without error in bounded time) be solved with at most the same complexity up to a constant fac...