IEEE Transactions on Computers

Issue 5 • May 1989

Filter Results

Displaying Results 1 - 18 of 18
  • Comments, with reply, on "can redundancy and masking improve the performance of synchronizers?" by L. Kleeman and A. Cantoni

    Publication Year: 1989, Page(s):750 - 753
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB)

    It is claimed in the above-mentioned work (ibid., vol.C-35, p.643-6, July 1986) that redundancy and masking techniques are ineffective in improving synchronizer performance due to metastable behavior. This claim is based on an input model that is not always valid, particularly in reliability analysis. The commenter points out the weakness in the assumed model and provides an alternative input mode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On computing the combinatorial power of SW-banyan networks

    Publication Year: 1989, Page(s):761 - 765
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The problem of calculating the combinatorial power of certain SW-banyan networks is related to a problem of enumerating certain matrices. Examples of two- and three-stage networks are used to demonstrate the technique. In each case, a polynomial-time algorithm is found to solve the problem. The results are presented for each case and certain asymptotic behavior is noted View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair edge deletion problems

    Publication Year: 1989, Page(s):756 - 761
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The notation of fair edge-deletion problems is introduced. These arise when it is desirable to control the number of edges incident to any node that are either deleted or remain following edge deletion. Six such problems were formulated for the case where the resultant graph is known to be acyclic, and the complexity of four of these is easily determined from known results. The remaining two are t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Petri nets and their application to modeling and analysis of a handshake daisy chain arbiter

    Publication Year: 1989, Page(s):696 - 704
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    A class of Petri nets called temporal Petri nets is introduced, in which timing constraints are represented by the operators of temporal logic. Due to the versatility of the temporal logic operations to express temporal assertions, temporal Petri nets can describe clearly and compactly causal and temporal relationships between the events of a system, including eventuality and fairness. The use of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Avoiding latch formation in regular expression recognizers

    Publication Year: 1989, Page(s):754 - 756
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Specialized silicon compilers, or module generators, are promising tools for automating the design of custom VLSI chips. In particular, generators for regular language recognizers have many applications. A problem called latch formation that causes regular expression recognizers to be more complex than they would first appear is identified. if recognizers are constructed in the most straightforwar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local correction of helix(k) lists

    Publication Year: 1989, Page(s):718 - 724
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    A helix (k) list is a robust multiply linked list having k pointers in each node. In general, the ith pointer in each node addresses the ith previous node. However, the first pointer in each node addresses the next node, rather than the previous. An algorithm for performing local correction in a helix (k ⩾3) list is presented. Given the assumption t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerance of double-loop computer networks to multinode failures

    Publication Year: 1989, Page(s):738 - 741
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The reliability of double-loop networks is examined along with their fault tolerance in cases when more than two nodes break down. It is demonstrated that double-loop structured networks are very desirable with respect to the measure of fault tolerance introduced View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-synchronizing communication protocols

    Publication Year: 1989, Page(s):609 - 625
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    An approach called self-synchronizing communication protocols (SSPs) is presented for handling synchronization problems in communication protocols. It is found that many synchronization errors are caused by process collision, which arises when two or more processes simultaneously transmit conflicting messages. A synchronization mechanism that allows processes to detect and resolve collisions durin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated approach to distributed demand assignment in multiple-bus local networks

    Publication Year: 1989, Page(s):679 - 695
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    Multiple-bus local networks (MBLNs) provide an architecturally simple solution to serve high-reliability high-capacity local area networks applications. Access mechanisms for MBLNs possessing stability and favorable delay characteristics are developed. A technique is proposed that uses a single explicit token to achieve demand-assignment multiple access (DAMA) to arbitrate access on all buses in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristically-aided algorithm for mutual exclusion in distributed systems

    Publication Year: 1989, Page(s):651 - 662
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB)

    A heuristically-aided algorithm to achieve mutual exclusion in distributed systems is presented which has better performance characteristics than previously proposed algorithms. The algorithm makes use of state information, which is defined as the set of states of mutual exclusion processes in the system. Each site maintains information about the state of other sites and uses it to deduce a subset... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on nondeterminism in small, fast parallel computers

    Publication Year: 1989, Page(s):766 - 767
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    Nondeterministic analogues of the well-known language classes NC and SC called NNC and NSC, respectively, are investigated. NC is the class of languages that can be accepted by small, fast parallel computers; SC is the class of languages that can be recognized by a deterministic Turing machine in polynomial time and polylog tape-head reversals. Adding nondeterminism to SC leaves it in the domain o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A microeconomic approach to optimal resource allocation in distributed computer systems

    Publication Year: 1989, Page(s):705 - 717
    Cited by:  Papers (106)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    Decentralized algorithms are examined for optimally distributing a divisible resource in a distributed computer system. To study this problem in a specific context, the problem of optimal file allocation is considered. In this case, the optimization criteria include both the communication cost and average processing delay associated with a file access. The algorithms examined have their origins in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance-measurement tools in a multiprocessor environment

    Publication Year: 1989, Page(s):725 - 737
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    A family of monitoring facilities is proposed which are used in combination, e.g. a breakpoint monitor used for debugging purposes, a mailbox monitor for analysis of synchronization traffic, and a bus monitor for measurements of bus load. These tools are used in multi-monitor mode, for which both a common programming-language interface and a user interface are provided. Design concepts are present... View full abstract»

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

    Publication Year: 1989, Page(s):741 - 745
    Cited by:  Papers (61)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    A fast serial and parallel algorithm for thinning digital patterns is presented. The processing speed is faster than previous algorithms in that it reads pixels along the edge of the input pattern rather than all pixels in each iteration. Using this algorithm, an experiment is conducted and the patterns such as `X', `H', `A', `moving body', and `leaf' are tested. The results show that this algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed execution of recovery blocks: an approach for uniform treatment of hardware and software faults in real-time applications

    Publication Year: 1989, Page(s):626 - 636
    Cited by:  Papers (112)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    The concept of distributed execution of recovery blocks is examined as an approach for uniform treatment of hardware and software faults. A useful characteristic of the approach is the relatively small time cost it requires. The approach is thus suitable for incorporation into real-time computer systems. A specific formulation of the approach that is aimed at minimizing the recovery time is presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-time disambiguation: coping with statically unpredictable dependencies

    Publication Year: 1989, Page(s):663 - 678
    Cited by:  Papers (33)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    A technique called run-time disambiguation (RTD) is presented for antialiasing of indirect memory references that cannot normally be disambiguated at compile time. The technique relies on assumptions about the run-time behavior of a program to allow static transformations of the code, in an effort to extract parallelism. The importance of the technique lies in its ability to supplement (and even p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonian cycles in the shuffle-exchange network

    Publication Year: 1989, Page(s):745 - 750
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The usefulness of the shuffle-exchange network in parallel processing applications is well established. The optimal embedding of a shuffle-exchange network of a given size depends on the number of cycles of the shuffle permutation of that size. The cost of one method of adding fault-tolerance through reconfigurability depends upon the number of such cycles, and the manner in which they can be conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random pattern testing versus deterministic testing of RAMs

    Publication Year: 1989, Page(s):637 - 650
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    The number of (random) patterns required for random testing of RAMs (random-access memories), when classical fault models including pattern-sensitive faults are considered is determined. Markov chains are a powerful tool for this purpose. Single faults are considered first, and the influence of different parameters is analyzed. Double faults are then considered and arguments are presented to exten... 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