[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Stojmenović, 1997 - Google Patents

Multiplicative circulant networks topological properties and communication algorithms

Stojmenović, 1997

View PDF
Document ID
3969657006870063390
Author
Stojmenović I
Publication year
Publication venue
Discrete Applied Mathematics

External Links

Snippet

In this paper we study an interconnection network topology based on the radix representation of integers and modulo arithmetic. The multiplicative circulant graph MC (r, k) consists of n= rk vertices. Two vertices x and y are connected by an edge if and only if¦ x− y¦ …
Continue reading at www.sciencedirect.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations 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/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17356—Indirect interconnection networks
    • G06F15/17368—Indirect interconnection networks non hierarchical topologies
    • G06F15/17381—Two dimensional, e.g. mesh, torus
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations 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/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
    • G06F15/17343—Direct connection machines, e.g. completely connected computers, point to point communication networks wherein the interconnection is dynamically configurable, e.g. having loosely coupled nearest neighbor architecture
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8007—Architectures 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods 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/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation

Similar Documents

Publication Publication Date Title
Stojmenović Multiplicative circulant networks topological properties and communication algorithms
JP2512661B2 (en) Non-binary hypercube type computer system and network connection method for multiple nodes
Ohring et al. Folded petersen cube networks: New competitors for the hypercubes
Yeh et al. On a class of rearrangeable networks
Efe et al. Products of networks with logarithmic diameter and fixed degree
Das et al. Embeddings into Hyper Petersen Networks: Yet Another Hypercube‐Like Interconnection Topology
Lo et al. Mapping divide-and-conquer algorithms to parallel architectures
Fu Hamiltonicity of the WK-recursive network with and without faulty nodes
Chen et al. Hypercomplete: A pancyclic recursive topology for large‐scale distributed multicomputer systems
Cheng et al. Varietal hypercube-a new interconnection network topology for large scale multicomputer
Bruck et al. Embedding cube-connected cycles graphs into faulty hypercubes
Johnsson et al. Optimal communication channel utilization for matrix transposition and related permutations on binary cubes
Li et al. Fault-tolerant cycle embedding in dual-cube with node faults
Tien et al. Broadcasting on incomplete hypercubes
Ganesan et al. The hyper-deBruijn multiprocessor networks
Banerjee et al. Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks
Latifi et al. SEP: A fixed degree regular network for massively parallel systems
Das et al. Star-coloring of graphs for conflict-free access to parallel memory systems
Chan et al. A parallel algorithm for an efficient mapping of grids in hypercubes
Lin Simulation of Cycles in the IEH Graph
Stojmenovic Topological properties of interconnection networks
Song et al. An optimal multicast algorithm for cube-connected cycles
Rajasekaran et al. Sorting and routing on the array with reconfigurable optical buses
Jain et al. An analysis of cube-connected cycles and circular shuffle networks for parallel computation
JaJa et al. Optimal algorithms on the pipelined hypercube and related networks