INVESTIGATION OF PROPAGATION-LIMITED COMPUTER NETWORKS.
Abstract
The report summarizes the results of the third year of research on techniques for the analysis, organization, and design of logical networks in which the propagation delays on the lines interconnecting the operational blocks of the network are appreciable compared to the delays within the blocks. During this reporting period, technical advances have been made in the area of purely asynchronous logic theory and design, in the newly posed area of locally synchronous network layout and design, and in the area of advanced computer organizations that take advantage of the characteristics of the propagation-limited assumptions. In asynchronous design theory, previous results on the state-logic relations for autonomous, nonsingular networks are extended to include the more general, and potentially much more economically realizable case where the network may be singular. Further, the totally sequential properties of networks composed of NOR elements with limited fan-in and fan-out are extensively examined with a view to determining their sequential machine behavior. The ultimate objective of this part of the study is to understand the relationships between the state-graph behavior that is possible, and realistic limitations that may be imposed on the logic blocks. Finally, a particular problem concerned with the initialization of antiparallel control logic modules is considered.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1966
- Accession Number
- AD0637769
Entities
People
- Bernard Elspas
- Jack Goldberg
- Karl N. Levitt
- Milton W. Green
- William H. Kautz
Organizations
- SRI International