Thompson, Richard A
(1991)
An Algorithm for Incrementally Controlling Benes Networks.
Technical Report.
School of Library and Information Science, University of Pittsburgh, Pittsburgh, PA.
![[img]](http://d-scholarship.pitt.edu/style/images/fileicons/text_plain.png) |
Plain Text (licence)
Available under License : See the attached license file.
Download (1kB)
|
Abstract
A two-part algorithm selects optimal paths through a rearrangeably nonblocking Benes network. In a complex one-time computation, the first part of the algorithm constructs a finite-state machine data base in which each state represents an equivalence class of network configurations. In a brief real-time computation, the second part of the algorithm accepts a call request, consults this base, and determines the optimal path by which to complete the call. Path optimality is based on reducing the chance that existing connections will need to be rearranged to allow new connections.
Share
| Citation/Export: |
|
| Social Networking: |
|
Details
| Item Type: |
Monograph
(Technical Report)
|
| Status: |
Published |
| Creators/Authors: |
|
| Monograph Type: |
Technical Report |
| Date: |
March 1991 |
| Date Type: |
Publication |
| Access Restriction: |
No restriction; Release the ETD for access worldwide immediately. |
| Publisher: |
School of Library and Information Science, University of Pittsburgh |
| Place of Publication: |
Pittsburgh, PA |
| Institution: |
University of Pittsburgh |
| Department: |
School of Library and Information Science |
| Schools and Programs: |
School of Information Sciences > Library and Information Science |
| Refereed: |
No |
| University of Pittsburgh Series: |
iSchool Research Report Series |
| Other ID: |
LIS037/IS91005 |
| Date Deposited: |
10 Apr 2013 18:56 |
| Last Modified: |
25 Aug 2017 05:03 |
| URI: |
http://d-scholarship.pitt.edu/id/eprint/18246 |
Metrics
Monthly Views for the past 3 years
Plum Analytics
Actions (login required)
 |
View Item |
![[feed]](/images/feed-icon-32x32.png){kind=icon}