Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 5 • May 1999

Filter Results

Displaying Results 1 - 7 of 7
  • Availability of CAUTRA, a subset of the French air traffic control system

    Publication Year: 1999, Page(s):528 - 535
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The aim of our work is to provide a quantified means of helping in the definition of a new architecture for CAUTRA, a subset of the French Air Traffic Control system. In this paper, we define a set of alternative architectures, give some elements for constructing their dependability models, and compare their availability. Modeling is carried out following a modular and systematic approach, based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The broadcast comparison model for on-line fault diagnosis in multicomputer systems: theory and implementation

    Publication Year: 1999, Page(s):470 - 493
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    This paper describes a new comparison-based model for distributed fault diagnosis in multicomputer systems with a weak reliable broadcast capability. The classical problems of diagnosability and diagnosis are both considered under this broadcast comparison model. A characterization of diagnosable systems is given, which leads to a polynomial-time diagnosability algorithm. A polynomial-time diagnos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mastrovito multiplier for all trinomials

    Publication Year: 1999, Page(s):522 - 527
    Cited by:  Papers (104)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    An efficient algorithm for the multiplication in GF(2m) was introduced by Mastrovito. The space complexity of the Mastrovito multiplier for the irreducible trinomial xm+x+1 was given as m2-1 XOR and m2 AND gales. In this paper, we describe an architecture based on a new formulation of the multiplication matrix and show that the Mastrovito multiplier for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Walk-time address adjustment for improving the accuracy of dynamic branch prediction

    Publication Year: 1999, Page(s):457 - 469
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Dynamic branch prediction has been an effective technique for boosting the performance of modern high performance microprocessors. Since hardware predictors only have a limited number of 2-bit counters but programs often have a large, variable number of branches, two branches in the programs may thus be mapped to the same 2-bit counter. Predictions for these two branches may interfere with each ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new network topology with multiple meshes

    Publication Year: 1999, Page(s):536 - 551
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    This paper introduces a new network topology, called Multi-Mesh (MM), which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The proposed network consists of n 4 processors and is 4-regular with a diameter of 2n. The network also contains a Hamiltonian cycle. Simple routing algorithms for point-to-point communication, one-to-all broadcast, and multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comprehensive hardware and software support for operating systems to exploit MP memory hierarchies

    Publication Year: 1999, Page(s):494 - 505
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    High-performance multiprocessor workstations are becoming increasingly popular. Since many of the workloads running on these machines are operating-system intensive, we are interested in exploring the types of support for the operating system that the memory hierarchy of these machines should provide. In this paper, we evaluate a comprehensive set of hardware and software supports that minimize th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GRASP: a search algorithm for propositional satisfiability

    Publication Year: 1999, Page(s):506 - 521
    Cited by:  Papers (410)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial In... 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