The balanced binary tree technique on mesh-connected computers

DOI10.1016/0020-0190(91)90142-5zbMath0717.68035OpenAlexW2061226501MaRDI QIDQ2638775

Ridha Ziani, Alan M. Gibbons

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/60852/6/WRAP_cs-rr-156.pdf

zbMATH Keywords

PRAMmesh-connected arrays

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (1)

Dense edge-disjoint embedding of complete binary trees in interconnection networks

Cites Work

• Unnamed Item
• Unnamed Item
• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
• Optimal parallel generation of a computation tree form
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer

This page was built for publication: The balanced binary tree technique on mesh-connected computers