By Topic

IEEE Transactions on Computers

Issue 8 • Date Aug. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (95 KB)
    Freely Available from IEEE
  • Efficient m-ary balanced codes which are invariant under symbol permutation

    Publication Year: 2006, Page(s):929 - 946
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7701 KB) | HTML iconHTML

    A symbol permutation invariant balanced (SPI-balanced) code over the alphabet Zopfm = {0, 1, ..., m - 1} is a block code over Zopfm such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI-balanced w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DPPC-RE: TCAM-based distributed parallel packet classification with range encoding

    Publication Year: 2006, Page(s):947 - 961
    Cited by:  Papers (39)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2207 KB) | HTML iconHTML

    Packet classification has been a critical data path function for many emerging networking applications. An interesting approach is the use of ternary content addressable memory (TCAM) to achieve deterministic, high-speed packet classification performance. However, apart from high cost and power consumption, due to slow growing clock rate for memory technology, in general, the traditional single TC... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design trade-offs for user-level I/O architectures

    Publication Year: 2006, Page(s):962 - 973
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1513 KB) | HTML iconHTML

    To address the growing I/O bottleneck, next-generation distributed I/O architectures employ scalable point-to-point interconnects and minimize operating system overhead by providing user-level access to the I/O subsystem. Reduced I/O overhead allows I/O intensive applications to efficiently employ latency hiding techniques for improved throughput. This paper presents the design of a novel scalable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software multiplication using Gaussian normal bases

    Publication Year: 2006, Page(s):974 - 984
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (539 KB) | HTML iconHTML

    Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields F2m. In this paper, we present new software algorithms for efficient multiplication over F2m that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing sum of completion times and makespan in master-slave systems

    Publication Year: 2006, Page(s):985 - 999
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (875 KB) | HTML iconHTML

    We consider scheduling problems in the master-slave model. In this model, each job has to be processed sequentially in three stages. In the first stage, a preprocessing task runs on a master machine, in the second stage, a slave task runs on a dedicated slave machine, and, in the last stage, a postprocessing task again runs on a master machine, possibly different from the master machine in the fir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelined computation of scalar multiplication in elliptic curve cryptosystems (extended version)

    Publication Year: 2006, Page(s):1000 - 1010
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1748 KB) | HTML iconHTML

    In the current work, we propose a pipelining scheme for implementing elliptic curve cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is based on a key observation: to start the subsequent operation, one need not wait until the current one exits. The next operation can begin while a pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous interconnect delay and crosstalk noise optimization through gate sizing using game theory

    Publication Year: 2006, Page(s):1011 - 1023
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2130 KB) | HTML iconHTML

    The continuous scaling trends of interconnect wires in deep submicron (DSM) circuits result in increased interconnect delay and crosstalk noise. In this work, we develop a new postlayout gate sizing algorithm for simultaneous optimization of interconnect delay and crosstalk noise. The problem of postlayout gate sizing is modeled as a normal form game and solved using Nash equilibrium. The crosstal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective visibility culling method based on cache block

    Publication Year: 2006, Page(s):1024 - 1032
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2331 KB) | HTML iconHTML

    As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organizing sensor networks for integrated target surveillance

    Publication Year: 2006, Page(s):1033 - 1047
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5492 KB) | HTML iconHTML

    Self-organization is critical for a distributed wireless sensor network due to the spontaneous and random deployment of a large number of sensor nodes over a remote area. Such a network is often characterized by its abilities to form an organizational structure without much centralized intervention. An important design goal for a smart sensor network is to be able have an energy-efficient, self-or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An online heuristic for maximum lifetime routing in wireless sensor networks

    Publication Year: 2006, Page(s):1048 - 1056
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2587 KB) | HTML iconHTML

    We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using indexing functions to reduce conflict aliasing in branch prediction tables

    Publication Year: 2006, Page(s):1057 - 1061
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB) | HTML iconHTML

    High-accuracy branch prediction is crucial for high-performance processors. Inspired by the work on indexing functions to eliminate conflict-misses in memory hierarchy, this paper explores different indexing approaches to reduce conflict aliasing in branch-prediction tables. Our results show that indexing functions provide a highly complexity-effective way to enhance prediction accuracy View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integer multipliers with overflow detection

    Publication Year: 2006, Page(s):1062 - 1066
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1067 KB) | HTML iconHTML

    This paper presents a general approach for designing array and tree integer multipliers with overflow detection. The overflow detection techniques are based on an analysis of the magnitudes of the input operands. The overflow detection circuits operate in parallel with a simplified multiplier to reduce the overall area and delay View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comment on "Boolean functions classification via fixed polarity Reed-Muller form"

    Publication Year: 2006, Page(s):1067 - 1069
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    A correction to the classification of the space of n-variable Boolean functions proposed in the paper cited in C.C. Tsai et al. (1997) is reported here and commented upon View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for papers - Special issue on Emergent Systems, Algorithms, and Architectures for Speech-Based Human-Machine Interaction

    Publication Year: 2006, Page(s): 1070
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • IEEE Computer Society celebrates two 60-year anniversaries

    Publication Year: 2006, Page(s): 1071
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Join the IEEE Computer Society - Now with 800 Course Modules for Distance Learning!

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

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

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