A Time-Optimal Distributed Arrangement Selection Algorithm in a Line Network (<Special Issue>Special Issue on Selected Papers from LA Symposium)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper defines the distributed arrangement selection problem in a line network in a distributed context and describes the design of a strictly-time-optimal algorithm which solves the problem with a limited local memory space. The problem is regarded as a combined distributed sorting and k-selection problem, namely a problem of sorting elements that are not larger than the kth minimum element in predetermined processes. The algorithm also provides a solution to a resource allocation problem in a line network in a strictly-optimal time.

• 一般社団法人電子情報通信学会の論文
• 2003-02-01

著者

• SASAKI Atsushi

  NTT Communication Science Laboratories, NTT Corporation

• Sasaki Atsushi

  Ntt Communication Science Laboratories Ntt Corporation

関連論文

• Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
• A Time- and Communication-Optimal Distributed Sorting Algorithm in a Line Network and Its Extension to the Dynamic Sorting Problem(Algorithms and Data Structures)
• A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring(Algorithms and Data Structures)
• A Time-Optimal Distributed Arrangement Selection Algorithm in a Line Network (Special Issue on Selected Papers from LA Symposium)

スポンサーリンク