By Topic

IEEE Transactions on Computers

Issue 4 • Date April 1987

Filter Results

Displaying Results 1 - 17 of 17
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1987, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (399 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1987, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (190 KB)
    Freely Available from IEEE
  • Introduction—Parallel and Distributed Computing

    Publication Year: 1987, Page(s):385 - 386
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    THE research domains of parallel and distributed computing have a significant overlap. With the advent of general-purpose multiprocessors, this overlap is bound to increase. This Special Issue attempts to draw together several papers from both of these separate research domains to illustrate commonalty and to encourage greater interaction among researchers in the two communities. View full abstract»

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

    Publication Year: 1987, Page(s): 387
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Distributing Hot-Spot Addressing in Large-Scale Multiprocessors

    Publication Year: 1987, Page(s):388 - 395
    Cited by:  Papers (86)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2841 KB)

    When a large number of processors try to access a common variable, referred to as hot-spot accesses in [6], not only can the resulting memory contention seriously degrade performance, but it can also cause tree saturation in the interconnection network which blocks both hot and regular requests alike. It is shown in [6] that even if only a small percentage of all requests are to a hot-spot, these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks

    Publication Year: 1987, Page(s):396 - 409
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4342 KB)

    Recent research on parallel systems has shown that the most difficult problem for system designers and users is interprocessor connection and communication. A methodology for the automated design and implementation of interprocessor communication for certain multiple-processor systems has been developed and is presented in this paper. For many application- specific and mission-oriented systems, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds

    Publication Year: 1987, Page(s):410 - 420
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3561 KB)

    The main aim of the paper is to study allocation of processors to, parallel programs executing on a multiprocessor system, and the resulting speedups. First, we consider a parallel program as a sequence of steps where each step consists of a set of parallel operations. General bounds on the speedup on a p- processor system are derived based on this model. Measurements of code parallelism for the, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems

    Publication Year: 1987, Page(s):421 - 432
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3269 KB)

    In this paper we analyze the effects of the problem decomposition, the allocation of subproblems to processors, and the grain size of subproblems on the performance of a multiple- processor shared-memory architecture. Our results indicate that for algorithms where both the computation and the communication overhead can be fully decomposed among N processors, the speedup is a nondecreasing function... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Mapping Strategy for Parallel Processing

    Publication Year: 1987, Page(s):433 - 442
    Cited by:  Papers (63)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4424 KB)

    This paper presents a mapping strategy for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph onto a system graph. One of them is especially suitable for real-time applications of parallel processing. These objective functions are different from the conventional objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending Multiversion Time-Stamping Protocols to Exploit Type Information

    Publication Year: 1987, Page(s):443 - 448
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2217 KB)

    Atomic transactions are a widely accepted approach to implementing and reasoning about fault-tolerant distributed programs. This paper shows how multiversion time-stamping protocols for atomicity can be extended to induce fewer delays and restarts by exploiting semantic information about objects such as queues, directories, or counters. This technique relies on static preanalysis of conflicts betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing Issues in the Distributed Execution of Ada Programs

    Publication Year: 1987, Page(s):449 - 459
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3894 KB)

    This paper examines, in the context of distributed execution, the meaning of Ada constructs involving time. In the process, unresolved questions of interpretation and problems with the implementation of a consistent notion of time across a network are uncovered. It is observed that there are two Ada mechanisms that can involve a distributed sense of time: the conditional entry call, and the timed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Graph Algorithms on a Fixed-Size Linear Array

    Publication Year: 1987, Page(s):460 - 470
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3698 KB)

    Parallel algorithms for computing the minimum spanning tree of a weighted undirected graph, and the bridges and articulation points of an undirected graphs on a fixed-size linear array of processors are presented. For a graph of n vertices, the algorithms operate on a linear array of p processors and require O(n2/p) time for all p, 1 ≤ p ≤ n. In particular, using n processors the algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging Parallel Programs with Instant Replay

    Publication Year: 1987, Page(s):471 - 482
    Cited by:  Papers (244)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3942 KB)

    The debugging cycle is the most common methodology for finding and correcting errors in sequential programs. Cyclic debugging is effective because sequential programs are usually deterministic. Debugging parallel programs is considerably more difficult because successive executions of the same program often do not produce the same results. In this paper we present a general solution for reproducin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Star Local Area Networks: A Performance Study

    Publication Year: 1987, Page(s):483 - 499
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3146 KB)

    In this paper we study local area networks based on the star topology. We consider different access protocols used for communication over star networks. The study is concerned with network performance. We present models for the analysis of existing star network protocols. We also propose a new access protocol for star networks. The protocol has a performance that is very close to perfect schedulin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control

    Publication Year: 1987, Page(s):500 - 516
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4055 KB)

    In a distributed system that implements real-time control, computational tasks are distributed over different nodes for execution to improve response time and system reliability. To model system behavior, tasks in each node are first decomposed into activities. The activities and precedence constraints among them are then modeled by a generalized stochastic Petri net (GSPN). Finally, a sequence of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1987, Page(s): 516
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1987, Page(s): 516
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE

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