IEEE Transactions on Computers

Issue 6 • June 2007

Filter Results

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

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

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • Editor's Note

    Publication Year: 2007, Page(s):721 - 726
    Request permission for commercial reuse | PDF file iconPDF (1188 KB) | HTML iconHTML
    Freely Available from IEEE
  • A Radix-10 Digit-Recurrence Division Unit: Algorithm and Architecture

    Publication Year: 2007, Page(s):727 - 739
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5054 KB) | HTML iconHTML

    In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm. The previous decimal division designs do not include recent developments in the theory and practice of this type of algorithm, which were developed for radix-2k dividers. In addition to the adaptation of these features, the radix-10 quotient digit is decomposed into a radix-2 digit and a r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware Support for Accelerating Data Movement in Server Platform

    Publication Year: 2007, Page(s):740 - 753
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2890 KB) | HTML iconHTML

    Data movement (memory copies) is a very common operation during network processing and application execution on servers. The performance of this operation is rather poor on today's microprocessors due to the following aspects: 1) Several long-latency memory accesses are involved because the source and/or the destination are typically in memory, 2) latency hiding techniques, such as out-of-order ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing

    Publication Year: 2007, Page(s):754 - 768
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3083 KB) | HTML iconHTML

    Indexing provides for selective tuning but suffers from the drawback that, in order to conserve battery power, the client has to wait for and tune to the index segment. In location-aware mobile services (LAMSs), it is important to reduce the query response time since a late query response may contain out-of-date information. In this paper, we present a broadcast-based spatial query processing sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Segment Trees for Ranges and Prefixes

    Publication Year: 2007, Page(s):769 - 784
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3595 KB) | HTML iconHTML

    In this paper, we develop a segment tree data structure for solving dynamic table lookup problems. The proposed dynamic segment tree (DST) uses all of the distinct end points of ranges as the keys based on a new range end point scheme. The new end point scheme generates fewer end points than the traditional end point scheme. DST is implemented as a balanced binary search tree augmented with a rang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent Error Detection Methods for Asynchronous Burst-Mode Machines

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

    Asynchronous controllers exhibit various characteristics that limit the effectiveness and applicability of the concurrent error detection (CED) methods developed for their synchronous counterparts. Asynchronous burst-mode machines (ABMMs), for example, do not have a global clock to synchronize the ABMM with the additional circuitry that is typically used by synchronous CED methods (for example, du... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Two-Disk Failure-Tolerant Disk Arrays

    Publication Year: 2007, Page(s):799 - 814
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3630 KB) | HTML iconHTML

    RAID5 disk arrays use the rebuild process to reconstruct the contents of a failed disk on a spare disk, but this process is unsuccessful if latent sector failures are encountered or a second disk failure occurs. The high cost of data loss has led to two-disk failure-tolerant (2DFT) arrays: RAID6, EVENODD, row-diagonal parity (RDP), and RM2. RAID6 uses Reed-Solomon (RS) codes, whereas the latter th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience

    Publication Year: 2007, Page(s):815 - 825
    Cited by:  Papers (45)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3837 KB) | HTML iconHTML

    Over the past decade, the grid has emerged as an attractive platform to tackle various large-scale problems, especially in science and engineering. One primary issue associated with the efficient and effective utilization of heterogeneous resources in a grid is scheduling. Grid scheduling involves a number of challenging issues, mainly due to the dynamic nature of the grid. There are only a handfu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical Function Generators Using LUT Cascades

    Publication Year: 2007, Page(s):826 - 838
    Cited by:  Papers (35)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3544 KB) | HTML iconHTML

    This paper proposes an architecture and a synthesis method for high-speed computation of fixed-point numerical functions such as trigonometric, logarithmic, sigmoidal, square root, and combinations of these functions. Our architecture is based on the lookup table (LUT) cascade, which results in a significant reduction in circuit complexity compared to traditional approaches. This is suitable for a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization

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

    In this work, we address the problem of scheduling loops with dependences in the context of speculative parallelization. We show that the scheduling alternatives are highly influenced by the dependence violation pattern the code presents. We center our analysis in those algorithms where dependences are less likely to appear as the execution proceeds. Particularly, we focus on randomized incrementa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern

    Publication Year: 2007, Page(s):853 - 858
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB) | HTML iconHTML

    Communication-induced checkpointing protocols are mechanisms used to produce checkpoints and communication patterns which enjoy desirable properties, such as No-Z-Cycle (NZC). NZC guarantees that each checkpoint can be part of a global consistent checkpoint. It would be nice to define communication-induced checkpointing protocols that enforce NZC, adding a minimum number of checkpoints to remove a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiconstrained QoS Routing: A Norm Approach

    Publication Year: 2007, Page(s):859 - 863
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    A fundamental problem in quality-of-service (QoS) routing is the multiconstrained path (MCP) problem, where one seeks a source-destination path satisfying K > 2 additive QoS constraints in a network with K additive QoS parameters. The MCP problem is known to be NP-complete. One popular approach is to use the shortest path with respect to a single edge weighting function as an approximate soluti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In this issue - Technically

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

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

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