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

IEEE Transactions on Computers

Issue 4 • April 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • A New Hierarchical Data Cache Architecture for iSCSI Storage Server

    Publication Year: 2009, Page(s):433 - 447
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3020 KB) | HTML iconHTML

    With the emergence of data-intensive applications, recent years have seen a fast-growing volume of I/O traffic propagated through the local I/O interconnect bus. This raises up a question for storage servers on how to resolve such a potential bottleneck. In this paper, we present a hierarchical data cache architecture called DCA to effectively slash local interconnect traffic and thus boost the st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Papers 
  • DIA: A Complexity-Effective Decoding Architecture

    Publication Year: 2009, Page(s):448 - 462
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2942 KB) | HTML iconHTML

    Fast instruction decoding is a true challenge for the design of CISC microprocessors implementing variable-length instructions. A well-known solution to overcome this problem is caching decoded instructions in a hardware buffer. Fetching already decoded instructions avoids the need for decoding them again, improving processor performance. However, introducing such special--purpose storage in the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Multidimensional Packet Classification with Fast Updates

    Publication Year: 2009, Page(s):463 - 479
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6760 KB) | HTML iconHTML

    Packet classification has continued to be an important research topic for high-speed routers in recent years. In this paper, we propose a new packet classification scheme based on the binary range and prefix searches. The basic data structure of the proposed packet classification scheme for multidimensional rule tables is a hierarchical list of sorted ranges and prefixes that allows the binary sea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Elastic Scheduling for Real-Time Tasks

    Publication Year: 2009, Page(s):480 - 495
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (783 KB) | HTML iconHTML

    The elastic task model is a powerful model for adapting periodic real-time systems in the presence of uncertainty. This work generalizes the existing elastic scheduling approach in several directions. First, it presents a general framework, which formulates a trade-off between task schedulability and a specific performance metric as an optimization problem. Such a framework allows real-time system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replacing Associative Load Queues: A Timing-Centric Approach

    Publication Year: 2009, Page(s):496 - 511
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2377 KB) | HTML iconHTML

    One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution. Traditional age-ordered associative load queues are complex, inefficient, and power hungry. In this paper, we introduce two new dependence checking schemes with different design tradeoffs, but both explicit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Recursive Paradigm to Solve Boolean Relations

    Publication Year: 2009, Page(s):512 - 527
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3931 KB) | HTML iconHTML

    A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

    Publication Year: 2009, Page(s):528 - 540
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1334 KB) | HTML iconHTML

    A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k sources and k sinks in which each vertex of G is covered by a path. It is called a paired many-to-many disjoint path cover when each source should be joined to a specific sink, and it is called an unpaired many-to-many disjoint path cover when each source can be joined to an arbitrary sink. In this pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shortest Path Tree Computation in Dynamic Graphs

    Publication Year: 2009, Page(s):541 - 557
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4653 KB) | HTML iconHTML Multimedia Media

    Let G = (V, E, omega) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G' be obtained from G by an application of a set of edge weight updates to G. Let sisinV and let Ts and Ts' be Shortest Path Trees (SPTs) rooted at s in G and G', respectively. The Dynamic Shortest Path (DSP) problem is to compute Ts' from Ts. Existing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Supporting High-Quality 3D Geometry Multicasting over IEEE 802.11 Wireless Networks

    Publication Year: 2009, Page(s):558 - 571
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2593 KB) | HTML iconHTML

    With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless networks on mobile devices such as PDAs and laptops. In this paper, we consider a typical scenario where users holding mobile devices of different display resolutions and rendering capabilities request the same 3D object i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Brief Contributions 
  • Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem

    Publication Year: 2009, Page(s):572 - 576
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB) | HTML iconHTML

    Let n and lscr be positive integers and f(x) be an irreducible polynomial over IF2 such that lscrdeg(f(x)) < 2n -1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)lscr. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over IF2. We g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TC Information for authors

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

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