On the public citation graph

On the Benefit of Supporting Virtual Channels in Wormhole Routers

https://doi.org/10.1006/jcss.2000.1701

0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1964.tb04103.xopenalex-snapshot

Optimal Rearrangeable Multistage Connecting Networks

inferredcites →https://doi.org/10.1002/rsa.3240020402openalex-snapshot

An algorithmic approach to the Lovász local lemma. I

inferredcites →https://doi.org/10.1002/rsa.3240020403openalex-snapshot

A parallel algorithmic version of the local lemma

inferredcites →https://doi.org/10.1006/jagm.1993.1024openalex-snapshot

Greedy Packet Scheduling on Shortest Paths

inferredcites →https://doi.org/10.1006/jagm.1994.1030openalex-snapshot

Randomized Routing and Sorting on Fixed-Connection Networks

inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot

A Faster Deterministic Maximum Flow Algorithm

inferredcites →https://doi.org/10.1006/jpdc.1996.0033openalex-snapshot

The Network Architecture of the Connection Machine CM-5

inferredcites →https://doi.org/10.1007/3-540-59042-0_81openalex-snapshot

A packet routing protocol for arbitrary networks

inferredcites →https://doi.org/10.1007/bf01215349openalex-snapshot

Packet routing and job-shop scheduling inO(congestion+dilation) steps

inferredcites →https://doi.org/10.1007/bf01660031openalex-snapshot

The torus routing chip

inferredcites →https://doi.org/10.1007/bf02090402openalex-snapshot

Fast algorithms for bit-serial routing on a hypercube

inferredcites →https://doi.org/10.1007/bfb0052928openalex-snapshot

Universal Routing Strategies for Interconnection Networks

inferredcites →https://doi.org/10.1007/s004930050042openalex-snapshot

A Pushing-Pulling Method: New Proofs of Intersection Theorems

inferredcites →https://doi.org/10.1007/s004930050061openalex-snapshot

Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules

inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot

Routing, merging, and sorting on parallel models of computation

inferredcites →https://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot

Virtual cut-through: A new computer communication switching technique

inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot

Randomized Algorithms

inferredcites →https://doi.org/10.1109/12.338097openalex-snapshot

Storage-efficient, deadlock-free packet routing algorithms for torus networks

inferredcites →https://doi.org/10.1109/12.53599openalex-snapshot

Performance analysis of k-ary n-cube interconnection networks

inferredcites →https://doi.org/10.1109/71.127260openalex-snapshot

Virtual-channel flow control

inferredcites →https://doi.org/10.1109/hicss.1995.375501openalex-snapshot

Fast algorithms for finding O(congestion+dilation) packet routing schedules

inferredcites →https://doi.org/10.1109/isca.2002.1003556openalex-snapshot

Proceedings 29th Annual International Symposium on Computer Architecture

inferredcites →https://doi.org/10.1109/proc.1964.3109openalex-snapshot

Proceedings of the symposium on mathematical theory of Automata

inferredcites →https://doi.org/10.1109/sfcs.1988openalex-snapshot

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/sfcs.1988.21939openalex-snapshot

Increasing the size of a network by a constant factor can increase performance by more than a constant factor

inferredcites →https://doi.org/10.1109/sfcs.1992openalex-snapshot

Proceedings., 33rd Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/sfcs.1992.267795openalex-snapshot

A theory of wormhole routing in parallel computers

inferredcites →https://doi.org/10.1109/sfcs.1994.365681openalex-snapshot

Nearly tight bounds for wormhole routing

inferredcites →https://doi.org/10.1109/sfcs.1994.365747openalex-snapshot

Proceedings 35th Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/spdp.1993.395550openalex-snapshot

Universal wormhole routing

inferredcites →https://doi.org/10.1109/spdp.1994.346189openalex-snapshot

Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing

inferredcites →https://doi.org/10.1109/spdp.1995.530674openalex-snapshot

Minimal, deadlock-free routing in hypercubic and arbitrary networks

inferredcites →https://doi.org/10.1109/tc.1983.1676169openalex-snapshot

The Performance of Multistage Interconnection Networks for Multiprocessors

inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

inferredcites →https://doi.org/10.1109/tcom.1980.1094666openalex-snapshot

Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward Deadlock

inferredcites →https://doi.org/10.1137/0211027openalex-snapshot

A Scheme for Fast Parallel Communication

inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot

Ten Lectures on the Probabilistic Method

inferredcites →https://doi.org/10.1137/s0097539796311818openalex-snapshot

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues

inferredcites →https://doi.org/10.1145/100216.100232openalex-snapshot

On-line algorithms for path selection in a nonblocking network

inferredcites →https://doi.org/10.1145/113379.113405openalex-snapshot

Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks

inferredcites →https://doi.org/10.1145/129712.129721openalex-snapshot

Methods for message routing in parallel machines

inferredcites →https://doi.org/10.1145/165123.165158openalex-snapshot

The J-machine multicomputer

inferredcites →https://doi.org/10.1145/167088.167237openalex-snapshot

How much can hardware help routing?

inferredcites →https://doi.org/10.1145/237502.237519openalex-snapshot

Universal continuous routing strategies

inferredcites →https://doi.org/10.1145/237814.237982openalex-snapshot

Universal algorithms for store-and-forward and wormhole routing

inferredcites →https://doi.org/10.1145/237814.237983openalex-snapshot

Distributed packet switching in arbitrary networks

inferredcites →https://doi.org/10.1145/258533.258658openalex-snapshot

A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria

inferredcites →https://doi.org/10.1145/258533.258659openalex-snapshot

Universal O(congestion + dilation + log1+εN) local control packet switching algorithms

inferredcites →https://doi.org/10.1145/3079079openalex-snapshot

Proceedings of the International Conference on Supercomputing

inferredcites →https://doi.org/10.1145/321439.321449openalex-snapshot

A Permutation Network

inferredcites →https://doi.org/10.1145/3618260openalex-snapshot

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

inferredcites →https://doi.org/10.1145/62297.62302openalex-snapshot

The architecture and programming of the Ametek series 2010 multicomputer

inferredcites →https://doi.org/10.1145/97444.97453openalex-snapshot

Tight bounds for oblivious routing in the hypercube

inferredcites →https://doi.org/10.24251/hicss.2024.000openalex-snapshot

Proceedings of the 57th Hawaii International Conference on System Sciences

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_6openalex-snapshot

Routing in Optical and Wireless Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-16621-2_31openalex-snapshot

Routing Method Based on the Excess Code for Fault Tolerant Clusters with InfiniBand

inferred← citeshttps://doi.org/10.1007/s10922-025-09932-1openalex-snapshot

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN

inferred← citeshttps://doi.org/10.1007/s11227-013-1041-5openalex-snapshot

Adaptive flow control in high-performance interconnection networks

inferred← citeshttps://doi.org/10.1049/ip-cdt:20050067openalex-snapshot

Implementation of guaranteed services in the MANGO clockless network-on-chip

inferred← citeshttps://doi.org/10.1109/norchp.2004.1423875openalex-snapshot

Virtual channel designs for guaranteeing bandwidth in asynchronous network-on-chip

inferred← citeshttps://doi.org/10.1145/1132952.1132953openalex-snapshot

A survey of research and practices of Network-on-chip

inferred← citeshttps://doi.org/10.17559/tv-20130424113708openalex-snapshot

Modular router architecture for high-performance interconnection networks

inferred← citeshttps://doi.org/10.25140/2411-5363-2019-1(15)-134-144openalex-snapshot

USING EXCESS CODE TO DESIGN FAULT-TOLERANT TOPOLOGIES

inferred← citeshttps://doi.org/10.4995/thesis/10251/2603openalex-snapshot

Efficient mechanisms to provide fault tolerance in interconnection networks for pc clusters

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.