Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
396051 | Information Sciences | 2007 | 9 Pages |
Abstract
Pancake networks are an attractive class of Cayley graphs functioning as a viable interconnection scheme for large multi-processor systems. The hierarchy of the pancake graph allows the assignment of its special subgraphs, which have the same topological features as the original graph, to a sequence of incoming jobs. We investigate the hierarchical structure of the pancake network and derive a job allocation scheme for assigning processors to incoming jobs. An algorithm is presented for job migration. Finally, we compare the assignment scheme to those derived previously for the star network and address the shortcomings of the pancake network.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Robert Bennes, Shahram Latifi, Naoto Kimura,