IEEE Transactions on Computers

Issue 1 • Jan. 2012

Filter Results

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

    Publication Year: 2012, Page(s): c1
    Request permission for commercial reuse | |PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • [Cover 2]

    Publication Year: 2012, Page(s): c2
    Request permission for commercial reuse | |PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • State of the Journal

    Publication Year: 2012, Page(s):1 - 2
    Request permission for commercial reuse | |PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • PETCAM—A Power Efficient TCAM Architecture for Forwarding Tables

    Publication Year: 2012, Page(s):3 - 17
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2603 KB) | HTML iconHTML Multimedia Media

    Ternary Content Addressable Memory (TCAM) is a hardware device which can support high-speed table lookups and is an attractive solution for applications such as packet forwarding and classification. We investigate various TCAM architectures recently proposed for TCAM power and memory reduction in packet forwarding and show that far better power and memory performance is possible when we use an opt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-Efficient TCAM-Based Classification Using Gray Coding

    Publication Year: 2012, Page(s):18 - 30
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (979 KB) | HTML iconHTML

    Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database in parallel and thus provide high throughput unparalleled by software-based solutions. TCAMs are not well-suited, however, for representing rules that contain range fields. Such rules typically have to be represented (o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Interplay of Voltage/Frequency Scaling and Device Power Management for Frame-Based Real-Time Embedded Applications

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

    Voltage/Frequency Scaling (VFS) and Device Power Management (DPM) are two popular techniques commonly employed to save energy in real-time embedded systems. VFS policies aim at reducing the CPU energy, while DPM-based solutions involve putting the system components (e.g., memory or I/O devices) to low-power/sleep states at runtime, when sufficiently long idle intervals can be predicted. Despite nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design, Implementation, and Evaluation of a QoS-Aware Real-Time Embedded Database

    Publication Year: 2012, Page(s):45 - 59
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1080 KB) | HTML iconHTML

    Quality-aware realtime Embedded DataBase (QeDB) is a database for data-intensive real-time applications running on embedded devices. Currently, databases for embedded systems are best effort, providing no guarantees on their timeliness and data freshness. Existing real-time database (RTDB) technology cannot be applied to these embedded databases since it hypothesizes that the main memory of a syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FPGA-Based High-Performance and Scalable Block LU Decomposition Architecture

    Publication Year: 2012, Page(s):60 - 72
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1150 KB) | HTML iconHTML

    Decomposition of a matrix into lower and upper triangular matrices (LU decomposition) is a vital part of many scientific and engineering applications, and the block LU decomposition algorithm is an approach well suited to parallel hardware implementation. This paper presents an approach to speed up implementation of the block LU decomposition algorithm using FPGA hardware. Unlike most previous app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial Connection-Aware Topology Synthesis for On-Chip Cascaded Crossbar Network

    Publication Year: 2012, Page(s):73 - 86
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1891 KB) | HTML iconHTML

    The crossbar (also called bus matrix) solution is known as one of the most effective communication architectures for modern high-performance embedded systems. To make it even more effective, several topology synthesis methods have been proposed. They mostly generate a crossbar network in a cascaded fashion under the assumption that each crossbar switch is fully connected (i.e., each input has a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective and Efficient Memory Protection Using Dynamic Tainting

    Publication Year: 2012, Page(s):87 - 100
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (710 KB) | HTML iconHTML

    Programs written in languages allowing direct access to memory through pointers often contain memory-related faults, which cause nondeterministic failures and security vulnerabilities. We present a new dynamic tainting technique to detect illegal memory accesses. When memory is allocated, at runtime, we taint both the memory and the corresponding pointer using the same taint mark. Taint marks are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Reconstruction of Data Perturbed by Random Projections

    Publication Year: 2012, Page(s):101 - 117
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (895 KB) | HTML iconHTML

    Random Projection (RP) has raised great concern among the research community of privacy-preserving data mining, due to its high efficiency and utility, e.g., keeping the euclidean distances among the data points. It was shown in [33] that, if the original data set composed of m attributes is multiplied by a mixing matrix of ktimes m (m>;k) which is random and orthogonal on expectation, then the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks

    Publication Year: 2012, Page(s):118 - 133
    Cited by:  Papers (82)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1388 KB) | HTML iconHTML

    Sensing coverage is an essential functionality of wireless sensor networks (WSNs). However, it is also well known that coverage alone in WSNs is not sufficient, and hence network connectivity should also be considered for the correct operation of WSNs. In this paper, we address the problem of k-coverage in WSNs such that in each scheduling round, every location in a monitored field (or simply fiel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pattern Adaptive NAND Flash Memory Storage Structure

    Publication Year: 2012, Page(s):134 - 138
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (693 KB) | HTML iconHTML

    To enhance performance of flash memory-based solid state disk (SSD), large logically chained blocks can be assembled by binding adjacent flash blocks across several flash memory chips. However, flash memory does not allow in-place overwriting and thus the operations that merge writes on these blocks suffer a visible decrease in performance. Furthermore, when small random writes are spread over the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2011 Reviewers List

    Publication Year: 2012, Page(s):139 - 144
    Request permission for commercial reuse | |PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • 2011 Annual Index

    Publication Year: 2012, Page(s): Not in print
    Request permission for commercial reuse | |PDF file iconPDF (614 KB)
    Freely Available from IEEE
  • TC Information for authors

    Publication Year: 2012, Page(s): c3
    Request permission for commercial reuse | |PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • [Cover 4]

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