A Combinatorial Problem Related to Multimodule Memory Organizations

DOI10.1145/321832.321838zbMath0353.68039OpenAlexW2077736855MaRDI QIDQ4124299

No author found.

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321838

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (87)

A simple algorithm to find the steps of double-loop networks ⋮ A survey on multi-loop networks. ⋮ Primal-dual simplex method for shooting ⋮ Mathematical properties of the hyperbolicity of circulant networks ⋮ The hyperbolicity constant of infinite circulant graphs ⋮ Greedy routing in circulant networks ⋮ Abelian Cayley digraphs with asymptotically large order for any given degree ⋮ Searching for large multi-loop networks ⋮ Connectivities of random circulant digraphs ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ Triple loop networks with small transmission delay ⋮ Dense Gaussian networks: Suitable topologies for on-chip multiprocessors ⋮ Large Cayley graphs on an abelian group ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ A new method for constructing infinite families of \(k\)-tight optimal double loop networks ⋮ Weighted multi-connected loop networks ⋮ INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR ⋮ A symbolical algorithm on additive basis and double-loop networks ⋮ Simplified Reliabilities for Consecutive-k-out-of-nSystems ⋮ The Waring's problem over finite fields through generalized Paley graphs ⋮ Large fault-tolerant interconnection networks ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ Connectedness of finite distance graphs ⋮ Fault-tolerant routings in double fixed-step networks ⋮ Minimal diameter double-loop networks: Dense optimal families ⋮ Network(graph) data research in the coordinate system ⋮ Embedding Circulant Networks into Butterfly and Benes Networks ⋮ Lower Bounds on Lattice Covering Densities of Simplices ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ The existence of hyper-L triple-loop networks. ⋮ Symmetry properties of chordal rings of degree 3 ⋮ Cyclic group blocking polyhedra ⋮ Hamiltonian numbers of Möbius double loop networks ⋮ Radio labelings of distance graphs ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Improved Bound for Dilation of an Embedding onto Circulant Networks ⋮ The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks ⋮ On Motzkin's problem in the circle group ⋮ Procreating tiles of double commutative-step digraphs ⋮ NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs ⋮ A unique arithmetic labeling of hexagonal lattices ⋮ Unnamed Item ⋮ Distributed loop network with minimum transmission delay ⋮ The computation and communication complexity of a parallel banded system solver ⋮ Double commutative-step digraphs with minimum diameters ⋮ Diameter lower bounds for Waring graphs and multiloop networks ⋮ The infinite families of optimal double loop networks ⋮ Unnamed Item ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ A complementary survey on double-loop networks ⋮ On the existence of hyper-L triple-loop networks ⋮ Tessellating polyominos in the plane ⋮ Fault-tolerant routings in chordal ring networks ⋮ Equivalent nondegenerate L-shapes of double-loop networks ⋮ An efficient algorithm to find a double-loop network that realizes a given L-shape ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ The degree-diameter problem for circulant graphs of degrees 10 and 11 ⋮ Optimal routing in double loop networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Linear layout of directed grid graph ⋮ Rotational circulant graphs ⋮ Geometric proof of Rødseth's formula for Frobenius numbers ⋮ Efficient elections in chordal ring networks ⋮ Connectivity and diameter in distance graphs ⋮ Wavelength routing of uniform instances in all-optical rings ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ Double loop networks with minimum delay ⋮ New dense families of triple loop networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs ⋮ An efficient algorithm to find optimal double loop networks ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs ⋮ Unnamed Item ⋮ Fault tolerant token ring embedding in double loop networks. ⋮ Clique, chromatic, and Lovász numbers of certain circulant graphs ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups ⋮ The index set problem for Boolean (or nonnegative) matrices ⋮ Designing of optimal double loop networks ⋮ A family of efficient six-regular circulants representable as a Kronecker product

This page was built for publication: A Combinatorial Problem Related to Multimodule Memory Organizations