DOCSLIB.ORG

The Bus Interface for 32-Bit Microprocessors That

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Bus Interface for 32-Bit Microprocessors That Freescale Semiconductor, Inc. MPC60XBUSRM 1/2004 Rev. 0.1 . c n I , r o t c u d n o c i PowerPC™ Microprocessor m e S Family: e l a c The Bus Interface for 32-Bit s e Microprocessors e r F For More Information On This Product, Go to: www.freescale.com Freescale Semiconductor, Inc... Freescale Semiconductor,Inc. F o r M o r G e o I n t f o o : r w m w a t w i o . f n r e O e n s c T a h l i e s . c P o r o m d u c t , Freescale Semiconductor, Inc. Overview 1 Signal Descriptions 2 Memory Access Protocol 3 Memory Coherency 4 . System Status Signals 5 . c n I Additional Bus Configurations 6 , r o t Direct-Store Interface 7 c u d n System Considerations 8 o c i m Processor Summary A e S e Processor Clocking Overview B l a c s Processor Upgrade Suggestions C e e r F L2 Considerations for the PowerPC 604 Processor D Coherency Action Tables E Glossary of Terms and Abbreviations GLO Index IND For More Information On This Product, Go to: www.freescale.com Freescale Semiconductor, Inc. 1 Overview 2 Signal Descriptions 3 Memory Access Protocol 4 Memory Coherency . 5 System Status Signals . c n I 6 Additional Bus Configurations , r o t 7 Direct-Store Interface c u d n 8 System Considerations o c i m A Processor Summary e S e B Processor Clocking Overview l a c s C Processor Upgrade Suggestions e e r F D L2 Considerations for the PowerPC 604 Processor E Coherency Action Tables GLO Glossary of Terms and Abbreviations IND Index For More Information On This Product, Go to: www.freescale.com Freescale Semiconductor, Inc. Contents SectionParagraph Page Number Title Number Table of Contents About This Document . Audience ............................................................................................................ xviii c Organization....................................................................................................... xviii n I Suggested Reading............................................................................................... xix , General Information..................................................................................... xix r PowerPC Documentation...............................................................................xx o t Conventions ........................................................................................................ xxii c Acronyms and Abbreviations ............................................................................ xxiii u d Chapter 1 n o Overview c i 1.1 PowerPC 60x Microprocessor Interface .............................................................. 1-1 m 1.2 PowerPC System Block Diagram ........................................................................ 1-3 e 1.3 Processor Bus Features ........................................................................................ 1-3 S 1.4 Bus Interface Signals ........................................................................................... 1-4 e l a Chapter 2 c Signal Descriptions s e 2.1 Address Bus Arbitration Signals.......................................................................... 2-2 e 2.1.1 Bus Request (BR)—Output ............................................................................. 2-2 r F 2.1.2 Bus Grant (BG)—Input ................................................................................... 2-2 2.1.3 Address Bus Busy (ABB)—Output................................................................. 2-3 2.1.4 Address Bus Busy (ABB)—Input.................................................................... 2-4 2.2 Address Transfer Start Signals............................................................................. 2-4 2.2.1 Transfer Start (TS)—Output ............................................................................ 2-4 2.2.2 Transfer Start (TS)—Input............................................................................... 2-5 2.2.3 Extended Address Transfer Start (XATS)—Output (Direct-Store) ................. 2-5 2.2.4 Extended Address Transfer Start (XATS)—Input (Direct-Store).................... 2-5 2.3 Address Transfer Signals ..................................................................................... 2-6 2.3.1 Address Bus (A[0–31])—Output (Memory Operations)................................. 2-6 2.3.2 Address Bus (A[0–31])—Input (Memory Operations) ................................... 2-6 Contents v For More Information On This Product, Go to: www.freescale.com Freescale Semiconductor, Inc. Contents Paragraph Page Number Title Number 2.3.3 Address Bus (A[0–31])—Output (Direct-Store Operations)........................... 2-7 2.3.4 Address Bus (A[0–31])—Input (Direct-Store Operations) ............................. 2-7 2.3.5 Address Bus Parity (AP[0–3])—Output.......................................................... 2-7 2.3.6 Address Bus Parity (AP[0–3])—Input............................................................. 2-8 2.3.7 Address Parity Error (APE)—Output.............................................................. 2-8 2.4 Address Transfer Attribute Signals...................................................................... 2-8 2.4.1 Transfer Type (TT[0–4])—Output................................................................... 2-9 2.4.2 Transfer Type (TT[0–4])—Input ..................................................................... 2-9 . 2.4.3 Transfer Burst (TBST)—Output.................................................................... 2-10 . 2.4.4 Transfer Burst (TBST)—Input ...................................................................... 2-11 c 2.4.5 Transfer Size (TSIZ[0–2])—Output .............................................................. 2-11 n 2.4.6 Transfer Size (TSIZ[0–2])—Input................................................................. 2-12 I , 2.4.7 Transfer Code (TCn)—Output....................................................................... 2-12 r 2.4.8 Cache Inhibit (CI)—Output........................................................................... 2-16 o t 2.4.9 Write-Through (WT)—Output ...................................................................... 2-17 c 2.4.10 Global (GBL)—Output.................................................................................. 2-17 u 2.4.11 Global (GBL)—Input .................................................................................... 2-17 d 2.4.12 Cache Set Element (CSEn)—Output............................................................. 2-18 n 2.4.13 High-Priority Snoop Request (HP_SNP_REQ)–601 Only............................ 2-18 o 2.5 Address Transfer Termination Signals............................................................... 2-18 c i 2.5.1 Address Acknowledge (AACK)—Input........................................................ 2-18 m 2.5.2 Address Retry (ARTRY)—Output................................................................. 2-19 e 2.5.3 Address Retry (ARTRY)—Input ................................................................... 2-20 S 2.5.4 Shared (SHD)—Output.................................................................................. 2-20 e 2.5.5 Shared (SHD)—Input .................................................................................... 2-20 l 2.6 Data Bus Arbitration Signals ............................................................................. 2-21 a c 2.6.1 Data Bus Grant (DBG)—Input...................................................................... 2-21 s 2.6.2 Data Bus Write Only (DBWO)—Input ......................................................... 2-22 e 2.6.3 Data Bus Busy (DBB)—Output .................................................................... 2-23 e 2.6.4 Data Bus Busy (DBB)—Input ....................................................................... 2-23 r F 2.7 Data Transfer Signals......................................................................................... 2-23 2.7.1 Data Bus (DH[0–31], DL[0–31])—Output ................................................... 2-24 2.7.2 Data Bus (DH[0–31], DL[0–31])—Input ...................................................... 2-24 2.7.3 Data Bus Parity (DP[0–7])—Output.............................................................. 2-25 2.7.4 Data Bus Parity (DP[0–7])—Input ................................................................ 2-26 2.7.5 Data Parity Error (DPE)—Output.................................................................. 2-26 2.7.6 Data Bus Disable (DBDIS)—Input ............................................................... 2-26 2.8 Data Transfer Termination Signals .................................................................... 2-27 2.8.1 Transfer Acknowledge (TA)—Input.............................................................. 2-27 2.8.2 Data Retry (DRTRY)—Input......................................................................... 2-27 2.8.3 Transfer Error Acknowledge (TEA)—Input ................................................. 2-28 PowerPC™ Microprocessors: Bus Interface for 32-Bit Microprocessors For More Information On This Product, Go to: www.freescale.com Freescale Semiconductor, Inc. Contents Paragraph Page Number Title Number 2.9 System Status Signals ........................................................................................ 2-29 2.9.1 Interrupt (INT)—Input................................................................................... 2-29 2.9.2 System Management Interrupt (SMI)—Input................................................ 2-29 2.9.3 Machine Check Interrupt (MCP)—Input....................................................... 2-30
Load more

Recommended publications
  • Metaclasses: Generative C++
    Metaclasses: Generative C++ Document Number: P0707 R3 Date: 2018-02-11 Reply-to: Herb Sutter ([email protected]) Audience: SG7, EWG Contents 1 Overview .............................................................................................................................................................2 2 Language: Metaclasses .......................................................................................................................................7 3 Library: Example metaclasses .......................................................................................................................... 18 4 Applying metaclasses: Qt moc and C++/WinRT .............................................................................................. 35 5 Alternatives for sourcedefinition transform syntax .................................................................................... 41 6 Alternatives for applying the transform .......................................................................................................... 43 7 FAQs ................................................................................................................................................................. 46 8 Revision history ............................................................................................................................................... 51 Major changes in R3: Switched to function-style declaration syntax per SG7 direction in Albuquerque (old: $class M new: constexpr void M(meta::type target,
    [Show full text]
  • Generic Programming
    Generic Programming July 21, 1998 A Dagstuhl Seminar on the topic of Generic Programming was held April 27– May 1, 1998, with forty seven participants from ten countries. During the meeting there were thirty seven lectures, a panel session, and several problem sessions. The outcomes of the meeting include • A collection of abstracts of the lectures, made publicly available via this booklet and a web site at http://www-ca.informatik.uni-tuebingen.de/dagstuhl/gpdag.html. • Plans for a proceedings volume of papers submitted after the seminar that present (possibly extended) discussions of the topics covered in the lectures, problem sessions, and the panel session. • A list of generic programming projects and open problems, which will be maintained publicly on the World Wide Web at http://www-ca.informatik.uni-tuebingen.de/people/musser/gp/pop/index.html http://www.cs.rpi.edu/˜musser/gp/pop/index.html. 1 Contents 1 Motivation 3 2 Standards Panel 4 3 Lectures 4 3.1 Foundations and Methodology Comparisons ........ 4 Fundamentals of Generic Programming.................. 4 Jim Dehnert and Alex Stepanov Automatic Program Specialization by Partial Evaluation........ 4 Robert Gl¨uck Evaluating Generic Programming in Practice............... 6 Mehdi Jazayeri Polytypic Programming........................... 6 Johan Jeuring Recasting Algorithms As Objects: AnAlternativetoIterators . 7 Murali Sitaraman Using Genericity to Improve OO Designs................. 8 Karsten Weihe Inheritance, Genericity, and Class Hierarchies.............. 8 Wolf Zimmermann 3.2 Programming Methodology ................... 9 Hierarchical Iterators and Algorithms................... 9 Matt Austern Generic Programming in C++: Matrix Case Study........... 9 Krzysztof Czarnecki Generative Programming: Beyond Generic Programming........ 10 Ulrich Eisenecker Generic Programming Using Adaptive and Aspect-Oriented Programming .
    [Show full text]
  • Java Application Programming Interface (API) Java Application Programming Interface (API) Is a List of All Classes That Are Part of the Java Development Kit (JDK)
    Java Application Programming Interface (API) Java application programming interface (API) is a list of all classes that are part of the Java development kit (JDK). It includes all Java packages, classes, and interfaces, along with their methods, fields, and constructors. These prewritten classes provide a tremendous amount of functionality to a programmer. A programmer should be aware of these classes and should know how to use them. A complete listing of all classes in Java API can be found at Oracle’s website: http://docs.oracle.com/javase/7/docs/api/. Please visit the above site and bookmark it for future reference. Please consult this site often, especially when you are using a new class and would like to know more about its methods and fields. If you browse through the list of packages in the API, you will observe that there are packages written for GUI programming, networking programming, managing input and output, database programming, and many more. Please browse the complete list of packages and their descriptions to see how they can be used. In order to use a class from Java API, one needs to include an import statement at the start of the program. For example, in order to use the Scanner class, which allows a program to accept input from the keyboard, one must include the following import statement: import java.util.Scanner; The above import statement allows the programmer to use any method listed in the Scanner class. Another choice for including the import statement is the wildcard option shown below: import java.util.*; This version of the import statement imports all the classes in the API’s java.util package and makes them available to the programmer.
    [Show full text]
  • A Metaobject Protocol for Fault-Tolerant CORBA Applications
    A Metaobject Protocol for Fault-Tolerant CORBA Applications Marc-Olivier Killijian*, Jean-Charles Fabre*, Juan-Carlos Ruiz-Garcia*, Shigeru Chiba** *LAAS-CNRS, 7 Avenue du Colonel Roche **Institute of Information Science and 31077 Toulouse cedex, France Electronics, University of Tsukuba, Tennodai, Tsukuba, Ibaraki 305-8573, Japan Abstract The corner stone of a fault-tolerant reflective The use of metalevel architectures for the architecture is the MOP. We thus propose a special implementation of fault-tolerant systems is today very purpose MOP to address the problems of general-purpose appealing. Nevertheless, all such fault-tolerant systems ones. We show that compile-time reflection is a good have used a general-purpose metaobject protocol (MOP) approach for developing a specialized runtime MOP. or are based on restricted reflective features of some The definition and the implementation of an object-oriented language. According to our past appropriate runtime metaobject protocol for implementing experience, we define in this paper a suitable metaobject fault tolerance into CORBA applications is the main protocol, called FT-MOP for building fault-tolerant contribution of the work reported in this paper. This systems. We explain how to realize a specialized runtime MOP, called FT-MOP (Fault Tolerance - MetaObject MOP using compile-time reflection. This MOP is CORBA Protocol), is sufficiently general to be used for other aims compliant: it enables the execution and the state evolution (mobility, adaptability, migration, security). FT-MOP of CORBA objects to be controlled and enables the fault provides a mean to attach dynamically fault tolerance tolerance metalevel to be developed as CORBA software. strategies to CORBA objects as CORBA metaobjects, enabling thus these strategies to be implemented as 1 .
    [Show full text]
  • Variable-Arity Generic Interfaces
    Variable-Arity Generic Interfaces T. Stephen Strickland, Richard Cobbe, and Matthias Felleisen College of Computer and Information Science Northeastern University Boston, MA 02115 [email protected] Abstract. Many programming languages provide variable-arity func- tions. Such functions consume a fixed number of required arguments plus an unspecified number of \rest arguments." The C++ standardiza- tion committee has recently lifted this flexibility from terms to types with the adoption of a proposal for variable-arity templates. In this paper we propose an extension of Java with variable-arity interfaces. We present some programming examples that can benefit from variable-arity generic interfaces in Java; a type-safe model of such a language; and a reduction to the core language. 1 Introduction In April of 2007 the C++ standardization committee adopted Gregor and J¨arvi's proposal [1] for variable-length type arguments in class templates, which pre- sented the idea and its implementation but did not include a formal model or soundness proof. As a result, the relevant constructs will appear in the upcom- ing C++09 draft. Demand for this feature is not limited to C++, however. David Hall submitted a request for variable-arity type parameters for classes to Sun in 2005 [2]. For an illustration of the idea, consider the remarks on first-class functions in Scala [3] from the language's homepage. There it says that \every function is a value. Scala provides a lightweight syntax for defining anonymous functions, it supports higher-order functions, it allows functions to be nested, and supports currying." To achieve this integration of objects and closures, Scala's standard library pre-defines ten interfaces (traits) for function types, which we show here in Java-like syntax: interface Function0<Result> { Result apply(); } interface Function1<Arg1,Result> { Result apply(Arg1 a1); } interface Function2<Arg1,Arg2,Result> { Result apply(Arg1 a1, Arg2 a2); } ..
    [Show full text]
  • On the Interaction of Object-Oriented Design Patterns and Programming
    On the Interaction of Object-Oriented Design Patterns and Programming Languages Gerald Baumgartner∗ Konstantin L¨aufer∗∗ Vincent F. Russo∗∗∗ ∗ Department of Computer and Information Science The Ohio State University 395 Dreese Lab., 2015 Neil Ave. Columbus, OH 43210–1277, USA [email protected] ∗∗ Department of Mathematical and Computer Sciences Loyola University Chicago 6525 N. Sheridan Rd. Chicago, IL 60626, USA [email protected] ∗∗∗ Lycos, Inc. 400–2 Totten Pond Rd. Waltham, MA 02154, USA [email protected] February 29, 1996 Abstract Design patterns are distilled from many real systems to catalog common programming practice. However, some object-oriented design patterns are distorted or overly complicated because of the lack of supporting programming language constructs or mechanisms. For this paper, we have analyzed several published design patterns looking for idiomatic ways of working around constraints of the implemen- tation language. From this analysis, we lay a groundwork of general-purpose language constructs and mechanisms that, if provided by a statically typed, object-oriented language, would better support the arXiv:1905.13674v1 [cs.PL] 31 May 2019 implementation of design patterns and, transitively, benefit the construction of many real systems. In particular, our catalog of language constructs includes subtyping separate from inheritance, lexically scoped closure objects independent of classes, and multimethod dispatch. The proposed constructs and mechanisms are not radically new, but rather are adopted from a variety of languages and programming language research and combined in a new, orthogonal manner. We argue that by describing design pat- terns in terms of the proposed constructs and mechanisms, pattern descriptions become simpler and, therefore, accessible to a larger number of language communities.
    [Show full text]
  • Generic Programming
    Generic Programming Read Ch5 1 Outline • Why do we need generic programming? • Generic class • Generic method • Java interface, generic interface • Java object type and conversion 2 Why do we need generic class? • IntNode/DoubleNode/ByteNode/LocaonNode/… • IntArrayBag/DoubleArrayBag/ByteArrayBag/LocaonBag/… • A generic class (e.g., bag, node) can be used for all the above possible bags. 3 Outline • Why do we need generic programming? • Generic class • Generic method • Java interface, generic interface • Java object type and conversion 4 Generic Class public class ArrayBag<E> implements Cloneable{ private E[ ] data; private int manyItems; public void add(E element){ //similar implementaon as in IntArrayBag} … } Use a generic class: ArrayBag<Integer> intbag = new ArrayBag<Integer>(); ArrayBag<String> strbag = new ArrayBag<String>(); intbag.add(4); strbag.add(“Hello”); 5 Something to pay aenJon -- constructor public ArrayBag(int iniJalCapacity) { if (iniJalCapacity < 0) throw new IllegalArgumentExcepJon ("The iniJalCapacity is negave: " + iniJalCapacity); data = (E[]) new Object[iniJalCapacity]; manyItems = 0; } data = new E[iniJalCapacity]; WRONG 6 Something to pay aenJon -- elements • IntArrayBag – Data contains the real value of each element • ArrayBag<E> – E[] data contains the reference to the real objects • Example • Implementaons of Equals, countOfOccurences, search, etc. for(int i=0; i<data.length;i++) if(data[i]==paramObj.data[i] … for(int i=0; i<data.length;i++) if(data[i].equals(paramObj.data[i]); … 7 Something to pay aenJon –
    [Show full text]
  • Interface Definition Language (IDL)
    An OMG® Interface Definition Language™ Publication Interface Definition Language™ Version 4.2 OMG Document Number: formal/18-01-05 Release Date: March 2018 Standard Document URL: http://www.omg.org/spec/IDL/4.2/ IPR mode: Non-Assert Copyright © 1997-2001, Electronic Data Systems Corporation Copyright © 1997-2001, Hewlett-Packard Company Copyright © 1997-2001, IBM Corporation Copyright © 1997-2001, ICON Computing Copyright © 1997-2001, i-Logix Copyright © 1997-2001, IntelliCorp Copyright © 1997-2001, Microsoft Corporation Copyright © 1997-2001, ObjectTime Limited Copyright © 1997-2001, Oracle Corporation Copyright © 1997-2001, Platinum Technology, Inc. Copyright © 1997-2001, Ptech Inc. Copyright © 1997-2001, Rational Software Corporation Copyright © 1997-2001, Reich Technologies Copyright © 1997-2001, Softeam Copyright © 1997-2001, Sterling Software Copyright © 1997-2001, Taskon A/S Copyright © 1997-2001, Unisys Corporation Copyright © 2002, Laboratoire d’Informatique Fondamentale de Lille Copyright © 2013-2017, Thales Copyright © 2013-2017, Real-Time Innovations, Inc. Copyright © 2018, Object Management Group, Inc. USE OF SPECIFICATION – TERMS, CONDITIONS & NOTICES The material in this document details an Object Management Group specification in accordance with the terms, conditions and notices set forth below. This document does not represent a commitment to implement any portion of this specification in any company's products. The information contained in this document is subject to change without notice. LICENSES The companies listed above have granted to the Object Management Group, Inc. (OMG) a nonexclusive, royalty-free, paid up, worldwide license to copy and distribute this document and to modify this document and distribute copies of the modified version. Each of the copyright holders listed above has agreed that no person shall be deemed to have infringed the copyright in the included material of any such copyright holder by reason of having used the specification set forth herein or having conformed any computer software to the specification.
    [Show full text]
  • A Bibliography of Publications in IEEE Micro
    A Bibliography of Publications in IEEE Micro Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 16 September 2021 Version 2.108 Title word cross-reference -Core [MAT+18]. -Cubes [YW94]. -D [ASX19, BWMS19, DDG+19, Joh19c, PZB+19, ZSS+19]. -nm [ABG+16, KBN16, TKI+14]. #1 [Kah93i]. 0.18-Micron [HBd+99]. 0.9-micron + [Ano02d]. 000-fps [KII09]. 000-Processor $1 [Ano17-58, Ano17-59]. 12 [MAT 18]. 16 + + [ABG+16]. 2 [DTH+95]. 21=2 [Ste00a]. 28 [BSP 17]. 024-Core [JJK 11]. [KBN16]. 3 [ASX19, Alt14e, Ano96o, + AOYS95, BWMS19, CMAS11, DDG+19, 1 [Ano98s, BH15, Bre10, PFC 02a, Ste02a, + + Ste14a]. 1-GHz [Ano98s]. 1-terabits DFG 13, Joh19c, LXB07, LX10, MKT 13, + MAS+07, PMM15, PZB+19, SYW+14, [MIM 97]. 10 [Loc03]. 10-Gigabit SCSR93, VPV12, WLF+08, ZSS+19]. 60 [Gad07, HcF04]. 100 [TKI+14]. < [BMM15]. > [BMM15]. 2 [Kir84a, Pat84, PSW91, YSMH91, ZACM14]. [WHCK18]. 3 [KBW95]. II [BAH+05]. ∆ 100-Mops [PSW91]. 1000 [ES84]. 11- + [Lyl04]. 11/780 [Abr83]. 115 [JBF94]. [MKG 20]. k [Eng00j]. µ + [AT93, Dia95c, TS95]. N [YW94]. x 11FO4 [ASD 05]. 12 [And82a]. [DTB01, Dur96, SS05]. 12-DSP [Dur96]. 1284 [Dia94b]. 1284-1994 [Dia94b]. 13 * [CCD+82]. [KW02]. 1394 [SB00]. 1394-1955 [Dia96d]. 1 2 14 [WD03]. 15 [FD04]. 15-Billion-Dollar [KR19a].
    [Show full text]
  • The RPC Abstraction
    The RPC abstraction • Procedure calls well-understood mechanism - Transfer control and data on single computer • Goal: Make distributed programming look same - Code libraries provide APIs to access functionality - Have servers export interfaces accessible through local APIs • Implement RPC through request-response protocol - Procedure call generates network request to server - Server return generates response Interface Definition Languages • Idea: Specify RPC call and return types in IDL • Compile interface description with IDL compiler. Output: - Native language types (e.g., C/Java/C++ structs/classes) - Code to marshal (serialize) native types into byte streams - Stub routines on client to forward requests to server • Stub routines handle communication details - Helps maintain RPC transparency, but - Still had to bind client to a particular server - Still need to worry about failures Intro to SUN RPC • Simple, no-frills, widely-used RPC standard - Does not emulate pointer passing or distributed objects - Programs and procedures simply referenced by numbers - Client must know server—no automatic location - Portmap service maps program #s to TCP/UDP port #s • IDL: XDR – eXternal Data Representation - Compilers for multiple languages (C, java, C++) Sun XDR • “External Data Representation” - Describes argument and result types: struct message { int opcode; opaque cookie[8]; string name<255>; }; - Types can be passed across the network • Libasync rpcc compiles to C++ - Converts messages to native data structures - Generates marshaling routines (struct $ byte stream) - Generates info for stub routines Basic data types • int var – 32-bit signed integer - wire rep: big endian (0x11223344 ! 0x11, 0x22, 0x33, 0x44) - rpcc rep: int32 t var • hyper var – 64-bit signed integer - wire rep: big endian - rpcc rep: int64 t var • unsigned int var, unsigned hyper var - wire rep: same as signed - rpcc rep: u int32 t var, u int64 t var More basic types • void – No data - wire rep: 0 bytes of data • enum {name = constant,.
    [Show full text]
  • Avalon® Interface Specifications
    Avalon® Interface Specifications Updated for Intel® Quartus® Prime Design Suite: 20.1 Subscribe MNL-AVABUSREF | 2021.05.27 Send Feedback Latest document on the web: PDF | HTML Contents Contents 1. Introduction to the Avalon® Interface Specifications......................................................4 1.1. Avalon Properties and Parameters............................................................................5 1.2. Signal Roles..........................................................................................................5 1.3. Interface Timing....................................................................................................5 1.4. Example: Avalon Interfaces in System Designs.......................................................... 5 2. Avalon Clock and Reset Interfaces..................................................................................8 2.1. Avalon Clock Sink Signal Roles................................................................................ 8 2.2. Clock Sink Properties............................................................................................. 9 2.3. Associated Clock Interfaces ....................................................................................9 2.4. Avalon Clock Source Signal Roles.............................................................................9 2.5. Clock Source Properties..........................................................................................9 2.6. Reset Sink.........................................................................................................
    [Show full text]
  • Architectural Trade-Offs in a Latency Tolerant Gallium Arsenide Microprocessor
    Architectural Trade-offs in a Latency Tolerant Gallium Arsenide Microprocessor by Michael D. Upton A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Electrical Engineering) in The University of Michigan 1996 Doctoral Committee: Associate Professor Richard B. Brown, CoChairperson Professor Trevor N. Mudge, CoChairperson Associate Professor Myron Campbell Professor Edward S. Davidson Professor Yale N. Patt © Michael D. Upton 1996 All Rights Reserved DEDICATION To Kelly, Without whose support this work may not have been started, would not have been enjoyed, and could not have been completed. Thank you for your continual support and encouragement. ii ACKNOWLEDGEMENTS Many people, both at Michigan and elsewhere, were instrumental in the completion of this work. I would like to thank my co-chairs, Richard Brown and Trevor Mudge, first for attracting me to Michigan, and then for allowing our group the freedom to explore many different ideas in architecture and circuit design. Their guidance and motivation combined to make this a truly memorable experience. I am also grateful to each of my other dissertation committee members: Ed Davidson, Yale Patt, and Myron Campbell. The support and encouragement of the other faculty on the project, Karem Sakallah and Ron Lomax, is also gratefully acknowledged. My friends and former colleagues Mark Rossman, Steve Sugiyama, Ray Farbarik, Tom Rossman and Kendall Russell were always willing to lend their assistance. Richard Oettel continually reminded me of the valuable support of friends and family, and the importance of having fun in your work. Our corporate sponsors: Cascade Design Automation, Chronologic, Cadence, and Metasoft, provided software and support that made this work possible.
    [Show full text]