A comparative study of job allocation and migration in the pancake network
From MaRDI portal
Publication:881866
DOI10.1016/J.INS.2006.12.024zbMath1116.68019OpenAlexW2044500120MaRDI 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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Robustness of star graph network under link failure
Cites Work
This page was built for publication: A comparative study of job allocation and migration in the pancake network
