By Topic

IEEE Transactions on Computers

Issue 12 • Date Dec. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • Introducting the New Editor-in-Chief of the IEEE Transactions on Computers

    Publication Year: 2006, Page(s):1489 - 1490
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Address-Value Delta (AVD) Prediction: A Hardware Technique for Efficiently Parallelizing Dependent Cache Misses

    Publication Year: 2006, Page(s):1491 - 1508
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5515 KB) | HTML iconHTML

    While runahead execution is effective at parallelizing independent long-latency cache misses, it is unable to parallelize dependent long-latency cache misses. To overcome this limitation, this paper proposes a novel hardware technique, address-value delta (AVD) prediction. An AVD predictor keeps track of the address (pointer) load instructions for which the arithmetic difference (i.e., delta) betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Resource Reservation Algorithm for Power-Aware Scheduling of Periodic and Aperiodic Real-Time Tasks

    Publication Year: 2006, Page(s):1509 - 1522
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1598 KB) | HTML iconHTML

    Power consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by batteries, the goal is to extend the autonomy of the system as much as possible. To reduce power consumption, modern processors can change their voltage and frequency at runtime. A power-aware scheduling algorithm can exploit this capability to reduce power consumption while... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Accuracy in Mitchell's Logarithmic Multiplication Using Operand Decomposition

    Publication Year: 2006, Page(s):1523 - 1535
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4965 KB) | HTML iconHTML

    Logarithmic number systems (LNS) offer a viable alternative in terms of area, delay, and power to binary number systems for implementing multiplication and division operations for applications in signal processing. The Mitchell algorithm (MA), proposed, reduces the complexity of finding the logarithms and the antilogarithms using piecewise straight line approximations of the logarithm and the anti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations

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

    Modular exponentiation in an abelian group is one of the most frequently used mathematical primitives in modern cryptography. Batch verification is an algorithm for verifying many exponentiations simultaneously. We propose two fast batch verification algorithms. The first one makes use of exponents of small weight, called sparse exponents, and is asymptotically 10 times faster than individual veri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • eQoS: Provisioning of Client-Perceived End-to-End QoS Guarantees in Web Servers

    Publication Year: 2006, Page(s):1543 - 1556
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2487 KB) | HTML iconHTML

    It is important to guarantee client-perceived end-to-end quality of service (QoS) under heavy load conditions. Existing work focuses on network transfer time or server-side request processing time. In this paper, we propose a novel framework, eQoS, to monitor and control client-perceived response time in heavy loaded Web servers. The response time is measured with respect to Web pages that contain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Permutation Routing in Partitioned Optical Passive Star Networks

    Publication Year: 2006, Page(s):1557 - 1571
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2081 KB) | HTML iconHTML

    This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a POPS(d, g) network either with O(d/g log g) deterministic slots, or, with high probability, with 5clfloord/grfloor + o(d/g) + O(log log g) randomized slots, where constant c = exp(1 + e-1) ap 3.927... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • STORM: Scalable Resource Management for Large-Scale Parallel Computers

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

    Although clusters are a popular form of high-performance computing, they remain more difficult to manage than sequential systems - or even symmetric multiprocessors. In this paper, we identify a small set of primitive mechanisms that are sufficiently general to be used as building blocks to solve a variety of resource-management problems. We then present STORM, a resource-management environment th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized Slowdown in Real-Time Task Systems

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

    Slowdown factors determine the extent of slowdown a computing system can experience based on functional and performance requirements. Dynamic voltage scaling (DVS) of a processor based on slowdown factors can lead to considerable energy savings. We address the problem of computing slowdown factors for dynamically scheduled tasks with specified deadlines. We present an algorithm to compute a near o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability Envelope for Real-Time Radar Dwell Scheduling

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

    This paper proposes novel techniques for scheduling radar dwells in phased array radar systems. In order to handle complex physical characteristics such as dwell interleaving, transmitting duty cycle constraint, and energy constraint, we propose a notion of schedulability envelope. The schedulability envelope designed offline hides the details of complex radar dwell scheduling and provides a simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 2-Level TCAM Architecture for Ranges

    Publication Year: 2006, Page(s):1614 - 1629
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3827 KB) | HTML iconHTML

    As the demand for high-quality Internet increases, emerging network applications are spurring the need for faster, feature-rich, and cost-effective routers. Multifield packet classification in routers has been a computation-intensive data path function for software implementation. Therefore, solutions for packet classification based on hardware design, such as ternary content addressable memory (T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Opens and Delay Faults in CMOS RAM Address Decoders

    Publication Year: 2006, Page(s):1630 - 1639
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2444 KB) | HTML iconHTML

    This paper presents a complete electrical analysis of address decoder delay faults "ADFs" caused by resistive opens in RAMs. A classification between inter and intragate opens is made. A systematic way is introduced to explore the space of possible tests to detect these faults; it is based on generating appropriate sensitizing address transitions and the corresponding sensitizing operation sequenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mirrored Disk Organization Reliability Analysis

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

    Disk mirroring or RAID level 1 (RAID1) is a popular paradigm to achieve fault tolerance and a higher disk access bandwidth for read requests. We consider four RAID1 organizations: basic mirroring, group rotate declustering, interleaved declustering, and chained declustering, where the last three organizations attain a more balanced load than basic mirroring when disk failures occur. We first obtai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internode Distance and Optimal Routing in a Class of Alternating Group Networks

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

    Alternating group graphs AGn, studied by Jwo and others, constitute a class of Cayley graphs that possess certain desirable properties compared with other regular networks considered by researchers in parallel and distributed computing. A different form, AN n, of such graphs, proposed by Youhou and dubbed alternating group networks, has been shown to possess advantages over A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Annual index

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

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

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