By Topic

IEEE Transactions on Computers

Issue 9 • Date Sep 1990

Filter Results

Displaying Results 1 - 8 of 8
  • Simple radix-4 division with operands scaling

    Publication Year: 1990, Page(s):1204 - 1208
    Cited by:  Papers (45)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A radix-4 division algorithm with operands scaling is proposed. The algorithm uses a recurrence with redundant addition (carry-save or signed-digit) and combines simple scaling with a quotient-selection function that depends only on the estimate of the partial remainder and is independent of the divisor. The scheme results in a significant speedup with respect to both the radix-2 and radix-4 witho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A window protocol for transmission of time-constrained messages

    Publication Year: 1990, Page(s):1186 - 1203
    Cited by:  Papers (68)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1324 KB)

    The authors propose and study a window protocol suitable for transmitting time-constrained messages in a multiaccess network. The protocol differs from traditional window protocols in that it explicitly takes time constraints into account. The window is formed on the basis of the latest time to send a message (LS). A major advantage of the window protocol is that a newly arriving message is immedi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority inheritance protocols: an approach to real-time synchronization

    Publication Year: 1990, Page(s):1175 - 1185
    Cited by:  Papers (847)  |  Patents (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocki... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling periodic jobs that allow imprecise results

    Publication Year: 1990, Page(s):1156 - 1174
    Cited by:  Papers (142)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing of large node B-trees

    Publication Year: 1990, Page(s):1208 - 1212
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    The performance improvement afforded by parallel processing of large-node B-trees is investigated. A node partitioning scheme to enhance concurrency for B-trees is presented. In the method, the tree height is reduced by increasing the node size. However, it is shown that increasing node size alone in conventional B-trees on parallel disks may not improve the response time, and may even degrade the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance analysis of timed synchronous communication primitives

    Publication Year: 1990, Page(s):1117 - 1131
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    The performance of two algorithms for timed synchronous communication between a single sender and a single receiver is analyzed. Each weakens the definition of correct timed synchronous communication in a different way, and exhibits a different undesirable behavior. Their sensitivity to various parameters is discussed. These parameters include how long the processes are willing to wait for communi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm-based fault tolerance on a hypercube multiprocessor

    Publication Year: 1990, Page(s):1132 - 1145
    Cited by:  Papers (75)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1284 KB)

    The design of fault-tolerant hypercube multiprocessor architecture is discussed. The authors propose the detection and location of faulty processors concurrently with the actual execution of parallel applications on the hypercube using a novel scheme of algorithm-based error detection. System-level error detection mechanisms have been implemented for three parallel applications on a 16-processor I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subcube allocation and task migration in hypercube multiprocessors

    Publication Year: 1990, Page(s):1146 - 1155
    Cited by:  Papers (25)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    Two important issues in managing processors in a hypercube are addressed: subcube allocation and task migration to eliminate the system fragmentation caused by allocation and deallocation of subcubes. It is proven that the subcube allocation strategy using a binary reflected Gray code (BRGC), called the GC strategy, possesses the best subcube recognition ability among all strategies using sequenti... 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