Article thumbnail
Location of Repository

Constant-time algorithms for the channel assignment problem on processor arrays with reconfigurable bus systems

By 林順喜 and Shun-Shii Lin

Abstract

[[abstract]]In this paper, we present an O(1) time algorithm to solve the minimum coloring problem defined on a set of intervals, which is also called the channel assignment problem. This problem has not been solved in O(1) time before, even on the idealistic CRCW PRAM model. For large-sized problems, it is desirable to have fast hardware-solutions. Our algorithm is based on the processor arrays with a reconfigurable bus system (abbreviated to PARBS) that consists of a processor array and a reconfigurable bus system. In order to solve this problem with constant time complexity, we first transform the “left-edge” channel assignment algorithm to the parenthesis-matching problem. Based on this novel scheme, we are able to explore constant-time parallel algorithms to solve the minimum coloring problem for n intervals, which is also called the channel assignment problem, on a PARBS with O(n2) processors.

Topics: Complexity;computation model;channel-assignment problem;minimum-coloring problem;parallel processing;processor array;reconfigurable bus system, [[classification]]42
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Year: 2011
OAI identifier: oai:ir.lib.ntnu.edu.tw:309250000Q/22064
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://ir.lib.ntnu.edu.tw/ir/h... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.