Improved upper and lower bounds on the optimization of mixed chordal ring networks

DOI10.1016/J.IPL.2009.03.017zbMATH Open1217.68023OpenAlexW2017038534MaRDI QIDQ989480FDOQ989480

Authors: James K. Lan, Victor W. Liu, Chiuyuan Chen 

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.017

Recommendations

• Minimal diameter double-loop networks. I. Large infinite optimal families
• Designing of optimal double loop networks
• Minimal diameter double-loop networks: Dense optimal families
• A combinatorial problem related to distributed loop networks
• Double loop networks with minimum delay

zbMATH Keywords

optimizationringdiameterinterconnection networkparallel processingdouble-loop networkloopmixed chordal ring network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Weighted multi-connected loop networks
• Double commutative-step digraphs with minimum diameters
• An optimal message routing algorithm for double-loop networks
• Diameters of weighted double loop networks
• A complementary survey on double-loop networks
• An efficient algorithm to find optimal double loop networks
• Optimal double-loop networks with non-unit steps
• Double loop networks with minimum delay
• A dynamic fault-tolerant message routing algorithm for double-loop networks
• An efficient algorithm to find a double-loop network that realizes a given L-shape
• Connectivity of circulant digraphs
• Survival reliability of some double-loop networks and chordal rings

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Improved upper and lower bounds on the optimization of mixed chordal ring networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989480)