Logo image
在洗牌交換網路上的內嵌環狀網路
Thesis

在洗牌交換網路上的內嵌環狀網路

陳肯立
Masters, National Tsing Hua University
1999

Abstract

內嵌網路內嵌環狀網路洗牌交換網路 embedding networkEmbedding ringsshuffle-unshuffle-exchange-networkSUEN
The shuffle-unshuffle-exchange-network (SUEN) was introduced by Stone. It is one of the famous interconnection networks in the filed of parallel processing. In this thesis, we address the problem of embedding rings to SUEN with dilation 1 and load 1. Currently, the size of the largest ring that can be embedded with load 1 and dilation 1 to a SUEN of N processors is still an open problem. We show that given a SUEN of N processors, a ring of theta(N/log N) processors can be imbedded to it with load 1 and dilation 1. Besides, we further show that given any integer k£N/4log N, a ring of k’ processors can be imbedded to a SUEN of N processors with load 1 and dilation 1, where k-2lglglgN<= k’<= k+2lglglgN.

Metrics

1 Record Views

Details

Logo image