Recently Park and Chwa proposed recursive circulants as a versatile interconnection network topology for parallel computers[P92]. This thesis is concerned with the problems of embedding trees and pyraminds into recursive circulants. Algorithms that are particularly well suited to these structures can be efficiently modified for implementation on recursive circulants by such embeddings. We first present two efficient many-to-one embeddings of complete binary trees into recursive circulants : The one optimizing the value of particular cost guage-load factor, and the other dilation. The result can also be extended to the embedding of augmented binary trees which incorporate extra links to cinnect nodes in the same level of the tree. We also show that pyramids can be embedded into recursive circulants, optimizing dilation and keeping the number of wasted recursive circulant nodes to a minimum.
