Work

Path-based, randomized, oblivious, minimal routing

Year: 2009

Type: conference-paper

Abstract: Path-based, Randomized, Oblivious, Minimal routing (PROM) is a family of oblivious, minimal, path-diverse routing algorithms especially suitable for Network-on-Chip applications with n x n mesh geometry. Rather than choosing among all possible paths at the source node, PROM algorithms achieve the same effect progressively through efficient, local randomized decisions at each hop. Routing is deadlock-free in all PROM algorithms when the routers have at least two virtual channels.

Source: International Workshop on Network on Chip Architectures (NoCArc)

DOI: 10.1145/1645213.1645220

Authors: Myong Hyon Cho, Mieszko Lis, Keun Sup Shim, Michel Kinsy, Srinivas Devadas

Institutions: MIT Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology

Language: English

Topic: Interconnection Networks and Systems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W1574476994

FWCI: 2.957

Cites: 16

Cited by: 19

Related to: 20