[go: up one dir, main page]

El-Amawy, 2002 - Google Patents

Clocking arbitrarily large computing structures under constant skew bound

El-Amawy, 2002

Document ID
11710171515473871164
Author
El-Amawy A
Publication year
Publication venue
IEEE Transactions on Parallel and Distributed systems

External Links

Snippet

A scheme for global synchronization of arbitrarily large computing structures such that clock skew between any two communicating cells is bounded above by a constant is described. The scheme utilizes clock nodes that perform simple processing on clock signals to maintain …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17356Indirect interconnection networks
    • G06F15/17368Indirect interconnection networks non hierarchical topologies
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored programme computers
    • G06F15/80Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8007Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors single instruction multiple data [SIMD] multiprocessors
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored programme computers
    • G06F15/78Architectures of general purpose stored programme computers comprising a single central processing unit
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50Computer-aided design
    • G06F17/5009Computer-aided design using simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G06F11/16Error detection or correction of the data by redundancy in hardware
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/50Adding; Subtracting
    • G06F7/505Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F1/00Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
    • G06F1/04Generating or distributing clock signals or signals derived directly therefrom
    • G06F1/10Distribution of clock signals, e.g. skew
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00Indexing scheme relating to computer aided design [CAD]
    • G06F2217/70Fault tolerant, i.e. transient fault suppression
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/48Routing tree calculation

Similar Documents

Publication Publication Date Title
Lubachevsky Efficient distributed event-driven simulations of multiple-loop networks
Kung et al. Synchronous versus asynchronous computation in very large scale integrated (VLSI) array processors
EP0200780A1 (en) PACKET SWITCHED MULTIPLE QUEUE NxM SWITCH NODE AND PROCESSING METHOD.
Sheng et al. Towards Low-Latency Communication on FPGA Clusters with 3D FFT Case Study
Lotker et al. Distributed MST for constant diameter graphs
US20070156380A1 (en) Logic event simulation
Dazzi et al. Efficient pipelined execution of CNNs based on in-memory computing and graph homomorphism verification
Bolding Chaotic routing: design and implementation of an adaptive multicomputer network router
Rajasekaran et al. Constant queue routing on a mesh
US5163068A (en) Arbitrarily large clock networks with constant skew bound
El-Amawy Clocking arbitrarily large computing structures under constant skew bound
Cappello et al. Toward high communication performance through compiled communications on a circuit switched interconnection network
Picornell et al. Enforcing predictability of many-cores with DCFNoC
Puente et al. Immucube: Scalable fault-tolerant routing for k-ary n-cube networks
Fischer et al. The wakeup problem
Shahane et al. Design of fault tolerant algorithm for network on chip router using field programmable gate array
Indrusiak et al. Applying UML interactions and actor-oriented simulation to the design space exploration of network-on-chip interconnects
Brugge et al. A Parameterizable NoC Router for FPGAs.
Kasapaki et al. The Argo NoC: combining TDM and GALS
Zotov Distributed virtual bit-slice synchronizer: A scalable hardware barrier mechanism for n-dimensional meshes
Nagle et al. Algorithms for multiple-criterion design of microprogrammed control hardware
Theiss Modularity, routing and fault tolerance in interconnection networks
Rezazadeh et al. An enhanced fault-tolerant routing algorithm for mesh network-on-chip
Bryant Report on the Workshop on Self-timed Systems
Hanyu et al. Accurate and high-speed asynchronous network-on-chip simulation using physical wire-delay information