Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

DOI10.1109/TC.1983.1676279zbMath0514.68029MaRDI QIDQ3660901

P. C. P. Bhatt, S. N. Maheshwari, Dhruva Nath

Publication date: 1983

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

sortingparallel algorithmsinterconnection networksparallel processingmatrix multiplicationarea-time complexityorthogonal trees networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items

Reconfigurable meshes and image processing, Fault-tolerance VLSI sorters, Parallel computation of discrete Voronoi diagrams, Representing shared data on distributed-memory parallel computers, Embeddings on a Boolean cube, Parallel computation of distance transforms, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Parallel restructuring and evaluation of expressions, Embedding meshes of trees into deBruijn graphs, A framework for solving VLSI graph layout problems, An adaptive and cost-optimal parallel algorithm for minimum spanning trees, Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space