By Topic

IEEE Transactions on Computers

Issue 5 • Date May 2005

Filter Results

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

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Universal text preprocessing for data compression

    Publication Year: 2005, Page(s):497 - 507
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB) | HTML iconHTML

    Several preprocessing algorithms for text files are presented which complement each other and which are performed prior to the compression scheme. The algorithms need no external dictionary and are language independent. The compression gain is compared along with the costs of speed for the BWT, PPM, and LZ compression schemes. The average overall compression gain is in the range of 3 to 5 percent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic task-level voltage scheduling optimizations

    Publication Year: 2005, Page(s):508 - 520
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    Energy versus delay trade-offs are explored for systems that must manage energy expenditure as well as computation deadlines. The focus is execution of a single process on a single processor. Two probabilistic process models are considered, along with a family of power dissipation models. The first process model assumes that process complexity is exactly c cycles with probability p(c). The second ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup

    Publication Year: 2005, Page(s):521 - 533
    Cited by:  Papers (51)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    Ternary content addressable memories (TCAMs) have been emerging as a popular device in designing routers for packet forwarding and classifications. Despite their premise on high-throughput, large TCAM arrays are prohibitive due to their excessive power consumption and lack of scalable design schemes. We present a TCAM-based router architecture that is energy and storage efficient. We introduce pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The KR-Benes network: a control-optimal rearrangeable permutation network

    Publication Year: 2005, Page(s):534 - 544
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (831 KB) | HTML iconHTML Multimedia Media

    The Benes network has been used as a rearrangeable network for over 40 years, yet the uniform N(2 log N-1) control complexity of the N/spl times/N Benes is not optimal for many permutations. In this paper, we present a novel O(log N) depth rearrangeable network, called KR-Benes, that is permutation-specific control-optimal The KR-Benes routes every permutation with the minimal control complexity s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prefix and interval-partitioned dynamic IP router-tables

    Publication Year: 2005, Page(s):545 - 557
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB) | HTML iconHTML

    Two schemes - prefix partitioning and interval partitioning - are proposed to improve the performance of dynamic IP router-table designs. While prefix partitioning applies to all known dynamic router-table designs, interval partitioning applies to the alternative collection of binary search tree designs of Sahni and Kim [S. Sahni et al., (2004)]. Experiments using public-domain IPv4 router databas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal skewed data allocation on multiple channels with flat broadcast per channel

    Publication Year: 2005, Page(s):558 - 572
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB) | HTML iconHTML

    Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel. Cyclically broadcasting data over the channel is a basic scheduling technique, which is known as flat scheduling. When multiple channels are available, a data allocation technique is needed to assign data to channels. Partitioning data among channels in an unbalanced w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating conflict misses using prime number-based cache indexing

    Publication Year: 2005, Page(s):573 - 586
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB) | HTML iconHTML

    Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the cache. Although various alternative hashing functions have been demonstrated to eliminate the worst-case conflict behavior, no study has really analyzed the pathological behavior of such hashing functions that often results... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power-aware storage cache management

    Publication Year: 2005, Page(s):587 - 602
    Cited by:  Papers (53)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB) | HTML iconHTML

    Reducing energy consumption is an important issue for data centers. Among the various components of a data center, storage is one of the biggest energy consumers. Previous studies have shown that the average idle period for a server disk in a data center is very small compared to the time taken to spin down and spin up. This significantly limits the effectiveness of disk power management schemes. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic reconfiguration in computer clusters with irregular topologies in the presence of multiple node and link failures

    Publication Year: 2005, Page(s):603 - 615
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (801 KB) | HTML iconHTML Multimedia Media

    Component failures in high-speed computer networks can result in significant topological changes. In such cases, a network reconfiguration algorithm must be executed to restore the connectivity between the network nodes. Most contemporary networks use either static reconfiguration algorithms or stop the user traffic in order to prevent cyclic dependencies in the routing tables. The goal is to pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant distributed channel allocation scheme for cellular networks

    Publication Year: 2005, Page(s):616 - 629
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. If channels are statically allocated, as is the case in current cellular networks, a cell may run out of channels when a large number of mobile hosts move to the cell. To overcome this problem, dynamic channel allocation approaches have been propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving memory encryption performance in secure processors

    Publication Year: 2005, Page(s):630 - 640
    Cited by:  Papers (25)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    Due to the widespread software piracy and virus attacks, significant efforts have been made to improve security for computer systems. For stand-alone computers, a key observation is that, other than the processor, any component is vulnerable to security attacks. Recently, an execution only memory (XOM) architecture has been proposed to support copy and tamper resistant software. In this design, th... 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: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005, Page(s): c4
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (157 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