By Topic

Computers, IEEE Transactions on

Issue 1 • Date Jan. 2006

Filter Results

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

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (141 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2006 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • Editors' Note

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (33 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Objective-optimal algorithms for long-term Web prefetching

    Publication Year: 2006 , Page(s): 2 - 17
    Cited by:  Papers (8)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1167 KB) |  | HTML iconHTML  

    Web prefetching is based on Web caching and attempts to reduce user-perceived latency. Unlike on-demand caching, Web prefetching fetches objects and stores them in advance, hoping that the prefetched objects are likely to be accessed in the near future and such accesses would be satisfied from the caches rather than by retrieving the objects from the Web server. This paper reviews the popular pref... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beating in-order stalls with "flea-flicker" two-pass pipelining

    Publication Year: 2006 , Page(s): 18 - 33
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1376 KB) |  | HTML iconHTML  

    While compilers have generally proven adept at planning useful static instruction-level parallelism for in-order microarchitectures, the efficient accommodation of unanticipateable latencies, like those of load instructions, remains a vexing problem. Traditional out-of-order execution hides some of these latencies, but repeats scheduling work already done by the compiler and adds additional pipeli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms and architectures for field multiplication using Gaussian normal bases

    Publication Year: 2006 , Page(s): 34 - 47
    Cited by:  Papers (25)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1120 KB) |  | HTML iconHTML  

    Recently, implementations of normal basis multiplication over the extended binary field GF(2m) have received considerable attention. A class of low complexity normal bases called Gaussian normal bases has been included in a number of standards, such as IEEE and NIST for an elliptic curve digital signature algorithm. The multiplication algorithms presented there are slow in software sinc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems

    Publication Year: 2006 , Page(s): 48 - 57
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (544 KB) |  | HTML iconHTML  

    Elliptic curve cryptosystems (ECC) are suitable for memory-constraint devices like smart cards due to their small key-size. A standard way of computing elliptic curve scalar multiplication, the most frequent operation in ECC, is window methods, which enhance the efficiency of the binary method at the expense of some precomputation. The most established window methods are sliding window on NAF (NAF... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On distributed fault-tolerant detection in wireless sensor networks

    Publication Year: 2006 , Page(s): 58 - 70
    Cited by:  Papers (96)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1288 KB) |  | HTML iconHTML  

    In this paper, we consider two important problems for distributed fault-tolerant detection in wireless sensor networks: 1) how to address both the noise-related measurement error and sensor fault simultaneously in fault-tolerant detection and 2) how to choose a proper neighborhood size n for a sensor node in fault correction such that the energy could be conserved. We propose a fault-tolerant dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability

    Publication Year: 2006 , Page(s): 71 - 82
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (904 KB) |  | HTML iconHTML  

    All optical networking is a promising candidate for supporting high-speed communications because of the huge bandwidth of optics. In this paper, we study optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability. We formalize the problem of maximizing network throughput and minimizing total delay as a problem of finding an optimal matching in a weighted b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance dense ring generators

    Publication Year: 2006 , Page(s): 83 - 87
    Cited by:  Papers (8)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1271 KB) |  | HTML iconHTML  

    This paper presents an enhanced architecture of on-chip pseudorandom test pattern generators, test data decompressors, and test response compactors based on ring generators. The new structure is aimed at improving layout and routing properties while, at the same time, reducing propagation delays introduced by associated phase shifters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (t; k)-Diagnosis for matching composition networks

    Publication Year: 2006 , Page(s): 88 - 92
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (168 KB) |  | HTML iconHTML  

    (t, k)-diagnosis, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and replaced in each iteration provided there are at most t faulty processors, where t ≥k This paper proposes a (t,k) diagnosis algorithm for matching composition networks, which include many well-known interconnection networks such as hypercubes, crossed cubes, twisted cubes, a... View full abstract»

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

    Publication Year: 2006 , Page(s): 93 - 96
    Save to Project icon | Request Permissions | PDF file iconPDF (96 KB)  
    Freely Available from IEEE
  • TC Information for authors

    Publication Year: 2006 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2006 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (141 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