The University of Southampton
University of Southampton Institutional Repository

Cube connected Mobius ladders: an inherently deadlock-free fixed degree network

Cube connected Mobius ladders: an inherently deadlock-free fixed degree network
Cube connected Mobius ladders: an inherently deadlock-free fixed degree network
The authors introduce a multiprocessor interconnection network, known as cube-connected Mobius ladders, which has an inherently deadlock-free routing strategy and hence has none of the buffering and computational overhead required by deadlock-avoidance message passing algorithms. The basic network has a diameter phi of 4n-1 for n2/sup n+2 /nodes and has a fixed node degree of 4. The network can be interval routed in two stages and can be represented as a Cayley graph. This is the only practical fixed degree topology of size O(2/sup phi /) which has an inherently deadlock-free routing strategy, making it ideally suited for medium and large sized transputer networks
1045-9219
111-117
Pritchard, D J
761da42d-24a3-4d22-8f41-19b510aae455
Nicole, D A
0aca6dd1-833f-4544-b7a4-58fb91c7395a
Pritchard, D J
761da42d-24a3-4d22-8f41-19b510aae455
Nicole, D A
0aca6dd1-833f-4544-b7a4-58fb91c7395a

Pritchard, D J and Nicole, D A (1993) Cube connected Mobius ladders: an inherently deadlock-free fixed degree network. IEEE Transactions on Parallel and Distributed Systems, 4 (1), 111-117. (doi:10.1109/71.205658).

Record type: Article

Abstract

The authors introduce a multiprocessor interconnection network, known as cube-connected Mobius ladders, which has an inherently deadlock-free routing strategy and hence has none of the buffering and computational overhead required by deadlock-avoidance message passing algorithms. The basic network has a diameter phi of 4n-1 for n2/sup n+2 /nodes and has a fixed node degree of 4. The network can be interval routed in two stages and can be represented as a Cayley graph. This is the only practical fixed degree topology of size O(2/sup phi /) which has an inherently deadlock-free routing strategy, making it ideally suited for medium and large sized transputer networks

Full text not available from this repository.

More information

Published date: 1993
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 251486
URI: https://eprints.soton.ac.uk/id/eprint/251486
ISSN: 1045-9219
PURE UUID: 1b7bb9e1-e5ee-4416-a2fd-d2a2ca49326a

Catalogue record

Date deposited: 03 Nov 1999
Last modified: 07 Nov 2018 17:31

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×