### Abstract

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

Original language | English |
---|---|

Title of host publication | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 |

Publication status | Published - Dec 1 2008 |

Event | 2008 14th Asia-Pacific Conference on Communications, APCC 2008 - Akihabara, Tokyo, United States Duration: Oct 14 2008 → Oct 16 2008 |

### Publication series

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

### Other

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

Country | United States |

City | Akihabara, Tokyo |

Period | 10/14/08 → 10/16/08 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Communication

### Cite this

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

**Fast replica allocation method by parallel calculation on DAPDNA-2.** / Ishikawa, Hiroyuki; Shimizu, Sho; Arakawa, Yutaka; Yamanaka, Naoaki; Shiba, Kosuke.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2008 14th Asia-Pacific Conference on Communications, APCC 2008.*, 4773660, 2008 14th Asia-Pacific Conference on Communications, APCC 2008, 2008 14th Asia-Pacific Conference on Communications, APCC 2008, Akihabara, Tokyo, United States, 10/14/08.

}

TY - GEN

T1 - Fast replica allocation method by parallel calculation on DAPDNA-2

AU - Ishikawa, Hiroyuki

AU - Shimizu, Sho

AU - Arakawa, Yutaka

AU - Yamanaka, Naoaki

AU - Shiba, Kosuke

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=66149091052&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66149091052&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:66149091052

SN - 4885522323

SN - 9784885522321

T3 - 2008 14th Asia-Pacific Conference on Communications, APCC 2008

BT - 2008 14th Asia-Pacific Conference on Communications, APCC 2008

ER -