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

IEEE Transactions on Computers

Issue 2 • Feb 2000

Filter Results

Displaying Results 1 - 9 of 9
  • Complexity and fast algorithms for multiexponentiations

    Publication Year: 2000, Page(s):141 - 147
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the use of fully specified initial states for testing of synchronous sequential circuits

    Publication Year: 2000, Page(s):175 - 182
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Full scan design renders every combinationally irredundant fault in a synchronous sequential circuit testable. In this paper, we derive a similar result applicable to design-for-testability techniques that only controls the initial state of the circuit in order to improve its testability. Examples of such techniques are parallel load, reset, and scan when it is used only to set the state of the ci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • File assignment in parallel I/O systems with minimal variance of service time

    Publication Year: 2000, Page(s):127 - 140
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1432 KB)

    We address the problem of assigning nonpartitioned files in a parallel I/O system where the file accesses exhibit Poisson arrival rates and fixed service times. We present two new file assignment algorithms based on open queuing networks which aim at minimizing simultaneously the load balance across all disks, as well as the variance of the service time at each disk. We first present an off-line a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New efficient structure for a modular multiplier for RNS

    Publication Year: 2000, Page(s):170 - 174
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Modular multiplication is a very important arithmetic operation in residue-based real-time computing systems. In realizing these multipliers, ROM-based structures are more efficient for small moduli. Due to the exponential growth of ROM sizes, implementations with arithmetic components are more suitable for medium and large moduli. This paper presents a new modular multiplier that can deal efficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity-based load adjustment for static real-time transaction systems

    Publication Year: 2000, Page(s):112 - 126
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    How to exploit application semantics to improve the performance of a real-time data-intensive application has been an active research topic in the past few years. Weaker correctness criteria and semantica-based concurrency control algorithms were proposed to provide more flexibility in reordering read and write events. Distinct from past work, this paper exploits the trade-off between data consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Area-efficient VLSI layouts for binary hypercubes

    Publication Year: 2000, Page(s):160 - 169
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    The hypercube is an interesting and useful topology for parallel computation. While hypercubes have been analyzed in graph theory, this analysis has done little to determine the minimum area required for realizations of the hypercube topology on two-dimensional chips. In a common VLSI layout of the hypercube, the hypercube nodes are placed in a single-row in numeric order. This paper derives an ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replica determinism and flexible scheduling in hard real-time dependable systems

    Publication Year: 2000, Page(s):100 - 111
    Cited by:  Papers (31)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    Fault-tolerant real-time systems are typically based on active replication where replicated entities are required to deliver their outputs in an identical order within a given time interval. Distributed scheduling of replicated tasks, however, violates this requirement if on-line scheduling, preemptive scheduling, or scheduling of dissimilar replicated task sets is employed. This problem of incons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis for dual band PCS networks

    Publication Year: 2000, Page(s):148 - 159
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    In a dual band personal communications services (PCS) network, heavy traffic areas are covered by microcells which overlay macrocells. In such a network, microcells and macrocells utilize different frequency bands. We propose an analytic model to study the performance of a dual band PCS architecture. Our model assumes that a PCS subscriber has a general residence time distribution in a microcell a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of efficient message scheduling for controller area network

    Publication Year: 2000, Page(s):182 - 188
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    The Controller Area Network (CAN) is being widely used in real-time control applications such as automobiles, aircraft, and automated factories. In this pacer, we present the mixed traffic scheduler (MTS) for CAN, which provides higher schedulability than fixed-priority schemes like deadline-monotonic (DM) while incurring less overhead than dynamic earliest-deadline (ED) scheduling. We also descri... 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