IEEE Transactions on Computers

Issue 1 • Jan 2004

Filter Results

Displaying Results 1 - 14 of 14
  • Array regrouping and its use in compiling data-intensive, embedded applications

    Publication Year: 2004, Page(s):1 - 19
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2181 KB) | HTML iconHTML

    One of the key challenges facing computer architects and compiler writers is the increasing discrepancy between processor cycle times and main memory access times. To alleviate this problem in array-intensive embedded signal and video processing applications, compilers may employ either control-centric transformations that change data access patterns of nested loops or data-centric transformations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of cache performance of multimedia applications

    Publication Year: 2004, Page(s):20 - 38
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7566 KB) | HTML iconHTML

    Multimedia applications are fast becoming one of the dominating workloads for modern computer systems. Since these applications normally have large data sets and seem to have little data-reuse, a commonly held belief is that they have poor memory behavior compared to traditional programs and that current cache architectures cannot handle them well. It is therefore important to quantitatively chara... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs

    Publication Year: 2004, Page(s):39 - 53
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2377 KB) | HTML iconHTML

    The arrangement graph An,k is a generalization of the star graph. There are some results concerning fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graph. However, these results are restricted in some particular cases and, thus, are less completed. We improve these results and obtain a stronger and simpler statement. Let n-k≥2 and F⊆V(An,k)&c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing system failure frequencies and reliability importance measures using OBDD

    Publication Year: 2004, Page(s):54 - 68
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2235 KB) | HTML iconHTML

    The recent literature showed that, in many cases, ordered binary decision diagram (OBDD)-based algorithms are more efficient in reliability evaluation compared to other methods such as the inclusion-exclusion (I-E) method and the sum of disjoint products (SDP) method. We present algorithms based on OBDD to compute system failure frequencies and reliability importance measures. Methods are presente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Area-time efficient sign detection technique for binary signed-digit number system

    Publication Year: 2004, Page(s):69 - 72
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (797 KB) | HTML iconHTML

    Computer arithmetic operations based on the BSD (binary signed-digit) number representation system lend themselves well to high-speed computations due to the facilitation of limited carry addition/subtraction. We propose an area-time efficient method for sign detection in a BSD number system based on optimized reverse tree structure. When compared to other popular approaches, such as the most sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal replacement is NP-hard for nonstandard caches

    Publication Year: 2004, Page(s):73 - 76
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    When examining a new cache structure or replacement policy, the optimal policy is a useful baseline. We prove that finding the optimal schedule is NP-hard for any but the simplest of caches, and that no polynomial-time approximation scheme exists for this problem unless P=NP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Disk scheduling on multimedia storage servers

    Publication Year: 2004, Page(s):77 - 82
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1677 KB) | HTML iconHTML

    A disk scheduler called MS-EDF is proposed not only to meet the deadlines of all requests, but also to offer the optimal seek time. Through the experiments, the results show our disk scheduling algorithm outperforms the others for multimedia systems in all cases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Masking of unknown output values during output response compression by using comparison units

    Publication Year: 2004, Page(s):83 - 89
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    A circuit may produce unknown output values during simulation of a test set, e.g., due to an unknown initial state or due to the existence of tristate elements. Unknown output values in the output response of a circuit make it impossible to determine a single unique signature for the fault-free circuit when built-in self-test is used for testing the circuit. We consider the problem of synthesizing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing the number of sequential diagnosis iterations in hypercubes

    Publication Year: 2004, Page(s):89 - 92
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (434 KB) | HTML iconHTML

    We use a vertex-isoperimetric inequality to show that the number of test and repair iterations needed to perform sequential diagnosis of d-dimensional hypercubes is upper bounded by d-r, where rεΘ(d). This result improves the best bound of d test and repair iterations previously known. Numerical evaluation has shown that the actual value of r ranges from 0.16d to 0.31d. View full abstract»

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

    Publication Year: 2004, Page(s):93 - 96
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 2004, Page(s): 01
    Request permission for commercial reuse | PDF file iconPDF (257 KB)
    Freely Available from IEEE
  • IEEE Transactions on Computers

    Publication Year: 2004, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (234 KB)
    Freely Available from IEEE
  • Information for authors

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

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