IEEE Transactions on Computers

Issue 12 • Dec. 2007

Filter Results

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

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • Study of the Effects of SEU-Induced Faults on a Pipeline Protected Microprocessor

    Publication Year: 2007, Page(s):1585 - 1596
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3195 KB) | HTML iconHTML

    This paper presents a detailed analysis of the behavior of a novel fault-tolerant 32-bit embedded CPU as compared to a default (non-fault-tolerant) implementation of the same processor during a fault injection campaign of single and double faults. The fault-tolerant processor tested is characterized by per-cycle voting of microarchitectural and the flop-based architectural states, redundancy at th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Bound Selection Cache Replacement Policy for Wireless Data Access

    Publication Year: 2007, Page(s):1597 - 1611
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3006 KB) | HTML iconHTML

    Cache can be used for mobile devices to reduce the usage of limited bandwidth in wireless networks. Ideally, frequently accessed and infrequently updated data items should be cached and infrequently accessed and frequently updated data items should be evicted or not cached at all. Most of the existing cache replacement policies adopt only access information so that frequently updated data items ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Fault Identification of Diagnosable Systems under the Comparison Model

    Publication Year: 2007, Page(s):1612 - 1618
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    Diagnosis by comparison is a realistic approach to the fault diagnosis of massive multicomputers. This paper addresses the fault identification of diagnosable multicomputer systems under the MM* comparison model. We find that the fault location task can be reduced to that under the classical PMC* model. On this basis, we present an O(n times Delta3 times delta) time diagnosis algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Weighted Scan Enable Signals to Improve Test Effectiveness of Scan-Based BIST

    Publication Year: 2007, Page(s):1619 - 1628
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3525 KB) | HTML iconHTML

    The conventional test-per-scan built-in self-test (BIST) scheme needs a number of shift cycles followed by one capture cycle. Fault effects received by the scan flip-flops are shifted out while shifting in the next test vector, like scan testing. Unlike deterministic testing, it is unnecessary to apply a complete test vector to the scan chains. A new scan-based BIST scheme is proposed by properly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orchestration of Network-Wide Active Measurements for Supporting Distributed Computing Applications

    Publication Year: 2007, Page(s):1629 - 1642
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2492 KB) | HTML iconHTML

    Recent computing applications such as videoconferencing and grid computing run their tasks on distributed computing resources connected through networks. For such applications, knowledge of the network status such as delay, jitter, and available bandwidth can help them select proper network resources to meet the Quality-of-Service (QoS) requirements. Also, the applications can dynamically change t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Links for Distributed Quantum Computation

    Publication Year: 2007, Page(s):1643 - 1653
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB) | HTML iconHTML

    Distributed quantum computation requires quantum operations that act over a distance on error correction-encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction (QEC) codes and find that teleportation failure rates of one percent or more are tolerable when two levels of the [[23, 1, 7]] code are used. We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Implementation of an Out-of-Band Virtualization System for Large SANs

    Publication Year: 2007, Page(s):1654 - 1665
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3493 KB) | HTML iconHTML

    Out-of-band virtualization intrinsically has the potential to provide high performance and good scalability. Unfortunately, existing out-of-band virtualization systems have some limitations, such as restrictions to specific platforms and/or hardware. In this paper, we present a new out-of-band virtualization system, MagicStore, which is not limited to any specific hardware and supports three widel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Management of Hardware and Software Tasks for FPGA-based Embedded Systems

    Publication Year: 2007, Page(s):1666 - 1680
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1950 KB) | HTML iconHTML

    Operating systems for reconfigurable devices enable the development of embedded systems where software tasks, running on a CPU, can coexist with hardware tasks running on a reconfigurable hardware device (FPGA). In this work, we consider real-time systems subject to dynamic workloads and whose tasks can be computationally intensive. We introduce a novel resource allocation scheme and an online adm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation Algorithms for Sensor Deployment

    Publication Year: 2007, Page(s):1681 - 1695
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5743 KB) | HTML iconHTML

    We develop an integer linear programming formulation to find the minimum cost deployment of sensors that provides the desired coverage of a target point set and propose a greedy heuristic for this problem. Our formulation permits heterogeneous multimodal sensors and is extended easily to account for nonuniform sensor detection resulting from blockages, noise, fading, and so on. A greedy algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Digit-by-Digit Algorithm for mth Root Extraction

    Publication Year: 2007, Page(s):1696 - 1706
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (609 KB) | HTML iconHTML

    A general digit-recurrence algorithm for the computation of the mth root (with an m integer) is presented in this paper. Based on the concept of completing the mth root, a detailed analysis of the convergence conditions is performed and iteration- independent digit-selection rules are obtained for any radix and redundant digit set. A radix-2 version for mth rooting is also studied, together with c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A PROBE-Based Heuristic for Graph Partitioning

    Publication Year: 2007, Page(s):1707 - 1720
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5961 KB) | HTML iconHTML

    A new heuristic algorithm, PROBE_BA, which is based on the recently introduced metaheuristic paradigm population- reinforced optimization-based exploration (PROBE), is proposed for solving the Graph Partitioning Problem. The "exploration" part of PROBE_BA is implemented by using the differential-greedy algorithm of Battiti and Bertossi and a modification of the Kernighan-Lin algorithm at the heart... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Errors and Erasures in Parity Sharing RS Codecs

    Publication Year: 2007, Page(s):1721 - 1726
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1413 KB) | HTML iconHTML

    Reed Solomon (RS) codes are widely used to protect information from errors in transmission and storage systems. Most of the RS codes are based on GF(28) Galois Fields and use a byte to encode a symbol providing codewords up to 255 symbols. Codewords with more than 255 symbols can be obtained by using GF(2m) Galois fields with m > 8, but this choice increases the complexity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society

    Publication Year: 2007, Page(s): 1727
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • IEEE Computer Society Digital Library [advertisement]

    Publication Year: 2007, Page(s): 1728
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • TC Information for authors

    Publication Year: 2007, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • [Back cover]

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