### 抜粋

Replica placement problem is to select a subset from a group of potential nodes to put replicas in Content Distribution Network (CDN). It is derived from the set cover problem which is known to be NP-hard. So it is difficult to calculate the large-scale replica placement problem on a program counter-based processor. Several greedy algorithms are proposed in order to decrease calculation time. However, it was proved mathematically that no greedy algorithm can obtain the optimal solution. This paper proposes a fast calculation method of the replica placement problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Our proposed method divides the combination optimally and performs pipeline operation. Beeler's algorithm can calculate all combinations in ascending order but it has data dependence. It's difficult to calculate any pattern because each data increases irregularly. In order to solve this problem, we propose the new algorithm that generates any order pattern. In addition, the optimal number of partitions depends on the number of combinations and calculation clocks of Beeler's algorithm. In order to solve this problem, we think about the optimal division number in theory. While the time complexity of conventional method is proportional to the number of combinations, that of proposed method is proportional to the square root of the number of combinations. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 4 (2.8GHz). copyright

元の言語 | English |
---|---|

ホスト出版物のタイトル | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 |

出版物ステータス | Published - 2008 12 1 |

イベント | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 - Akihabara, Tokyo, United States 継続期間: 2008 10 14 → 2008 10 16 |

### 出版物シリーズ

名前 | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 |
---|

### Other

Other | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 |
---|---|

国 | United States |

市 | Akihabara, Tokyo |

期間 | 08/10/14 → 08/10/16 |

### ASJC Scopus subject areas

- Computer Networks and Communications
- Communication

## フィンガープリント Fast replica allocation method by parallel calculation on DAPDNA-2' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*2008 14th Asia-Pacific Conference on Communications, APCC 2008*[4773660] (2008 14th Asia-Pacific Conference on Communications, APCC 2008).