Multicomputer Interconnection Using Word Parallel Shift Register Ring Networks
Horton, Kurt Harold
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69530
Description
Title
Multicomputer Interconnection Using Word Parallel Shift Register Ring Networks
Author(s)
Horton, Kurt Harold
Issue Date
1984
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Abstract
This thesis surveys existing processor-memory interconnection structures and investigates the word-parallel ring network in detail. It proposes a design for constructing a multimicrocomputer using such a network. The ring network operates as both a memory switch interconnecting processor nodes and shared memory, and as a high speed block transfer medium between nodes. The major limitation of the approach is the loop transit delay, which grows in direct proportion to ring size. Provided the loop time is small enough compared to the memory cycle time the operation will be acceptable. The ring network is attractive when ring clock times are much faster than memory cycle time.
The basic design is studied using both analytic and simulation models. The block transfer operation makes an analytic model intractable, so the simulation model is extended to include the new capability. The models provide three basic performance measures: memory utilization, ring utilization, and shared memory reference delay.
Operating as a memory switch, the request delay is mainly due to transit delay in the ring. Contention for ring entry is minor, while contention for ring exit is more significant because it incurs an additional loop around the ring. A protocol is developed which eliminates indefinite delay in the ring at the expense of slightly increased average delay. In addition, ring exit contention can be reduced by providing sufficient buffering for incoming requests.
The block transfer feature operates independently, and at a lower priority than the memory requests. It can utilize up to 50% of the ring bandwidth subject to availability. The remaining bandwidth is reserved for memory requests to ensure prompt service. Simulation results indicate that active block transfer creates only minimal additional delay for memory requests.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
