IEEE Transactions on Computers

Issue 7 • July 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • Predictable performance in SMT processors: synergy between the OS and SMTs

    Publication Year: 2006, Page(s):785 - 799
    Cited by:  Papers (37)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4000 KB) | HTML iconHTML

    Current operating systems (OS) perceive the different contexts of simultaneous multithreaded (SMT) processors as multiple independent processing units, although, in reality, threads executed in these units compete for the same hardware resources. Furthermore, hardware resources are assigned to threads implicitly as determined by the SMT instruction fetch (Ifetch) policy, without the control of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistically optimal dynamic power management for streaming data

    Publication Year: 2006, Page(s):800 - 814
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2288 KB) | HTML iconHTML

    This paper presents a method that uses data buffers to create long periods of idleness to exploit power management. This method considers the power consumed by the buffers and assigns an energy penalty for buffer underflow. Our approach provides analytic formulas for calculating the optimal buffer sizes without subjective or heuristic decisions. We simulate four different hardware configurations w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS routing in communication networks: approximation algorithms based on the primal simplex method of linear programming

    Publication Year: 2006, Page(s):815 - 829
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB) | HTML iconHTML

    Given a directed network with two integer weights, cost and delay, associated with each link, quality-of-service (QoS) routing requires the determination of a minimum cost path from one node to another node such that the delay of the path is bounded by a specified integer value. This problem, also known as the constrained shortest path problem (CSP), admits an integer linear programming (ILP) form... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic debugging of real-time systems based on incremental satisfiability counting

    Publication Year: 2006, Page(s):830 - 842
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB) | HTML iconHTML

    Real-time logic (RTL) is useful for the verification of a safety assertion with respect to the specification of a realtime system. Since the satisfiability problem for RTL is undecidable, the systematic debugging of a real-time system appears impossible. A first step toward this challenge was presented. With RTL, each prepositional formula corresponds to a verification condition. The number of tru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Condition adaptation in synchronous consensus

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

    The condition-based approach is one of the sophisticated methods used to overcome several impossibility results in the distributed consensus problem (e.g., impossibility of fault tolerance in asynchronous consensus or time complexity lower bounds in synchronous consensus). It introduces conditions on input vectors to specify subsets of all possible input vectors to consensus algorithms and conditi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges

    Publication Year: 2006, Page(s):854 - 863
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1976 KB) | HTML iconHTML

    A graph G=(V, E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to |V| in G. Let Fv and Fe be the sets of faulty nodes and faulty edges of an n-dimensional Mobius cube MQn, respectively, and let F=Fv∪Fe. A faulty graph is pancyclic if it contains fault-free cycles of all lengths from 4 to |V-Fv|. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling security-critical real-time applications on clusters

    Publication Year: 2006, Page(s):864 - 879
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5496 KB) | HTML iconHTML

    Security-critical real-time applications such as military aircraft flight control systems have mandatory security requirements in addition to stringent timing constraints. Conventional real-time scheduling algorithms, however, either disregard applications' security needs and thus expose the applications to security threats or run applications at inferior security levels without optimizing securit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the prediction of Java object lifetimes

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

    Accurately predicting object lifetimes is important for improving memory management systems. Current garbage collectors make relatively coarse-grained predictions (e.g., "short-lived" versus "long-lived") and rely on application-independent heuristics related to the local characteristics of an allocation. This paper introduces a prediction method which is fully precise and makes its predictions ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-real-time content scheduling algorithms for wireless data networks

    Publication Year: 2006, Page(s):893 - 905
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3136 KB) | HTML iconHTML

    A substantial portion of the emerging wireless data service consists of non-real-time applications such as content download. The existing mechanisms based on per-packet performance guarantees used mainly for voice and streaming media do not suffice for the elastic nature of non-real-time traffic. For a non-real-time user data services, the key performance measure of interest is the total download ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient NAND flash file system for flash memory storage

    Publication Year: 2006, Page(s):906 - 912
    Cited by:  Papers (71)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB) | HTML iconHTML

    In this paper, we present an efficient flash file system for flash memory storage. Flash memory, especially NAND flash memory, has become a major method for data storage. Currently, a block level translation interface is required between an existing file system and flash memory chips due to its physical characteristics. However, the approach of existing file systems on top of the emulating block i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-approximating circuits

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

    In this paper, we define and study the k-approximating circuits. A circuit accepting a given set of inputs A is k-approximated by accepting inputs that lifter from one of A by at most k bits. We show that the existence of polynomial-size k-approximating circuits depends on the relation between k and the number of inputs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems

    Publication Year: 2006, Page(s):918 - 923
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new efficient second-order spectral- codes with small lookup tables

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

    Tallini and Bose introduced a recursive method to construct second-order spectral- codes which result in short (information length 16) base optimal second-order spectral- codes that can be easily implemented either with table lookup or enumerative coding. In this paper, the extended base suboptimal second-order spectral- codes (17 information length 32) obtained from two short base codes by lookup... View full abstract»

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

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

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

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