Optimal hypercube simulation on the partitioned optical passive stars network

Optimal hypercube simulation on the partitioned optical passive stars network (2007)

Cached

Download Links

[aeolus.ceid.upatras.gr]

Other Repositories/Bibliography

DBLP

by Charalampos Konstantopoulos , Christos Kaklamanis

Venue:	Journal of Supercomputing
Citations:	1 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Optimal hypercube simulation on the partitioned optical passive stars network	INFERENCE
AUTHOR NAME	Charalampos Konstantopoulos	SVM HeaderParse 0.2
AUTHOR AFFIL	Research Academic Computer Technology Institute and; Dept. of Computer Engineering and Informatics,; University of Patras, 26500 Rio	SVM HeaderParse 0.2
AUTHOR ADDR	Greece	SVM HeaderParse 0.2
AUTHOR NAME	Christos Kaklamanis	SVM HeaderParse 0.2
AUTHOR AFFIL	Research Academic Computer Technology Institute and; Dept. of Computer Engineering and Informatics,; University of Patras, 26500 Rio	SVM HeaderParse 0.2
AUTHOR ADDR	Greece	SVM HeaderParse 0.2
ABSTRACT	Partitioned Optimal Passive Stars network, POPS(d, g), is an optical interconnection network of N processors (N = dg) withg 2 optical passive star couplers. In this network, there are g groups of d processors each and the g 2 couplers are used for connecting each group with each of the groups, including itself. In this paper, we present an optimal simulation of a frequently arising hypercube communication pattern on this network for all combinations of values of d and g. Optimal simulation of this particular pattern for d ≤ g has already been presented in the literature, but for the case d>g, the optimality was elusive. Our simulation technique is the first in the literature that is optimal for all the range of values of d and g.	SVM HeaderParse 0.2
YEAR	2007	SVM HeaderParse 0.2
VENUE	Journal of Supercomputing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	165--180	INFERENCE
VOLUME	42	INFERENCE
CITATIONS	20 found	ParsCit 1.0