Keyword : distributed algorithms


An Energy Efficient Ranking Protocol for Radio Networks
Koji NAKANO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A  No. 5 ; pp. 1346-1354
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
power-aware computingadhoc networkssortingdistributed algorithmsrandomized algorithms
 Summary | Full Text:PDF(195.4KB)

An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
Jacir Luiz BORDIM Yasuaki ITO Koji NAKANO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A  No. 5 ; pp. 1355-1361
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
adhoc networkscollision detectiondistributed algorithmsrandomized algorithms
 Summary | Full Text:PDF(209.5KB)

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
Paola FLOCCHINI Antonio Mesa ENRIQUES Linda PAGLI Giuseppe PRENCIPE Nicola SANTORO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/02/01
Vol. E89-D  No. 2 ; pp. 700-708
Type of Manuscript:  Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking)
Category: Network Protocols, Topology and Fault Tolerance
Keyword: 
fault-tolerant routingpoint of failure reroutingshortest path spanning treeweighted graphsdistributed algorithms
 Summary | Full Text:PDF(369.9KB)

Compact Routing with Stretch Factor of Less Than Three
Kazuo IWAMA Akinori KAWACHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/01/01
Vol. E88-D  No. 1 ; pp. 47-52
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
distributed algorithmscompact routingstretch factor
 Summary | Full Text:PDF(172.2KB)

Proposal of a Tree Load Balancing Algorithm to Grid Computing Environments
Rodrigo Fernandes de MELLO Erico C. T. de MATTOS Luis Carlos TREVELIN Maria Stela Veludo de PAIVA Laurence T. YANG 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/07/01
Vol. E87-D  No. 7 ; pp. 1729-1736
Type of Manuscript:  Special Section PAPER (Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing)
Category: Software Support and Optimization Techniques
Keyword: 
load balancinggrid computingdistributed computingcomputer performancedistributed algorithms
 Summary | Full Text:PDF(527.4KB)

A Time- and Communication-Optimal Distributed Sorting Algorithm in a Line Network and Its Extension to the Dynamic Sorting Problem
Atsushi SASAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/02/01
Vol. E87-A  No. 2 ; pp. 444-453
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
distributed algorithmssortingtime complexitycommunication complexitydynamic sortingline network
 Summary | Full Text:PDF(377.9KB)

Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms
Xavier DEFAGO Andre SCHIPER Peter URBAN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/12/01
Vol. E86-D  No. 12 ; pp. 2698-2709
Type of Manuscript:  PAPER
Category: Computer Systems
Keyword: 
distributed algorithmsAtomic Broadcasttotal orderperformance analysiscontention-aware metrics
 Summary | Full Text:PDF(768.9KB)

Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
Masataka TAKAMURA Yoshihide IGARASHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2 ; pp. 246-254
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Parallel/Distributed Algorithms
Keyword: 
asynchronous shared memory modelBakery algorithmconcurrent computationdistributed algorithmsmutual exclusion
 Summary | Full Text:PDF(294.9KB)

A Time-Optimal Distributed Arrangement Selection Algorithm in a Line Network
Atsushi SASAKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2 ; pp. 228-237
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Parallel/Distributed Algorithms
Keyword: 
distributed algorithmsk-selectionsortingtime complexityline network
 Summary | Full Text:PDF(511.4KB)

Structure of Initial Conditions for Distributed Algorithms
Naoshi SAKAMOTO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/12/25
Vol. E83-D  No. 12 ; pp. 2029-2038
Type of Manuscript:  INVITED PAPER (Special Issue on the 1999 IEICE Excellent Paper Award)
Category: Theory and Models of Software
Keyword: 
distributed algorithmsanonymous networksleader election problem
 Summary | Full Text:PDF(370.1KB)

Computing the Stabilization Times of Self-Stabilizing Systems
Tatsuhiro TSUCHIYA Yusuke TOKUDA Tohru KIKUNO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/11/25
Vol. E83-A  No. 11 ; pp. 2245-2252
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
self-stabilizationstabilization timesautomated analysissymbolic representationdistributed algorithms
 Summary | Full Text:PDF(573.4KB)

Fault-Tolerant and Self-Stabilizing Protocols Using an Unreliable Failure Detector
Hiroyoshi MATSUI Michiko INOUE Toshimitsu MASUZAWA Hideo FUJIWARA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/10/25
Vol. E83-D  No. 10 ; pp. 1831-1840
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
distributed algorithmsself-stabilizationfault-tolerancefailure detectorx-group consensus
 Summary | Full Text:PDF(514.1KB)

Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks
Naoshi SAKAMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/04/25
Vol. E83-A  No. 4 ; pp. 620-626
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
distributed algorithmsanonymous networksleader election
 Summary | Full Text:PDF(369.1KB)

Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom
Toshimitsu MASUZAWA Michiko INOUE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3 ; pp. 550-560
Type of Manuscript:  INVITED SURVEY PAPER
Category: Parallel and Distributed Algorithms
Keyword: 
distributed systemdistributed algorithmsfault-toleranceself-stabilizationwait-freedom
 Summary | Full Text:PDF(479.5KB)

A Practical Method for Constructing a Semi-Optimal Coterie
Takashi HARADA Masafumi YAMASHITA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1999/12/25
Vol. E82-D  No. 12 ; pp. 1634-1638
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
availabilitycoteriedistributed algorithmsG-nondominatednessmutual exclusion problemsquorums
 Summary | Full Text:PDF(177.1KB)