By Topic

IEEE Transactions on Computers

Issue 3 • Date Mar 2002

Filter Results

Displaying Results 1 - 8 of 8
  • Analysis of a BICS-only concurrent error detection method

    Publication Year: 2002, Page(s):241 - 253
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    We propose a BICS-only method for concurrent error detection (CED) where a built-in current sensor (BICS) is solely responsible for detecting faults and errors. Due to the wide applicability of the BICS, this approach can be applied directly to combinational circuits, sequential circuits, and even some analog circuits. A dependability model was developed to study the effectiveness of the proposed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the inherent space complexity of fast parallel multipliers for GF(2m)

    Publication Year: 2002, Page(s):346 - 351
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    A lower bound to the number of AND gates used in parallel multipliers for GF(2m), under the condition that time complexity be minimum, is determined. In particular, the exact minimum number of AND gates for primitive normal bases and optimal normal bases of Type II multipliers is evaluated. This result indirectly suggests that space complexity is essentially a quadratic function of m wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient representation scheme for multidimensional array operations

    Publication Year: 2002, Page(s):327 - 345
    Cited by:  Papers (24)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (559 KB) | HTML iconHTML

    Array operations are used in a large number of important scientific codes. To implement these array operations efficiently, many methods have been proposed in the literature, most of which are focused on two-dimensional arrays. When extended to higher dimensional arrays, these methods usually do not perform well. Hence, designing efficient algorithms for multidimensional array operations becomes a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computationally efficient and numerically stable reliability bounds for repairable fault-tolerant systems

    Publication Year: 2002, Page(s):254 - 268
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    The transient analysis of large continuous time Markov reliability models of repairable fault-tolerant systems is computationally expensive due to model stiffness. We develop and analyze a method to compute bounds for a measure defined on a particular, but quite wide class of continuous time Markov models, encompassing both exact and bounding continuous time Markov reliability models of fault-tole... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time processing in client-server databases

    Publication Year: 2002, Page(s):269 - 288
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    We propose and experimentally evaluate the use of the client-server database paradigm for real-time processing. To date, the study of transaction processing with time constraints has mostly been restricted to centralized or "single-node" systems. Recently, client-server databases have exploited locality of data accesses in real-world applications to successfully provide reduced transaction respons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elastic scheduling for flexible workload management

    Publication Year: 2002, Page(s):289 - 302
    Cited by:  Papers (110)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (686 KB) | HTML iconHTML

    An increasing number of real-time applications related to multimedia and adaptive control systems require greater flexibility than classical real-time theory usually permits. We present a novel scheduling framework in which tasks are treated as springs with given elastic coefficients to better conform to the actual load conditions. Under this model, periodic tasks can intentionally change their ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic approach for efficient TCP buffer allocation

    Publication Year: 2002, Page(s):303 - 312
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (793 KB) | HTML iconHTML

    The paper proposes local and global optimization schemes for efficient TCP buffer allocation in an HTTP server. The proposed local optimization scheme dynamically adjusts the TCP send-buffer size to the connection and server characteristics. The global optimization scheme divides a certain amount of buffer space among all active TCP connections. These schemes are of increasing importance due to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing memory latency via read-after-read memory dependence prediction

    Publication Year: 2002, Page(s):313 - 326
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1505 KB) | HTML iconHTML

    We observe that typical programs exhibit highly regular read-after-read (RAR) memory dependence streams. To exploit this regularity, we introduce read-after-read memory dependence prediction. This technique predicts whether: 1) a load will access a memory location that a preceding load accesses and 2) exactly which this preceding load is. This prediction is done without actual knowledge of the cor... View full abstract»

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

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