By Topic

IEEE Transactions on Computers

Issue 8 • Date Aug. 1987

Filter Results

Displaying Results 1 - 19 of 19
  • [Front cover]

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

    Publication Year: 1987, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1987, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Introduction to the Special Issue on Real-Time Systems

    Publication Year: 1987, Page(s):901 - 902
    Cited by:  Papers (15)
    Request permission for commercial reuse | PDF file iconPDF (1070 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reviewers Special Issue on Real-Time Systems August 1987

    Publication Year: 1987, Page(s): 903
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • CHAOS-Kernel Support for Objects in the Real-Time Domain

    Publication Year: 1987, Page(s):904 - 916
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3896 KB)

    We describe our experiences with a real-time multiprocessor operating system, called GEM (Generalized Executive for Multiprocessor applications) and with an extension to GEM, called CHAOS (Concurrent Hierarchical Adaptable Object System). CHAOS offers kernel-level primitives that allow high-performance, large-scale, real-time software to be programmed as a system of interacting objects. This signi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RNet: A Hard Real-Time Distributed Programming System

    Publication Year: 1987, Page(s):917 - 932
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4096 KB)

    RNet is a high-level programming system for building and executing distributed hard real-time programs. The main objective in developing RNet is to investigate how high-level programming concepts and tools can be used to simplify the real-time programming task. A distributed real-time program in RNet consists of a configuration specification that outlines the structure and real-time properties of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clock Synchronization in Distributed Real-Time Systems

    Publication Year: 1987, Page(s):933 - 940
    Cited by:  Papers (258)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2220 KB)

    The generation of a fault-tolerant global time base with known accuracy of synchronization is one of the important operating system functions in a distributed real-time system. Depending on the types and number of tolerated faults, this paper presents upper bounds on the achievable synchronization accuracy for external and internal synchronization in a distributed real-time system. The concept of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding Time to Synchronous Process Communications

    Publication Year: 1987, Page(s):941 - 948
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2710 KB)

    In distributed real-time systems, communicating processes cannot be delayed for arbitrary amounts of time while waiting for messages. Thus, communication primitives used for real-time programming usually allow the inclusion of a deadline or timeout to limit potential delays due to synchronization. This paper interprets timed synchronous communication as having absolute deadlines. Various ways of i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preemptive Scheduling Under Time and Resource Constraints

    Publication Year: 1987, Page(s):949 - 960
    Cited by:  Papers (108)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3067 KB)

    We consider the problem of scheduling a set of n preemptable tasks in a system having r resources. Each task has an arbitrary, but known, worst case processing time and a deadline, and may request simultaneous use of a number of resources. A resource can be used either in shared mode or exclusive mode. In this paper, we develop and evaluate algorithms for determining whether or not a set of preemp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Graph-Theoretic Approach for Timing Analysis and its Implementation

    Publication Year: 1987, Page(s):961 - 975
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3225 KB)

    This paper presents a graph-theoretic algorithm for safety analysis of a class of timing properties in real-time systems which are expressible in a subset of real time logic (RTL) formulas. Our procedure is in three parts: the first part constructs a graph representing the system specification and the negation of the safety assertion. The second part detects positive cycles in the graph using a no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive Transaction Recovery in Distributed DB/DC Systems

    Publication Year: 1987, Page(s):976 - 987
    Cited by:  Papers (3)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2929 KB)

    The demand for on-line transaction processing has grown rapidly in recent years. To meet the transaction demand, several DB (database management) and DC (data communication management) subsystems can be coupled together to form a distributed DB/DC system. A key problem is to provide these distributed systems with effective means to recover transactions upon failure while paying little performance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instruction Level Timing Mechanisms for Accurate Real-Time Task Scheduling

    Publication Year: 1987, Page(s):988 - 993
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    The scheduling of timed tasks is generally based, at the hardware level, upon the use of time intervals. For example, most microprocessor families provide their only hardware support for timing control in the form of a programmable interval timer chip accessible as an I/O device over the system bus. In this paper we will argue that a more natural and elegant solution bases timing on a local (to a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Sharing in Soft Real-Time Distributed Computer Systems

    Publication Year: 1987, Page(s):993 - 1000
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1843 KB)

    in soft real-time distributed computer stems, a job submitted at a node in the network must complete execution within a specified time constraint, otherwise it is considered lost. When a single node occasionally experiences an overload of jobs, it may still be possible to execute some of the otherwise lost jobs by invoking a load sharingnode algorithm to distribute the local overload to other syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effects of Latent Faults on Highly Reliable Computer Systems

    Publication Year: 1987, Page(s):1000 - 1005
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1097 KB)

    Latent faults represent a potential obstacle in the synthesis of highly reliable digital computer systems. A simulation of an NMR redundant processor system was constructed using a gate level simulation package. The ability of each digital processor to react to randomly induced stuck-at faults is measured, and the amount of time it took the processor's control program to propagate faults to an out... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The One Leveraged Investment With a Guaranteed Return

    Publication Year: 1987, Page(s):nil2 - nil3
    Request permission for commercial reuse | PDF file iconPDF (299 KB)
    Freely Available from IEEE
  • Call for Papers

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

    Publication Year: 1987, Page(s): nil4
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 1987, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (201 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