eCommons

 

Deterministic On-Line Routing on Area-Universal Networks

Other Titles

Abstract

Two deterministic routing networks are presented: the pruned butterfly and the sorting fattree. Both networks are area-universal, i.e., they can simulate any other routing network fitting in similar area with polylogarithmic slowdown. Previous area-universal networks were either for the off-line problem, where the message set to be routed is known in advance and substantial precomputation is permitted, or involved randomization, yielding results that hold only with high probability. The two networks introduced here are the first that are simultaneously deterministic and on-line, and they use two substantially different routing techniques. The performance of their routing algorithms depends on the difficulty of the problem instance, which is measured by a quantity λ known as the load factor. The pruned butterfly algorithm runs in time O(λ log2 N), where N is the number of possible sources and detinations for messages and λ is assumed to be poylnomial in N. The sorting fat-tree algorithm runs in O (λ log N + log2 N) time for a restricted class of message sets including partial permutations. Other results of this work include a new type of sorting circuit and an area-time lower bound for routers.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1991-09

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1237

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record