Title: Fully normal algorithms for incomplete hypercubes
Abstract: The paper shows that composite and incomplete hypercubes are algorithmically equivalent. It develops a class of algorithms called fully normal algorithms for incomplete hypercubes with applications in several important fields. Finally it shows that incomplete hypercubes achieve close to linear speedup for FNA over a wide range of the size of the architecture.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Publication Year: 2002
Publication Date: 2002-12-09
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot