By Topic

IEEE Transactions on Computers

Issue 5 • Date May 1997

Filter Results

Displaying Results 1 - 15 of 15
  • Comments on "Theory and applications of cellular automata in cryptography" [with reply]

    Publication Year: 1997, Page(s):637 - 639
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (33 KB)

    This paper argues that the cipher systems based on cellular automata (CA) proposed by S. Nandi et al. (1994) are affine and are insecure. A reply by S. Nandi and P. Pal Chaudhuri is given. The reply emphasizes the point that the regular, modular, cascadable structure of local neighborhood CA can be employed for building low cost cipher system hardware. This cost effective engineering solution can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reply to Comments on "Theory And Application Of Cellular Automata In Cryptography"

    Publication Year: 1997, Page(s): 639
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic bounds for parallel program execution times with processor constraints

    Publication Year: 1997, Page(s):630 - 636
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    A parallel program can be modeled as an acyclic directed graph, where a node represents a task, which is the smallest grain of computation to be assigned to a processor, and arcs stand for precedence (synchronization) constraints among the tasks. Due to different input data and unpredictable dynamic run time environments, the execution times of tasks as well as the entire program can be treated as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The circulating processor model of parallel systems

    Publication Year: 1997, Page(s):572 - 587
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    This paper introduces the circulating processor model for parallel computer systems. Models of parallel systems tend to be computationally complex due to synchronization constraints such as task forking and joining. However, product form queuing network models remain computationally efficient as the size of the system grows by calculating only the mean performance metrics of the system. The circul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On optimal strategies for cycle-stealing in networks of workstations

    Publication Year: 1997, Page(s):545 - 557
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    We study the parallel scheduling problem for a new modality of parallel computing: having one workstation “steal cycles” from another. We focus on a draconian mode of cycle-stealing, in which the owner of workstation B allows workstation A to take control of B's processor whenever it is idle, with the promise of relinquishing control immediately upon demand. The typically high communic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular arithmetic using low order redundant bases

    Publication Year: 1997, Page(s):611 - 616
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    N-digit, radix-α bases are proposed for VLSI implementation of redundant arithmetic, mod m, where ⟨αNm=±1, ⟨αjm≠±1, for 0<j<N and m is prime. These bases simplify arithmetic overflow and are well suited to redundant arithmetic. The representations provide competitive, multiplierless T-point ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A search of minimal key functions for normal basis multipliers

    Publication Year: 1997, Page(s):588 - 592
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2m) depends on the key function for multiplication. Key functions with minimum complexity, called minimal key functions, are desirable. This paper investigates the complexity of a key function and reports search results of minimal key functions. A table of minimal key functions for m up to 31 is inclu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum-congestion hypergraph embedding in a cycle

    Publication Year: 1997, Page(s):600 - 602
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    The minimum-congestion hypergraph embedding in a cycle (MCHEC) problem is to embed the n edges in an m-vertex hypergraph as paths in a cycle on the same number of vertices, such that congestion-the maximum number of paths that use any single edge in the cycle-is minimized. The MCHEC problem has applications in electronic design automation and parallel computing. In this paper, it is proven that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Associative nets: a graph-based parallel computing model

    Publication Year: 1997, Page(s):558 - 571
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    This paper presents a new parallel computing model called Associative Nets. This model relies on basic primitives called associations that consist of applying an associative operator over connected components of a subgraph of the physical interprocessor connection graph. Associations can be very efficiently implemented (in terms of hardware cost or processing time) thanks to asynchronous computati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validated roundings of dot products by sticky accumulation

    Publication Year: 1997, Page(s):623 - 629
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    The dot product operation is very prevalent in scientific computation and has therefore been incorporated as a primitive operation in some languages. The implementation of the dot product operation by a sequence of IEEE standard multiplications and additions does not prevent a substantial accumulation of the round-off errors or warn the user about a catastrophic cancellation. We present the design... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective victim caching: a method to improve the performance of direct-mapped caches

    Publication Year: 1997, Page(s):603 - 610
    Cited by:  Papers (11)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi (1990) as an approach to improve the miss rate of direct-mapped caches without affecting their access time. This approach augments the direct-mapped main cache wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward optimal broadcast in a star graph using multiple spanning trees

    Publication Year: 1997, Page(s):593 - 599
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication in multicomputers with nonconvex faults

    Publication Year: 1997, Page(s):616 - 622
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    A technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described. This method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive and nonadaptive fault-tolerant routing alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skewed associativity improves program performance and enhances predictability

    Publication Year: 1997, Page(s):530 - 544
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Performance tuning becomes harder as computer technology advances. One of the factors is the increasing complexity of memory hierarchies. Most modern machines now use at least one level of cache memory. To reduce execution stalls, cache misses must be very low. Software techniques used to improve locality have been developed for numerical codes, such as loop blocking and copying. Unfortunately, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multirate VLSI arrays and their synthesis

    Publication Year: 1997, Page(s):515 - 529
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Many applications in signal and image processing can be efficiently implemented on regular VLSI architectures such as systolic arrays. Multirate arrays (MRAs) are an extension of systolic arrays where different data streams are propagated with different clocks. We address the analysis and synthesis problem for this class of architectures. We present a formal definition of MRAs, as systems of recur... 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