By Topic

IEEE Transactions on Computers

Issue 8 • Aug 1997

Filter Results

Displaying Results 1 - 11 of 11
  • A modification to a decomposition algorithm of Gordon and Srikanthan

    Publication Year: 1997, Page(s):958 - 960
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Recently, J. Gordon and S. Srikanthan (1990) gave a new approach to route a rearrangeable three-stage Clos network. However, their algorithm was suspected to be incomplete by Y.K. Chiu and W.C. Siu (1991), and by H.Y. Lee and J.D. Carpinelli (1994). We show that a modification of their algorithm assures a correct routing View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance rotation architectures based on the radix-4 CORDIC algorithm

    Publication Year: 1997, Page(s):855 - 870
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Traditionally, CORDIC algorithms have employed radix-2 in the first n/2 microrotations (n is the precision in bits) in order to preserve a constant scale factor. The authors present a full radix-4 CORDIC algorithm in rotation mode and circular coordinates and its corresponding selection function, and propose an efficient technique for the compensation of the nonconstant scale factor. Three radix-4... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On embedding between 2D meshes of the same size

    Publication Year: 1997, Page(s):880 - 889
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Mesh is one of the most commonly used interconnection networks and, therefore, embedding between different meshes becomes a basic embedding problem. Not only does an efficient embedding between meshes allow one mesh-connected computing system to efficiently simulate another, but it also provides a useful tool for solving other embedding problems. The authors study how to embed an s1&tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal placements of flexible objects. II. A simulated annealing approach for the bounded case

    Publication Year: 1997, Page(s):905 - 929
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    For pt.I see ibid., p.890-904. The paper is a continuation of the first part, where the authors considered regular arrangements of flexible objects for the unbounded case. The present part deals with a simulated annealing algorithm maximizing the number of flexible objects in equilibrium placements within rigid boundaries. The forces caused by the boundary are taken into account, i.e., the bounded... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of checkpoint latency on overhead ratio of a checkpointing scheme

    Publication Year: 1997, Page(s):942 - 947
    Cited by:  Papers (83)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Checkpointing reduces loss of computation in the presence of failures. Two metrics characterize a checkpointing scheme: checkpoint overhead and checkpoint latency. The paper shows that a large increase in latency is acceptable if it is accompanied by a relatively small reduction in overhead. Also, for equidistant checkpoints, optimal checkpoint interval is shown to be typically independent of chec... View full abstract»

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

    Publication Year: 1997, Page(s):953 - 958
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Division algorithms and implementations

    Publication Year: 1997, Page(s):833 - 854
    Cited by:  Papers (127)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Many algorithms have been developed for implementing division in hardware. These algorithms differ in many aspects, including quotient convergence rate, fundamental hardware primitives, and mathematical formulations. The paper presents a taxonomy of division algorithms which classifies the algorithms based upon their hardware implementations and impact on system design. Division algorithms can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subcube determination in faulty hypercubes

    Publication Year: 1997, Page(s):871 - 879
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A hypercube may operate in a gracefully degraded manner, after faults arise, by supporting the execution of parallel algorithms in smaller fault-free subcubes. In order to reduce execution slowdown in a hypercube with given faults, it is essential to identify the maximum healthy subcubes in the faulty hypercube because the time for executing a parallel algorithm tends to depend on the dimension of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal placements of flexible objects. I. Analytical results for the unbounded case

    Publication Year: 1997, Page(s):890 - 904
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    The authors consider optimal placements of two-dimensional flexible (elastic, deformable) objects. The objects are discs of equal size placed within a rigid boundary. The paper is divided into two parts. In the first part, analytical results for three types of regular, periodic arrangements-the hexagonal, square, and triangular placements-are presented. The regular arrangements are analyzed for re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The smallest pair of noncrossing paths in a rectilinear polygon

    Publication Year: 1997, Page(s):930 - 941
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Smallest rectilinear paths are rectilinear paths with simultaneous minimum numbers of bends and minimum lengths. Given two pairs of terminals within a rectilinear polygon, the authors derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear path between two ter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dilated-diagonal-based scheme for broadcast in a wormhole-routed 2D torus

    Publication Year: 1997, Page(s):947 - 952
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we consider this problem in a wormhole-routed 2D torus network which provides the dimension-ordered routing and all-port communication capability. With the distance-insensitive characteristic of wormhole routing, we model the broadcast as a sequence of communication phases. We propose a novel scheme t... 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