Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Task Allocation in the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Broadcasting on the star and pancake interconnection networks
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Embeddings into the pancake interconnection network
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
On Some Combinatorial Properties of the Star Graph
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Robustness of star graph network under link failure
Information Sciences: an International Journal
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
| Hi-index | 0.07 |
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.