Computer

Issue 10 • Oct. 1988

Filter Results

Displaying Results 1 - 4 of 4
  • Misconceptions about real-time computing: a serious problem for next-generation systems

    Publication Year: 1988, Page(s):10 - 19
    Cited by:  Papers (364)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    The author defines real-time computing and states and dispels the most common misconceptions about it. He discusses the fundamental technical issues of real-time computing. He examines specification and verification, scheduling theory, operating systems, programming languages and design methodology, distributed databases, artificial intelligence, fault tolerance, architectures, and communication.<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amdahl multiple-domain architecture

    Publication Year: 1988, Page(s):20 - 28
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A description is given of extensions to the architecture of Amdahl's first mainframe computers, which were hard-wired implementations of the IBM System/370 architecture, and the why's and how's of their development are examined. The latest architecture helps maintain compatibility with a changing standard. Its multiple-domain facility allows multiple operating systems to share one mainframe system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-driven VLSI array for arbitrary algorithms

    Publication Year: 1988, Page(s):30 - 43
    Cited by:  Papers (36)  |  Patents (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1327 KB)

    The design of specialized processing array architectures, capable of executing any given arbitrary algorithm, is proposed. An approach is adopted in which the algorithm is first represented in the form of a dataflow graph and then mapped onto the specialized processor array. The processors in this array execute the operations included in the corresponding nodes (or subsets of nodes) of the dataflo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hashing for dynamic and static internal tables

    Publication Year: 1988, Page(s):45 - 56
    Cited by:  Papers (15)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1155 KB)

    The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow. They also discuss recent developments in perfect hashing and minimal perfect hashing, which provide speed and memory compactness when the keys are known in ad... View full abstract»

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

Aims & Scope

Computer, the flagship publication of the IEEE Computer Society, publishes peer-reviewed articles written for and by computer researchers and practitioners representing the full spectrum of computing and information technology, from hardware to software and from emerging research to new applications. 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Sumi Helal
Lancaster University
sumi.helal@computer.org