By Topic

IEEE Transactions on Computers

Issue 3 • Date Mar 2004

Filter Results

Displaying Results 1 - 17 of 17
  • Software cost model for quantifying the gain with considerations of random field environments

    Publication Year: 2004, Page(s):380 - 384
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (543 KB) | HTML iconHTML

    In this paper, we present a software gain model under random field environment with consideration of not only time to remove faults during in-house testing, cost of removing faults during beta testing, risk cost due to software failure, but also the benefits from reliable executions of the software during the beta testing and field operation. To our knowledge, this is the first study that incorpor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-speed, low-complexity systolic designs of novel iterative division algorithms in GF(2m)

    Publication Year: 2004, Page(s):375 - 380
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB) | HTML iconHTML

    We extend the binary algorithm invented by Stein and propose novel iterative division algorithms over GF(2m) for systolic VLSI realization. While algorithm EBg is a basic prototype with guaranteed convergence in at most 2m - 1 iterations, its variants, algorithms EBd and EBdf, are designed for reduced complexity and fixed critical path delay, respectively. We show that algorithms EBd an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exponentiation unit for an OpenGL lighting engine

    Publication Year: 2004, Page(s):251 - 258
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    The OpenGL geometry pipeline lighting stage requires raising a number in the range [0,1] to a power between [1,128] to compute specular reflections and spotlights. The result need only be accurate to a number of bits related to the color depth of the output device. We describe a hardware implementation of such an exponentiation unit based on a logarithm lookup table, a multiplier, and an inverse l... View full abstract»

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

    Publication Year: 2004, Page(s):370 - 374
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (661 KB) | HTML iconHTML

    2n-1 is one of the most commonly used moduli in residue number systems. In this paper, we propose a new method for designing modified Booth modulo 2n-1 multipliers, which, for even values of n, require one less partial product than the already known. CMOS implementations reveal that the proposed multipliers compared to earlier solutions offer savings up to 28.7 percent and up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks

    Publication Year: 2004, Page(s):241 - 250
    Cited by:  Papers (194)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (878 KB) | HTML iconHTML

    We propose a distributed solution for a canonical task in wireless sensor networks - the binary detection of interesting environmental events. We explicitly take into account the possibility of sensor measurement faults and develop a distributed Bayesian algorithm for detecting and correcting such faults. Theoretical analysis and simulation results show that 85-95 percent of faults can be correcte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural support for uniprocessor and multiprocessor active memory systems

    Publication Year: 2004, Page(s):288 - 307
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB) | HTML iconHTML

    We introduce an architectural approach to improve memory system performance in both uniprocessor and multiprocessor systems. The architectural innovation is a flexible active memory controller backed by specialized cache coherence protocols that permit the transparent use of address remapping techniques. The resulting system shows significant performance improvement across a spectrum of machine co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vulnerability of sensor networks to unauthorized traversal and monitoring

    Publication Year: 2004, Page(s):364 - 369
    Cited by:  Papers (29)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1033 KB) | HTML iconHTML

    There is a growing interest in the use of wireless ad hoc sensor networks to monitor, detect, and track the movement of specified targets in a geographic region. A common concern in the deployment of such networks is whether or not a target can pass or intrude a sensor field without being detected. Recent papers in the literature have defined a measure called exposure to quantify the likelihood of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial scan design based on circuit state information and functional analysis

    Publication Year: 2004, Page(s):276 - 287
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    Partial scan design is divided into two stages: 1) critical cycle breaking and 2) partial scan flip-flop selection with respect to conflict resolution. A multiple phase partial scan design method is introduced by combining circuit state information and conflict analysis. Critical cycles are broken using a combination of valid circuit state information and conflict analysis. It is quite cost-effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(logn) dynamic router-table design

    Publication Year: 2004, Page(s):351 - 363
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (717 KB) | HTML iconHTML

    Internet (IP) packet forwarding is typically done by finding the longest prefix in a router table that matches the packet's destination address. For W-bit destination addresses, the use of binary tries enables us to determine the longest matching prefix in O(W) time, independent of the number n of prefixes in the router table. New prefixes may be inserted and old ones deleted in O(W) time also. Si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assessing and improving TCP rate shaping over edge gateways

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

    Computers installed with commercial/open-source software have been widely employed as organizational edge gateways to provide policy-based network management. Such gateways include firewalls for access control, and bandwidth managers for managing the narrow Internet access links. When managing the TCP traffic, pass-through TCP flows can introduce large buffer requirements, large latency, frequent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general stochastic model for dynamic locking in database systems

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

    We present a novel stochastic model to study the performances of the two-phase dynamic locking in database systems with no-waiting policy. It is a general stochastic model to describe the database environment and transaction states in detail. It deals with the nonuniform access, write-locking, read-locking, and multiple transaction classes in a unique way. In the analysis, we first solve the stead... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerance in collaborative sensor networks for target detection

    Publication Year: 2004, Page(s):320 - 333
    Cited by:  Papers (134)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1066 KB) | HTML iconHTML

    Collaboration in sensor networks must be fault-tolerant due to the harsh environmental conditions in which such networks can be deployed. We focus on finding algorithms for collaborative target detection that are efficient in terms of communication cost, precision, accuracy, and number of faulty sensors tolerable in the network. Two algorithms, namely, value fusion and decision fusion, are identif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A utilization bound for aperiodic tasks and priority driven scheduling

    Publication Year: 2004, Page(s):334 - 350
    Cited by:  Papers (49)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1203 KB) | HTML iconHTML

    Real-time scheduling theory offers constant-time schedulability tests for periodic and sporadic tasks based on utilization bounds. Unfortunately, the periodicity or the minimal interarrival-time assumptions underlying these bounds make them inapplicable to a vast range of aperiodic workloads such as those seen by network routers, Web servers, and event-driven systems. This paper makes several impo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 2004, Page(s): 01
    Request permission for commercial reuse | PDF file iconPDF (302 KB)
    Freely Available from IEEE
  • IEEE Transactions on Computers

    Publication Year: 2004, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (223 KB)
    Freely Available from IEEE
  • TC: Information for authors

    Publication Year: 2004, Page(s): 03
    Request permission for commercial reuse | PDF file iconPDF (223 KB)
    Freely Available from IEEE
  • IEEE Computer Society

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