By Topic

IEEE Transactions on Computers

Issue 2 • Date Feb 1996

Filter Results

Displaying Results 1 - 13 of 13
  • Edge-disjoint spanning trees on the star network with applications to fault tolerance

    Publication Year: 1996, Page(s):174 - 185
    Cited by:  Papers (44)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1284 KB)

    Data communication and fault tolerance are important issues in parallel computers in which the processors are interconnected according to a specific topology. One way to achieve fault tolerant interprocessor communication is by exploiting the disjoint paths that exist between pairs of source and destination nodes. We construct n-1 directed edge disjoint spanning trees on the star network. These sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCC linear congruential graphs: a new class of interconnection networks

    Publication Year: 1996, Page(s):156 - 164
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    Let n be an integer and F={f1:1⩽i⩽t for some integer t} be a finite set of linear functions. We define a linear congruential graph G(F, n) as a graph on the vertex set V={0, 1, ..., n-1}, in which any x∈V is adjacent to fi(x) mod n, 1⩽i⩽t. For a linear function g, and a subset V1 of V we define a linear congruential graph G(F, n, g,V... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic synthesis of self-recovering VLSI systems

    Publication Year: 1996, Page(s):131 - 142
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    We describe an integrated system for synthesizing self-recovering microarchitectures called 𝒮𝒴𝒩𝒞ℰℛℰ in the 𝒮𝒴𝒩𝒞ℰℛℰ model for self-recovery, transient faults are detected using duplication and comparison, while recovery from transient faults is accomplished via checkpointing and rollback. 𝒮𝒴𝒩𝒞ℰℛ&Escr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing strategies for fast networks

    Publication Year: 1996, Page(s):165 - 173
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    Modern fast packet switching networks are being forced to rethink the routing schemes that are used in more traditional networks. The reexamination is necessitated because in these fast networks switches on the message's route can afford to make only minimal and simple operations. For example, examining a table of a size proportional to the network size is out of the question. We examine routing s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant routing strategy in hypercube multicomputers

    Publication Year: 1996, Page(s):143 - 155
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1452 KB)

    We investigate fault-tolerant routing which aims at finding feasible minimum paths in a faulty hypercube. The concept of unsafe node and its extension are used in our scheme. A set of stringent criteria is proposed to identify the possibly bad candidates for forwarding a message. As a result, the number of such undesirable nodes is reduced without sacrificing the functionality of the mechanism. Fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transposition networks as a class of fault-tolerant robust networks

    Publication Year: 1996, Page(s):230 - 238
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. The networks under study belong to a subclass of Cayley graphs whose generators are subsets of all possible transpositions. We specifically focus on star and bubble sort networks. Our approach is to augment existing dimensions (or generators) with one or more dimensions. If the added dimension is capa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding star networks into hypercubes

    Publication Year: 1996, Page(s):186 - 194
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes. Our embeddings exhibit a marked trade off between dilation and expansion. For the n dimensional star network we exhibit: (1) a dilation N-1 e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new error analysis based method for tolerance computation for algorithm-based checks

    Publication Year: 1996, Page(s):238 - 243
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Algorithm based techniques are based on checking for the preservation of certain properties possessed by global data following a set of computations. This often involves the introduction of a check variable which is updated in such a manner that, in the absence of roundoff errors, it equals the value of some function which involves all the data elements participating in the algorithm. However, rou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph partitioning using learning automata

    Publication Year: 1996, Page(s):195 - 208
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1524 KB)

    Given a graph G, we intend to partition its nodes into two sets of equal size so as to minimize the sum of the cost of the edges having end points in different sets. This problem, called the uniform graph partitioning problem, is known to be NP complete. We propose the first reported learning automaton based solution to the problem. We compare this new solution to various reported schemes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on SEC/AUED codes

    Publication Year: 1996, Page(s):244 - 246
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A common method of constructing single error correcting/all unidirectional error detecting (SEG/AUED) codes is to choose a SEC code and then to append a tail such that the new code can detect all unidirectional errors. The tail is a function of the weight of the codeword. We present a technique to reduce the weight distribution of the SEC code so that the tail needed is smaller. We also present a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence properties of optimization algorithms for the SAT problem

    Publication Year: 1996, Page(s):209 - 219
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    The satisfiability (SAT) problem is a basic problem in computing theory. Presently, an active area of research on SAT problem is to design efficient algorithms to find a solution for a satisfiable conjunctive normal form (CNF) formula. A new formulation, the universal SAT problem model, which transforms the SAT problem on Boolean space into an optimization problem on real space has been developed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification using edge-valued binary decision diagrams

    Publication Year: 1996, Page(s):247 - 255
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    We present a new data structure called edge-valued binary-decision diagrams (EVBDD). An EVBDD is a directed acyclic graph, that provides a canonical and compact representation of functions that involve both Boolean and integer quantities. In general, EVBDDs provide a more versatile and powerful representation than ordinary binary decision diagrams. We first describe the structure and properties of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiphase complete exchange: a theoretical analysis

    Publication Year: 1996, Page(s):220 - 229
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Complete exchange requires each of N processors to send a unique message to each of the remaining N-1 processors. For a circuit switched hypercube with N=2d processors, the direct and standard algorithms for complete exchange are time optimal for very large and very small message sizes, respectively. For intermediate sizes, a hybrid multiphase algorithm is better. This carries out direc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org