A comparative study of job allocation and migration in the pancake network
From MaRDI portal
Publication:881866
DOI10.1016/j.ins.2006.12.024zbMath1116.68019MaRDI QIDQ881866
Shahram Latifi, Naoto Kimura, Robert Bennes
Publication date: 18 May 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.12.024
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model, Robustness of star graph network under link failure, Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
Cites Work