IEEE Transactions on Computers

Issue 12 • Dec. 2000

Filter Results

Displaying Results 1 - 9 of 9
  • OBDD minimization based on two-level representation of Boolean functions

    Publication Year: 2000, Page(s):1371 - 1379
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 KB)

    In this paper, we analyze the basic properties of some Boolean function classes and propose a low complexity OBDD variable ordering algorithm, which is exact (optimum) to some classes of functions and very effective to general two-level form functions. We show that the class of series-parallel functions, which can be expressed by a factored form where each variable appears exactly once, can yield ... View full abstract»

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

    Publication Year: 2000, Page(s):1380 - 1384
    Request permission for commercial reuse | |PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2000, Page(s):1384 - 1392
    Request permission for commercial reuse | |PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device

    Publication Year: 2000, Page(s):1310 - 1324
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    We present a hardware-algorithm for sorting N elements using either a p-sorter or a sorting network of fixed I/O size p while strictly enforcing conflict-free memory accesses. To the best of our knowledge, this is the first realistic design that achieves optimal time performance, running in Θ(NlogN/plogp) time for all ranges of N. Our result completely resolves the problem of designing an im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A serial-parallel architecture for two-dimensional discrete cosine and inverse discrete cosine transforms

    Publication Year: 2000, Page(s):1297 - 1309
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1304 KB)

    The Discrete Cosine and Inverse Discrete Cosine Transforms are widely used tools in many digital signal and image processing applications. The complexity of these algorithms often requires dedicated hardware support to satisfy the performance requirements of hard real-time applications. This paper presents the architecture of an efficient implementation of a two-dimensional DCT/IDCT transform proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for computer performance evaluation using benchmark sets

    Publication Year: 2000, Page(s):1325 - 1338
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1632 KB)

    Benchmarking is a widely used approach to measure computer performance. Current use of benchmarks only provides running times to describe the performance of a tested system. Glancing through these execution times provides little or no information about system strengths and weaknesses. A novel benchmarking methodology is proposed to identify key performance parameters; the methodology is based on m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optical bus-based distributed dynamic barrier mechanism

    Publication Year: 2000, Page(s):1354 - 1365
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (344 KB)

    Barrier synchronization is a useful parallel programming construct for ensuring that all processors are at a particular location in the code before any processor is allowed to continue. Barrier synchronization is integral to programming models such as the Bulk Synchronous Parallel model. Specialized hardware is often used to improve the performance of a barrier synchronization operation. With cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neighbourhood information dissemination in the star graph

    Publication Year: 2000, Page(s):1366 - 1370
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (176 KB)

    This paper studies two neighborhood information dissemination problems in the star graph (n-star): The neighborhood broadcast problem (NBP) is the problem of disseminating a message from the source vertex to all the vertices adjacent to the source vertex and the neighborhood gossiping problem (NGP) is the problem of exchanging messages among all neighboring vertices in the given graph. We propose ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task allocation on a network of processors

    Publication Year: 2000, Page(s):1339 - 1353
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1688 KB)

    This paper studies the scheduling of tasks on a pool of identical workstations in a network where message passing is used for data transfer and communication between processors and where the precedence relations among tasks form a send-receive graph. Bur parallel computation model differs from previous models by including all of the following practical considerations: 1) the sending and receiving ... 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