Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 5 • May 1991

Filter Results

Displaying Results 1 - 12 of 12
  • Time-space optimal parallel merging and sorting

    Publication Year: 1991, Page(s):596 - 602
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The authors present a parallel merging algorithm that, on an exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM) with k processors merges two sorted lists of total length n in O(n/k+log n) time and constant extra space per processor, and hence is time-space optimal for any value of k⩽n/(log n View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Micro time cost analysis of parallel computations

    Publication Year: 1991, Page(s):613 - 628
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    The authors investigate the modeling and analysis of time cost behavior of parallel computations. It is assumed parallel computations reside in a computer system in which there is a limited number of processors, all the processors have the same speed, and they communicate with each other through a shared memory. It has been found that the time costs of parallel computations depend on the input, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the average number of products in the minimum sum-of-products expressions for multiple-value input two-valued output functions

    Publication Year: 1991, Page(s):645 - 651
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The authors derive an upper and a lower bound on the average number of products in the minimum sum-of-products expressions (SOPEs). The upper bound is obtained by using the minimization results of functions with fewer variables. The lower bound is based on an assumption, so it is incorrect until this assumption is proven. A lower bound Lp(n,u) and an upper bou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential diagnosability is co-NP complete

    Publication Year: 1991, Page(s):584 - 595
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    F.P. Preparata et al. (1967) introduced a graph-theoretical model for fault diagnosis called the PMC model. The question of determining the sequential diagnosability number of a system in the PMC model has remained open. The authors formalize the notion of sequential diagnosability. The question of determining the sequential diagnosability number of a system is addressed by showing that the approp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-time parallelization and scheduling of loops

    Publication Year: 1991, Page(s):603 - 612
    Cited by:  Papers (69)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    The authors study run-time methods to automatically parallelize and schedule iterations of a do loop in certain cases where compile-time information is inadequate. The methods presented involve execution time preprocessing of the loop. At compile-time, these methods set up the framework for performing a loop dependency analysis. At run-time, wavefronts of concurrently executable loop iterations ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The tree-match chip

    Publication Year: 1991, Page(s):629 - 639
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A chip organization is proposed for the classical tree-pattern-matching problem. It is based on an algorithm which uses a combination of a content-addressed memory, shift registers, and one-bit-wide stacks. All tree pattern matches are found simultaneously in one scan of the subject stream. The chip could be operated as a coprocessor to speed up functional language processing implementations. Mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient replicated remote file comparison

    Publication Year: 1991, Page(s):651 - 660
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The author improves on some previous work involving data transfer to find the location of disagreements between two or more large remote data files. Some procedures that permit a significant reduction in the number of back-and-forth interchanges are described, one of which significantly reduces the total amount of data transfer required. The older scheme could locate a disagreeing page with an ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared block contention in a cache coherence protocol

    Publication Year: 1991, Page(s):640 - 644
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Simulation is used to analyze shared block contention in eight parallel algorithms and its effects on the performance of a cache coherence protocol under the assumption of infinite cache sizes. A simple program model for data and block sharing is introduced, and an analytical closed-form solution is found for all components of the cache coherence overhead. This model is based on the observation th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on t-EC/d-UED codes

    Publication Year: 1991, Page(s):660 - 663
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Recently D.J. Lin and B. Bose, (1988) proposed a class of t error correcting and d unidirectional error detecting codes (t-EC/d-UED codes) where d>t. The authors refine the codes in such a way that the error detecting capability of the resulting codes is considerably better than the existing codes in many cases. The decoding algorithm is de... View full abstract»

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

    Publication Year: 1991, Page(s):573 - 583
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    Timed atomic commitment is defined, protocols to implement it in a realistic operating environment are devised, and its usefulness is shown through an example. In a large class of hard-real-time control applications, components execute concurrently on distributed nodes and must coordinate, under timing constraints, to perform the control task. As such, they perform a type of atomic commitment. Tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vote assignments in weighted voting mechanisms

    Publication Year: 1991, Page(s):664 - 667
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    It is shown that voting can provide the maximum reliability if all nodes have reliability p⩾0.5. Thus, a system designer only needs to consider vote assignments in implementing mutual exclusion mechanisms. Some effective vote assignment algorithms are proposed. Neglecting link failures, it is found that the voting weight for each node can be determined by computing a logarithmic funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on `Generalized hypercube and hyperbus structures for a computer network' by L.N. Bhuyan and D.P. Agrawal

    Publication Year: 1991, Page(s):667 - 668
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    The commenters point out that conjectures in the above-named paper (ibid., vol.C-33, no.4, p.323-333) concerning the structure of a least-cost generalized hypercube can be proved 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