By Topic

IEEE Transactions on Computers

Issue 11 • Nov. 2005

Filter Results

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

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • The VPC trace-compression algorithms

    Publication Year: 2005, Page(s):1329 - 1344
    Cited by:  Papers (28)  |  Patents (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2152 KB) | HTML iconHTML

    Execution traces, such as are used to study and analyze program behavior, are often so large that they need to be stored in compressed form. This paper describes the design and implementation of four value prediction-based compression (VPC) algorithms for traces that record the PC as well as other information about executed instructions. VPC1 directly compresses traces using value predictors, VPC2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A configurable statistical lossless compression core based on variable order Markov modeling and arithmetic coding

    Publication Year: 2005, Page(s):1345 - 1359
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1640 KB) | HTML iconHTML

    This paper presents a practical realization in hardware of the concepts of variable order Markov modeling using multisymbol alphabets and arithmetic coding for lossless compression of universal data. This type of statistical coding algorithm has long been regarded as being able to deliver very high compression ratios close to the information content of the source data. However, their high computat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving computer architecture simulation methodology by adding statistical rigor

    Publication Year: 2005, Page(s):1360 - 1373
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2184 KB) | HTML iconHTML

    Due to cost, time, and flexibility constraints, computer architects use simulators to explore the design space when developing new processors and to evaluate the performance of potential enhancements. However, despite this dependence on simulators, statistically rigorous simulation methodologies are typically not used in computer architecture research. A formal methodology can provide a sound basi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and properties of a new pseudorandom generator based on a filtered FCSR automaton

    Publication Year: 2005, Page(s):1374 - 1383
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Feedback with carry shift registers (FCSR) was introduced by Goresky and Klapper in 1993. It is similar to the classical linear feedback shift registers (LFSR) used in many pseudorandom generators. The main difference is that the elementary additions are not additions modulo 2 but with propagation of carries. The main problem for the use of an FCSR automaton is the fact that the generated sequence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair bandwidth sharing in distributed systems: a game-theoretic approach

    Publication Year: 2005, Page(s):1384 - 1393
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML Multimedia Media

    Fair sharing of bandwidth remains an unresolved issue for distributed systems. In this paper, the users of a distributed LAN are modeled as selfish users with independence to choose their individual strategies. With these selfish users, the contention-based distributed medium access scenario is modeled as a complete-information, noncooperative game, designated the "access game". A novel MAC strate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network interface data caching

    Publication Year: 2005, Page(s):1394 - 1408
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1824 KB) | HTML iconHTML

    Network interface data caching reduces local interconnect traffic on network servers by caching frequently-requested content on a programmable network interface. The operating system on the host CPU determines which data to store in the cache and for which packets it should use data from the cache. To facilitate data reuse across multiple packets and connections, the cache only stores application-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant protocol for energy-efficient permutation routing in wireless networks

    Publication Year: 2005, Page(s):1409 - 1421
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    A wireless network (WN) is a distributed system where each node is a small hand-held commodity device called a station. Wireless sensor networks have received increasing interest in recent years due to their usage in monitoring and data collection in a wide variety of environments like remote geographic locations, industrial plants, toxic locations, or even office buildings. Two of the most import... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded-latency content distribution feasibility and evaluation

    Publication Year: 2005, Page(s):1422 - 1437
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB) | HTML iconHTML

    This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with different configurable per-class delay bounds. The network uses a simple distributed algorithm to dynamically select subsets of its proxy servers for different classes such that a global per-class delay bound is achieved on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causality-based predicate detection across space and time

    Publication Year: 2005, Page(s):1438 - 1453
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1912 KB) | HTML iconHTML

    This paper presents event stream-based online algorithms that fuse the data reported from processes to detect causality-based predicates of interest. The proposed algorithms have the following features. 1) The algorithms are based on logical time, which is useful to detect "cause and effect" relationships in an execution. 2) The algorithms detect properties that can be specified using predicates u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new minimal average weight representation for left-to-right point multiplication methods

    Publication Year: 2005, Page(s):1454 - 1459
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    This paper introduces a new radix-2 representation with the same average weight as the width-w nonadjacent form (w-NAF). In both w-NAF and the proposed representations, each nonzero digit is an odd integer with absolute value less than M. However, for w-NAF, M is of the form 2w-1, while, for the proposed representation, it can be any positive integer. Therefore, using the proposed integ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exact stochastic analysis of priority-driven periodic real-time systems and its approximations

    Publication Year: 2005, Page(s):1460 - 1466
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems and can handle, tasks with arbitrary relative deadlines and execution time distributions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of multiple hold-time and setup-time faults in scan chains

    Publication Year: 2005, Page(s):1467 - 1472
    Cited by:  Papers (18)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    This paper presents a diagnosis technique to locate hold-time (HT) faults and setup-time (ST) faults in scan chains. This technique achieves deterministic diagnosis results by applying thermometer scan input (TSI) patterns, which have only one rising or one falling transition. With TSI patterns, the diagnosis patterns can be easily generated by existing single stuck-at fault test pattern generator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TC Information for authors

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

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