By Topic

IEEE Transactions on Computers

Issue 7 • Jul 1995

Filter Results

Displaying Results 1 - 15 of 15
  • Improved digital signature suitable for batch verification

    Publication Year: 1995, Page(s):957 - 959
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    In this paper, an improved digital signature is developed based on the famous Schnorr (1990) or Brickell-McCurley (1991) schemes. It is shown that both the new scheme and the previous two originals rely on the same security assumptions. The novel feature of this proposed signature is that it can be verified in a batch manner and the improved efficiency is approximately proportional to the number o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low overhead multiprocessor allocation strategies exploiting system spare capacity for fault detection and location

    Publication Year: 1995, Page(s):865 - 877
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Several schemes for detecting faults at the processor level in a multiprocessor system have been discussed in the past. One such scheme (A. Dahbura et al., 1989) works by running secondary versions of jobs on the unused or spare processors of the system and uses the comparison approach (J. Maeng and M. Malek, 1981) to detect faults. We build upon this scheme and propose three new multiprocessor al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A combinatorial analysis of subcube reliability in hypercubes

    Publication Year: 1995, Page(s):952 - 956
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    In this brief contribution, we derive an exact expression for (n-1)-cube reliability in an n-cube using a new probability fault model and an existing random fault model. Approximate results are also obtained for m-cube reliability for values of m smaller than n-1. We show that the proposed probability model for computing subcube reliability is equally accurate, but computationally more efficient t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant wormhole routing algorithms for mesh networks

    Publication Year: 1995, Page(s):848 - 864
    Cited by:  Papers (184)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    We present simple methods to enhance the current minimal wormhole routing algorithms developed for high radix, low dimensional mesh networks for fault tolerant routing. We consider arbitrarily located faulty blocks and assume only local knowledge of faults. Messages are routed minimally when not blocked by faults and this constraint is relaxed to route around faults. The key concept we use is a fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error analysis of CORDIC-based Jacobi algorithms

    Publication Year: 1995, Page(s):947 - 951
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The Jacobi algorithm for eigenvalue calculation of symmetric matrices can be performed with a CORDIC algorithm as its basic module. Recently, a simplified Jacobi algorithm, by employing approximate rotations based on CORDIC rotations, was proposed. It fully exploits the binary data structure and reduces the overall computational cost significantly. In this paper an error analysis of the approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected processor array

    Publication Year: 1995, Page(s):930 - 932
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    The Berlekamp-Massey algorithm (BMA) (E. Berlekamp, 1968; J. Massey, 1969) is important in the decoding of Reed-Solomon (RS), and more generally, Bose-Chaudhuri-Hocquenghem (BCH) block error control codes. For a t-error correcting code the BMA has time complexity O(t2) when implemented on a sequential computer. However, the BMA does not run efficiently on a parallel computer. The BMA ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of the slotted ring multiprocessor

    Publication Year: 1995, Page(s):878 - 890
    Cited by:  Papers (15)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    As microprocessor speeds continue to improve at a very fast rate the bandwidth requirements for system level interconnections in multiprocessors may eventually rule out the use of shared buses even for small scale multiprocessors. On the other hand high speed unidirectional links are an emerging technology that has the potential to scale with microprocessor technology and could replace buses as th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Certification of computational results

    Publication Year: 1995, Page(s):833 - 847
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    We describe a conceptually novel and powerful technique to achieve fault detection and fault tolerance in hardware and software systems. When used for software fault detection, this new technique uses time and software redundancy and can be outlined as follows. In the initial phase, a program is run to solve a problem and store the result. In addition, this program leaves behind a trail of data wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance and cost analysis of applying superscalar method to mainframe computers

    Publication Year: 1995, Page(s):891 - 902
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The paper presents the results of evaluating the increased performance and cost of mainframe computers with superscalar architectures. Since mainframe users demand object compatibility, we assume the same object as that of nonsuperscalar machines. We compared four differently configured superscalar machines based on Hitachi's high end mainframe computer, the HITAC M-880, varying the multiplicity o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and robust network bisection algorithm

    Publication Year: 1995, Page(s):903 - 913
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Partitioning is a fundamental problem in diverse fields of study such as pattern recognition, parallel processing, and the design of VLSI circuits. Recently, node clustering or compaction has been shown to enhance the performance of iterative partitioning algorithms by several authors. However, clustering has been mainly used as a preprocessing step before partitioning in existing methods. The pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal parallel hypercube algorithms for polygon problems

    Publication Year: 1995, Page(s):914 - 922
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(log n) time, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-vertex simple polygon P for monotonicity, and other related p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding binary trees into crossed cubes

    Publication Year: 1995, Page(s):923 - 929
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The recently introduced interconnection network, crossed cube, has attracted much attention in the parallel processing area due to its many attractive features. Like the ordinary hypercube, the n-dimensional crossed cube is a regular graph with 2n vertices and n2n-1 edges. The diameter of the crossed cube is approximately half that of the ordinary hypercube. These advantages ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Choices of operand truncation in the SRT division algorithm

    Publication Year: 1995, Page(s):933 - 938
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The paper presents an analysis of the number of partial remainder digits and divisor bits that must be examined in the SRT division algorithm. The number of examined digits is found to be the same for both signed digit and 2s complement partial remainder representations, and appears to increase as 3log2r approximately, where r is the radix of the divider. In some cases, it proves advant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture for a low complexity rate-adaptive Reed-Solomon encoder

    Publication Year: 1995, Page(s):938 - 942
    Cited by:  Papers (33)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Multiple error-correcting Reed-Solomon (RS) codes have many practical applications. The complexity of an RS encoder depends on multiplications in the finite field over which the code is defined. We consider a triangular basis for representing the field elements, and present an architecture for a rate-adaptive RS encoder using a triangular basis multiplication algorithm. The architecture supports p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel minimal norm method for tridiagonal linear systems

    Publication Year: 1995, Page(s):942 - 946
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Based on the parallel minimal norm method an algorithm is derived to solve tridiagonal linear systems with a high degree of parallelism. No conditions need to be posed with respect to the system. Experiments indicate that the numerical stability of the algorithm is similar to Gaussian elimination with partial pivoting 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