Name
Abstract | ||
|---|---|---|
In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-G can embed any cycle of length l, l@?{4,6,7,8,9,...,|G|^2}. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ipl.2010.11.027 | Inf. Process. Lett. |
Keywords | Field | DocType |
interesting instance,optoelectronic otis multicomputer network,pancyclicity property,factor graph g,swapped network,otis multicomputers,pancyclicity problem,global communication,great importance,3-d mesh,otis network,embedding,path,factor graph,parallel algorithm,cycle | Factor graph,Discrete mathematics,Embedding,Information processing,Parallel algorithm,Computer science,Algorithm,Theoretical computer science,Radix | Journal |
Volume | Issue | ISSN |
111 | 8 | 0020-0190 |
Citations | PageRank | References |
5 | 0.40 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Shafiei | 1 | 5 | 0.40 |
| M. R. Hoseiny-Farahabady | 2 | 7 | 0.77 |
| A. Movaghar | 3 | 197 | 32.28 |
| H. Sarbazi-Azad | 4 | 375 | 32.94 |