Professor Iain Stewart i.a.stewart@durham.ac.uk
Professor
In this paper we give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q_n^k is bipanconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Q_n^k is m-panconnected, for m = (n(k-1)+2k-6)\2, and (k-1)-pancyclic (these bounds are optimal). We introduce a path-shortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Q_n^k, even in the presence of a faulty processor.
Journal Article Type | Article |
---|---|
Publication Date | Jan 1, 2009 |
Deposit Date | Jun 9, 2009 |
Publicly Available Date | Jun 24, 2009 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Print ISSN | 1045-9219 |
Publisher | Institute of Electrical and Electronics Engineers |
Peer Reviewed | Peer Reviewed |
Volume | 20 |
Issue | 1 |
Pages | 25-33 |
DOI | https://doi.org/10.1109/tpds.2008.45 |
Keywords | Interconnection networks, k-ary n-cubes, Bipanconnectivity, Bipancyclicity. |
Public URL | https://durham-repository.worktribe.com/output/1554512 |
Publisher URL | http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4694808&arnumber=4479449&count=12&index=2 |
Published Journal Article
(1.4 Mb)
PDF
Copyright Statement
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Payment scheduling in the Interval Debt Model
(2023)
Presentation / Conference Contribution
An efficient shortest path routing algorithm in the data centre network DPillar
(2015)
Presentation / Conference Contribution
Routing packets on DPillar data centre networks
(2015)
Presentation / Conference Contribution
Routing algorithms for recursively-defined data centre networks
(2015)
Presentation / Conference Contribution
Accelerating ant colony optimization-based edge detection on the GPU using CUDA
(2014)
Presentation / Conference Contribution
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search