[go: up one dir, main page]

Tel, 1994 - Google Patents

Network orientation

Tel, 1994

View PDF
Document ID
8756057718860708985
Author
Tel G
Publication year
Publication venue
International Journal of Foundations of Computer Science

External Links

Snippet

This paper analyses how the symmetry of a processor network influences the existence of a solution for the network orientation problem. The orientation of hypercubes and tori is the problem of assigning labels to each link of each processor, in such a way that a sense of …
Continue reading at dspace.library.uu.nl (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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/42—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker

Similar Documents

Publication Publication Date Title
Collin et al. Self-stabilizing depth-first search
Tel Network orientation
Peleg Time-optimal leader election in general networks
Bauer et al. Distributed algorithms for multicast path setup in data networks
Patt-Shamir et al. The round complexity of distributed sorting
Chin et al. An almost linear time and O (nlogn+ e) messages distributed algorithm for minimum-weight spanning trees
Jain et al. IBDDs: An efficient functional representation for digital circuits
Irani et al. A Closed-Form Solution for the Perfornance Analysis of Multiple-Bus Multiprocessor Systems
Ramarao et al. On finding and updating shortest paths distributively
Itai et al. Symmetry breaking in distributed networks
Chattopadhyay et al. Dynamic and self-stabilizing distributed matching
Di Luna et al. Computing in anonymous dynamic networks is linear
Augustine et al. Byzantine connectivity testing in the congested clique
Shin et al. On the number of acceptable task assignments in distributed computing systems
Buchsbaum et al. On finding common neighborhoods in massive graphs
Fischer et al. The wakeup problem
Bagchi et al. Parallel information dissemination by packets
Kazmierczak et al. An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing
Kanchi et al. An optimal distributed algorithm for all-pairs shortest-path
Rotem et al. Shout echo selection in distributed files
Feldmann et al. Optimal algorithms for dissemination of information in generalized communication modes
Manohar et al. Asynchronous signalling processes
Blin et al. The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs
Tel Network orientation
Mata‐Montero Resilience of partial k‐tree networks with edge and node failures