NDLI: Deterministic on-line routing on area-universal networks

Content Provider	ACM Digital Library
Author	Bay, Paul Bilardi, Gianfranco
Copyright Year	1995
Abstract	Two deterministic routing networks are presented: the pruned butterfly and the sorting fat-tree. Both networks are area-universal, that is, 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 runs in time $\textit{O}(λlog2\textit{N}),$ is the number of possible sources and destinations for messages and λ is assumed to be polynomial in $\textit{N}.$ The sorting fat-tree algorithm runs in $\textit{O}(λ$ log $\textit{N}$ + log2 $\textit{N})$ time for a restricted class of message sets including partial permutations. Other results of this work include a “flexible” circuit that is area-time optimal across a range of different input sizes and an area-time lower bound for routers based on wire-length arguments.
Starting Page	614
Ending Page	640
Page Count	27
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/210346.210417
Journal	Journal of the ACM (JACM)
Volume Number	42
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1995-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Area-universal Fat-tree General purpose
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An $\textit{O}(log$ $\textit{N})$ deterministic packet-routing scheme

Efficient routing in optical networks

An Efficient General-Purpose Parallel Computer

Routing betweenness centrality

On-line routing of virtual circuits with applications to load balancing and machine scheduling

On the Parsing of Deterministic Languages

Counting networks

A System for General-Purpose Analog-Digital Computation

Decision tree reduction

Deterministic on-line routing on area-universal networks

Similar Documents

An $\textit{O}(log$ $\textit{N})$ deterministic packet-routing scheme

Efficient routing in optical networks

An Efficient General-Purpose Parallel Computer

Routing betweenness centrality

On-line routing of virtual circuits with applications to load balancing and machine scheduling

On the Parsing of Deterministic Languages

Counting networks

A System for General-Purpose Analog-Digital Computation

Decision tree reduction

Deterministic on-line routing on area-universal networks