Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 9 • Sept. 1982

Filter Results

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

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

    Publication Year: 1982, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • A Unified Approach to a Class of Data Movements on an Array Processor

    Publication Year: 1982, Page(s):809 - 819
    Cited by:  Papers (30)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2943 KB)

    The most effective use of mesh-connected array processors is achieved by paying careful attention to the organization of data. Storage and movement of the elements of multidimensional arrays of data within a multidimensional store for a particular problem is a difficult task, often handled in an ad hoc way. For an important class of problems, considerable conceptual simplification arises from cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Flow Computer Architecture with Program and Token Memories

    Publication Year: 1982, Page(s):820 - 824
    Cited by:  Papers (11)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2069 KB)

    This paper presents a new data flow computer architecture using two types of memory: program memory and token memory. The program memory (PM) stores a data flow program or graph indicating data dependencies among instructions. The PM need not be changed during execution of one program and is duplicated for each processing or functional unit. The token memory (TM) stores mainly currently needed dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hardware Hashing Scheme in the Design of a Multiterm String Comparator

    Publication Year: 1982, Page(s):825 - 834
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2996 KB)

    This paper discusses the hardware design of a term detection unit which may be used in the scanning of text emanating from a serial source such as disk or bubble memory. The main objective of this design is the implementation of a high performance unit which can detect any one of many terms (e.g., 1024 terms) while accepting source text at disk transfer rates. The unit incorporates "off-the-shelf"... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Query Processing for Distributed Database Systems

    Publication Year: 1982, Page(s):835 - 850
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4093 KB)

    A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost (processing cost and communication cost), which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the site selection and sequence of operations tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Expression Model for Extraction and Evaluation of Parallelism in Control Structures

    Publication Year: 1982, Page(s):851 - 863
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2988 KB)

    In the last few years advancements in VLSI technology have brought about practical research consideration of distributed computer system applications. A significant question is, "What potential improvements may be expected in an algorithm when its control structure is altered to maximize its internal parallelism?" This paper develops a general model for this area based on computation structures, d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fault-Tolerant Communication Architecture for Distributed Systems

    Publication Year: 1982, Page(s):863 - 870
    Cited by:  Papers (126)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3764 KB)

    A communication architecture for distributed processors is presented here. This architecture is based on a new topolgy we have developed, one which interconnects n nodes by using rn links where the maximum internode distance is logrn, and where each node has, at most, 2r, I/O ports. It is also shown that this network is fault-tolerant, being able to tolerate up to (r − 1) node failures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic Networks of Carry–Save Adders

    Publication Year: 1982, Page(s):870 - 882
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4406 KB)

    logic networks of carry–save adders such as high-speed multipliers, multioperand adders, and double-rail input parallel adders are designed based on the parallel adders with a minimum number of NOR gates discussed in [1]. After a discussion of the derivation of carry–save adder modules (CSAM's) by the integer programming logic design method, general design procedures are illustrated wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Development of a Measurement System for High Level Language Program Statistics

    Publication Year: 1982, Page(s):883 - 891
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2528 KB)

    The knowledge of static and dynamic program statistics is indispensable for the efficient implementation of high level languages on a computer system. Several researchers have developed ad hoc measurement systems to collect various program statistics for one particular problem and one high level language. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dictionary Machine (for VLSI)

    Publication Year: 1982, Page(s):892 - 897
    Cited by:  Papers (50)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2518 KB)

    We present the design of a dictionary machine that is suitable for VLSI implementation, and we discuss how to realize this implementation efficiently. The machine supports the operations of SEARCH, INSERT, DELETE, and EXTRACTMIN on an arbitrary ordered set. Each of these operations takes time O(log n), where n is the number of entries present when the operation is performed. Moreover, arbitrary se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Multiprocessor Scheduling with Memory Allocation–A Deterministic Approach"

    Publication Year: 1982, Page(s): 898
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB)

    In the above paper1 the author has investigated a problem of the preemptive scheduling of n independent tasks T = {T1, T2, ···, Tn} on m identical uniprogrammed CPU's P1, P2, ···, Pmwhen a common primary memory of N pages is available. Each task Tiis specified by the virtual time vi and the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's Reply2

    Publication Year: 1982, Page(s): 898
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB)

    V. A. Signaevskn is right that Theorem 4 holds only for concave p and that its proof may then be simplified (the thesis is not trivial). However, the practical meaning of this observation is rather not of very great importance. This follows from the fact that in practice the functions ei(si) are convex (in particular linear) or have a concave part for small si, and thus pi(si) are concave (see Cor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Algorithm for Shortest Paths

    Publication Year: 1982, Page(s):898 - 899
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB)

    Assuming that there is one processor at each vertex and all of these processors are synchronized, we can have a distributed algorithm for finding all the shortest paths in time O( d · p2) where d is the maximum of the degrees of vertices and p is the number of vertices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Algorithms for the 2-D Discrete Cosine Transform

    Publication Year: 1982, Page(s):899 - 906
    Cited by:  Papers (48)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1110 KB)

    Two types of efficient algorithms for fast implementation of the 2-D discrete cosine transform (2-D DCT) are developed. One involves recursive structure which implies that the algorithm for (M/2 X N/2) block be extended to (M X N/2) (M/2 X M) and (M X N) blocks (M and N are integer powers of two). The second algorithm is nonrecursive and therefore it has to be tailored for each block size. Both al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Embedding Rectangular Grids in Square Grids

    Publication Year: 1982, Page(s):907 - 913
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1270 KB)

    The main results in this paper demonstrate that there exist pairs of integers 〈E, D〉 (for "area Expansion" and "edge Dilation," respectively) such that any n-vertex rectangular grid can be embedded into a square grid having at most En vertices, in such a way that images in the square grid of vertices that are adjacent in the rectangular grid are at most distance D apart. Several techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis Using Stochastic Petri Nets

    Publication Year: 1982, Page(s):913 - 917
    Cited by:  Papers (469)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (985 KB)

    An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if k is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 7th Conference on Local Computer Networks

    Publication Year: 1982, Page(s): 917
    Request permission for commercial reuse | PDF file iconPDF (257 KB)
    Freely Available from IEEE
  • Call for Papers 1983 Trends and Applications Conference

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

    Publication Year: 1982, Page(s): 917
    Request permission for commercial reuse | PDF file iconPDF (191 KB)
    Freely Available from IEEE
  • Advance Announcement... Tutorial Week West 82

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