IEEE Transactions on Computers

Issue 4 • April 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 (151 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Antisequential suffix sorting for BWT-based data compression

    Publication Year: 2005, Page(s):385 - 397
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    Suffix sorting requires ordering all suffixes of all symbols in an input sequence and has applications in running queries on large texts and in universal lossless data compression based on the Burrows Wheeler transform (BWT). We propose a new suffix lists data structure that leads to three fast, antisequential, and memory-efficient algorithms for suffix sorting. For a length-N input over a size-|X... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal lexicographic shaping of aggregate streaming data

    Publication Year: 2005, Page(s):398 - 408
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    We investigate the problem of smoothing multiplexed network traffic when either a streaming server transmits data to multiple clients or a storage server accesses data from multiple storage devices or other servers. We introduce efficient algorithms for lexicographically optimally smoothing the aggregate bandwidth requirements over a shared network link. Possible applications include improvement i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical adaptive dynamic power management

    Publication Year: 2005, Page(s):409 - 420
    Cited by:  Papers (41)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB) | HTML iconHTML

    Dynamic power management aims at extending battery life by switching devices to lower-power modes when there is a reduced demand for service. Static power management strategies can lead to poor performance or unnecessary power consumption when there are wide variations in the rate of requests for service. This paper presents a hierarchical scheme for adaptive dynamic power management (DPM) under n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree parity machine rekeying architectures

    Publication Year: 2005, Page(s):421 - 427
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    The necessity of securing the communication between hardware components in embedded systems becomes increasingly important with regard to the secrecy of data and particularly its commercial use. We suggest a low-cost (i.e., small logic-area) solution for flexible security levels and short key lifetimes. The basis is an approach for symmetric key exchange using the synchronization of tree parity ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guidelines for scheduling some common computation-dags for Internet-based computing

    Publication Year: 2005, Page(s):428 - 438
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    A "pebble game" is developed to model the process of scheduling computation-dags for Internet-based computing (IC, for short). Strategies are derived for scheduling three common, significant families of such dags for IC: reduction-meshes, which represent (the intertask dependencies of) computations that can be performed by "up-sweeps" of meshes; reduction-trees, which represent "accumulative" comp... 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 SAN system based on the fiber channel protocol

    Publication Year: 2005, Page(s):439 - 448
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB) | HTML iconHTML

    With the increasing demand for vast storage repositories, network storage has become important for mass data storage and processing, telescopic addressing and availability, and the quality of service and security of data storage. This situation demands the emergence of new technology in the data storage field. In this paper, TH-MSNS, a SAN system, is introduced. This system was designed and implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of dual-rail circuits for security applications

    Publication Year: 2005, Page(s):449 - 460
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1272 KB) | HTML iconHTML

    Dual-rail encoding, return-to-spacer protocol, and hazard-free logic can be used to resist power analysis attacks by making energy consumed per clock cycle independent of processed data. Standard dual-rail logic uses a protocol with a single spacer, e.g., all-zeros, which gives rise to energy balancing problems. We address these problems by incorporating two spacers; the spacers alternate between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software-based self-testing of embedded processors

    Publication Year: 2005, Page(s):461 - 475
    Cited by:  Papers (104)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB) | HTML iconHTML

    Embedded processor testing techniques based on the execution of self-test programs have been recently proposed as an effective alternative to classic external tester-based testing and pure hardware built-in self-test (BIST) approaches. Software-based self-testing is a nonintrusive testing approach and provides at-speed testing capability without any hardware or-performance overheads. In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test vector embedding into accumulator-generated sequences: a linear-time solution

    Publication Year: 2005, Page(s):476 - 484
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1408 KB) | HTML iconHTML

    The test set embedding problem is typically formed as follows: Given an n-stage pattern-generator and a test set, calculate the minimum number of steps that the generator needs to operate in order to generate all vectors in the test set. The cornerstone of a test set embedding technique is its embedding algorithm. An embedding algorithm, given an n-stage pattern generator initialized to a starting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast bit-parallel GF(2n) multiplier for all trinomials

    Publication Year: 2005, Page(s):485 - 490
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    Based on a new representation of GF(2n), we present two multipliers for all irreducible trinomials. Space complexities of the multipliers match the best results. The time complexity of one multiplier is TA + (1 + [log2 n])TX for all irreducible trinomials, where TA and TX are the delay of one 2-input AND and XOR gates, respectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient diminished-1 modulo 2n + 1 multipliers

    Publication Year: 2005, Page(s):491 - 496
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    In this work, we propose a new algorithm for designing diminished-1 modulo 2n+1multipliers. The implementation of the proposed algorithm requires n + 3 partial products that are reduced by a tree architecture into two summands, which are finally added by a diminished-1 modulo 2n+1 adder. The proposed multipliers, compared to existing implementations, offer enhanced operation ... 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 (74 KB)
    Freely Available from IEEE
  • [Back cover]

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