By Topic

IEEE Transactions on Computers

Issue 10 • Oct. 2004

Filter Results

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

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

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • O(log n) dynamic router-tables for prefixes and ranges

    Publication Year: 2004, Page(s):1217 - 1230
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB) | HTML iconHTML

    Two versions of the Internet (IP) router-table problem are considered. In the first, the router table consists of n pairs of tuples of the form (p, a), where p is an address prefix and a is the next-hop information. In this version of the router-table problem, we are to perform the following operations: insert a new tuple, delete an existing tuple, and find the tuple with longest matching-prefix f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal tower fields

    Publication Year: 2004, Page(s):1231 - 1243
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB) | HTML iconHTML

    We introduce a new tower field representation, optimal tower fields (OTFs), that facilitates efficient finite field operations. The recursive direct inversion method we present has significantly lower complexity than the known best method for inversion in optimal extension fields (OEFs), i.e., Itoh-Tsujii's inversion technique. The complexity of our inversion algorithm is shown to be O(m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Late allocation and early release of physical registers

    Publication Year: 2004, Page(s):1244 - 1259
    Cited by:  Papers (10)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1696 KB) | HTML iconHTML

    The register file is one of the critical components of current processors in terms of access time and power consumption. Among other things, the potential to exploit instruction-level parallelism is closely related to the size and number of ports of the register file. In conventional register renaming schemes, both register allocation and releasing are conservatively done, the former at the rename... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication state transfer for the mobility of concurrent heterogeneous computing

    Publication Year: 2004, Page(s):1260 - 1273
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    In a dynamic environment where a process can migrate from one host to another host, communication state transfer is a key issue of process coordination. We present a set of data communication and process migration protocols to support communication state transfer in a dynamic, distributed parallel environment. The protocols preserve the semantics of point-to-point communication; they guarantee mes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-power high-performance reconfigurable computing cache architectures

    Publication Year: 2004, Page(s):1274 - 1290
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2784 KB) | HTML iconHTML

    The demand for higher computing power and, thus, more on-chip computing resources; is ever increasing. The size of on-chip cache memory has also been consistently increasing to keep up with developments in implementation technology. However, some applications may not utilize full cache capacity and, on the contrary, require more computing resources. To efficiently utilize silicon real-estate on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent error detection in wavelet lifting transforms

    Publication Year: 2004, Page(s):1291 - 1302
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB) | HTML iconHTML

    Wavelet transforms, central to multiresolution signal analysis and important in the JPEG2000 image compression standard, are quite susceptible to computer-induced errors because of their pipelined structure and multirate processing requirements. Such errors emanate from computer hardware, software bugs, or radiation effects from the surrounding environment. Implementations use lifting schemes, whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtualizing network I/O on end-host operating system: operating system support for network control and resource protection

    Publication Year: 2004, Page(s):1303 - 1316
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB) | HTML iconHTML

    In the recent past, with the advent of more powerful networks, computations have become more distributed in nature and control of network resources has become essential for operating systems (OS). Nevertheless, proposed primitives for network control at end-host OS are designed without an OS design perspective and have been in disagreement with existing OS constructs, causing a variety of problems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymous wireless authentication on a portable cellular mobile system

    Publication Year: 2004, Page(s):1317 - 1329
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    A secure and anonymous conference call set-up scheme is proposed for a portable cellular mobile system. The proposed scheme uses an identity-based concept and enables a mobile unit and a base station to directly authenticate each other by their public identity. It provides mobile subscribers with user identification privacy. Each mobile unit joining in this system can determine whether it is part ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing from a nondeterministic finite state machine using adaptive state counting

    Publication Year: 2004, Page(s):1330 - 1342
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. We extend the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic distributed broadcast scheme in ad hoc wireless networks

    Publication Year: 2004, Page(s):1343 - 1354
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB) | HTML iconHTML

    We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to carry out a broadcast process. The status of each node, forward or nonforward, is determined either by the node itself or by other nodes. Node status can be determined at different snapshots of network state along time (ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On causal broadcasting with positive acknowledgments and bounded-length counters

    Publication Year: 2004, Page(s):1355 - 1358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    A causal broadcast protocol was proposed earlier in [R. Baldoni (1998)]. Two extensions of the protocol were also proposed in order to improve its throughput and bandwidth utilization. We show that both extensions are not live, i.e., there may be execution patterns in which processes stop delivering messages. We also show that the algorithm for the second extension does not satisfy the requirement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Response to Comment on "A Positive Acknowledgment Protocol for Causal Broadcasting"

    Publication Year: 2004, Page(s): 1358
    Request permission for commercial reuse | PDF file iconPDF (27 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Design and Test of Systems-on-a Chip

    Publication Year: 2004, Page(s): 1359
    Request permission for commercial reuse | PDF file iconPDF (20 KB) | HTML iconHTML
    Freely Available from IEEE
  • Call for Papers for Special Issue on Simulation-Based Design Validation

    Publication Year: 2004, Page(s): 1360
    Request permission for commercial reuse | PDF file iconPDF (30 KB) | HTML iconHTML
    Freely Available from IEEE
  • TC Information for authors

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

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