Quotient Networks

DOI10.1109/TC.1982.1675994MaRDI QIDQ3953148zbMATH OpenOpenAlexFDO

Authors John P. Fishburn, Raphael Ari Finkel

Publication date 1982

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1982.1675994

zbMATH Keywords

interconnection networksparallel FFTprocessorsSIMD computerstheory of parallel algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(17)

• On tree-partition-width
• On mapping processes to processors in distributed systems
• A size-independent systolic array for matrix triangularization and eigenvalue computation
• The complexity of finding uniform emulations on fixed graphs
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Uniform homomorphisms of de Bruijn and Kautz networks
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
• Algebraic specification of interconnection network relationships by permutation voltage graph mappings
• The file distribution problem for processor networks
• Uniform emulations of Cartesian-product and Cayley graphs
• Embedding complete binary trees in product graphs
• Parameterized problems complete for nondeterministic FPT time and logarithmic space
• Tree-partitions with bounded degree trees
• Product structure of graph classes with bounded treewidth
• Product structure of graph classes with strongly sublinear separators
• Building heaps in parallel
• The complexity of finding uniform emulations on paths and ring networks

This page was built for publication: Quotient Networks

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