By Topic

Computers, IEEE Transactions on

Issue 7 • Date Jul 1999

Filter Results

Displaying Results 1 - 12 of 12
  • Improving the availability of mutual exclusion systems on incomplete networks

    Publication Year: 1999 , Page(s): 744 - 747
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (128 KB)  

    We model a distributed system by a graph G=(V, E), where V represents the set of processes and E the set of bidirectional communication links between two processes. G may not be complete. A popular (distributed) mutual exclusion algorithm on G uses a coterie C(⊆2V), which is a nonempty set of nonempty subsets of V (called quorums) such that, for any two quorums P, Q∈C, 1) P&cu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the space requirement of interval routing

    Publication Year: 1999 , Page(s): 752 - 757
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (160 KB)  

    Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of vertex numbers (called interval labels). An M-label scheme allows up to M labels to be attached on an edge. For arbitrary graphs of size m, n the number of vertices, the problem is to determine the minimum RP necessary for achieving optimality in the length of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays

    Publication Year: 1999 , Page(s): 732 - 737
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB)  

    In this paper, we propose an enumeration method to check link conflicts in the mapping of n-dimensional uniform dependence algorithms with arbitrary convex index sets into k-dimensional processor arrays. Previous methods on checking the link conflicts had to examine either the whole index set or the I/O spaces whose size are O(N2n) or O(Nn-1), respectively, where N is the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of scan cells in BIST environment

    Publication Year: 1999 , Page(s): 724 - 731
    Cited by:  Papers (45)  |  Patents (36)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (300 KB)  

    The paper presents a new fault diagnosis technique for scan-based designs with BIST. It can be used for nonadaptive identification of the scan cells that are driven by erroneous signals. The proposed scheme employs a pseudorandom scan cell selection routine which, in conjunction with a conventional signature analysis and simple reasoning procedure, allows flexible trade-offs between the test appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A look-up scheme for scaling in the RNS

    Publication Year: 1999 , Page(s): 748 - 751
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (132 KB)  

    Previous scaling schemes have used iterative algorithms, which lead to computation time and memory requirements that increase with the number of moduli. This paper presents a two look-up cycle scaling scheme which allows a diminution of the required memory when nonlarge sets of moduli are considered. This scheme can be combined with previous algorithms for larger sets of moduli View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A systolic array implementation of the Feng-Rao algorithm

    Publication Year: 1999 , Page(s): 690 - 706
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (532 KB)  

    An efficient implementation of a parallel version of the Feng-Rao algorithm on a one-dimensional systolic array is presented in this paper by adopting an extended syndrome matrix. Syndromes of the same order, lying on a slant diagonal in the extended syndrome matrix, are scheduled to be examined by a series of cells simultaneously and, therefore, a high degree of concurrency of the Feng-Rao algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing optimal search trees in optimal time

    Publication Year: 1999 , Page(s): 738 - 743
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB)  

    (a, b)-trees are an important class of search trees. They include 2-3 trees, 2-3-4 trees, and B-trees as subclasses. We show that a space-minimum (a, b)-tree is also height-minimum and present an optimal algorithm for constructing (a, b)-trees that are height-minimum and space-minimum. Given n keys, our algorithm constructs an (a, b)-tree with minimum height and lowest possible nodes. Our algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

    Publication Year: 1999 , Page(s): 762 - 768
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB)  

    In this paper, we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. With complex chips that need to be designed in the future, it is expected that the runtimes of these scheduling algorithms will be quite large. The key contributions of this paper are as follows: First, we develop a novel extension of the sequential force-directed s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible and efficient routing based on progressive deadlock recovery

    Publication Year: 1999 , Page(s): 649 - 669
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (880 KB)  

    The development of fully adaptive, cut-through (wormhole) networks is important for achieving high performance in communication-critical parallel processor systems. Increased flexibility in routing allows network bandwidth to be used efficiently, but also creates more opportunity for cyclic resource dependencies to form which can cause deadlock. If not guarded against, deadlocks in routing make pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coverage estimation methods for stratified fault-injection

    Publication Year: 1999 , Page(s): 707 - 723
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (640 KB)  

    This paper addresses the problem of estimating fault tolerance coverage through statistical processing of observations collected in fault-injection experiments. In an earlier paper, venous estimators based on simple sampling in the complete fault/activity input space and stratified sampling in a partitioned space were studied; frequentist confidence limits were derived based on a normal approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Portable and efficient parallel computing using the BSP model

    Publication Year: 1999 , Page(s): 670 - 689
    Cited by:  Papers (7)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (492 KB)  

    The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically optimal execution of architecture independent software on a variety of architectures. Our goal in this work is to experimentally examine the practical use of the BSP model on current parallel architectu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of parallel computers arbitrary connectivity

    Publication Year: 1999 , Page(s): 757 - 761
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (132 KB)  

    Recently, D. Fussell and S. Rangarajan (1989) considered performing multiple tests to achieve correct diagnosis of constant degree connection structures. They showed that the probability of correctly identifying every processor approaches one as n→∞, where n is the number of processors in the system. In this paper, we give the performance analysis for the probabilistic diagnosis algorit... 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