Embedding A Pyramid On The Hypercube With Minimal Routing Load

Abstract

The problem of embedding a pyramid on a boolean hypercube has been addressed. A maximal set of edges of the pyramid having an image edge in the hypercube is found. This is based on a breadth-first search that embeds a maximal bipartite subgraph of the pyramid. It has been shown that for a pyramid 70% of its edges may always have image edges in the hypercube. These edges may be statically mapped. This would reduce run-time routing load in the hypercube computer considerably.