By Topic

IEEE Transactions on Computers

Issue 9 • Date Sept. 2001

Filter Results

Displaying Results 1 - 14 of 14
  • Editor's note

    Publication Year: 2001, Page(s):863 - 864
    Request permission for commercial reuse | PDF file iconPDF (356 KB) | HTML iconHTML
    Freely Available from IEEE
  • Deadlock-free oblivious wormhole routing with cyclic dependencies

    Publication Year: 2001, Page(s):865 - 876
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    A great deal of work has been done recently on developing techniques for proving deadlock freedom for wormhole routing algorithms. One approach has been to restrict the class of routing algorithms for which the proof technique applies. The other approach is to provide a generic method that can be applied to all routing algorithms. Although this latter approach offers clear advantages, a general te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst and best irredundant sum-of-products expressions

    Publication Year: 2001, Page(s):935 - 948
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    In an irredundant sum-of-products expression (ISOP), each product is a prime implicant (Pl) and no product can be deleted without changing the function. Among the ISOPs for some function f, a worst ISOP (WSOP) is an ISOP with the largest number of Pls and a minimum ISOP (MSOP) is one with the smallest number. We show a class of functions for which the Minato-Morreale ISOP algorithm produces WSOPs.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lookahead scheduling requests for multisize page caching

    Publication Year: 2001, Page(s):972 - 983
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    This paper studies the effects of reordering page requests for multisize page caching. First, we consider a “semi-online” model, where an input queue keeps requests which will be processed in the future. It is assumed that they arrive during the processing time of miss requests. We develop an efficient page replacement algorithm which shifts some page requests in the queue. Second, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new control circuit for asynchronous micropipelines

    Publication Year: 2001, Page(s):992 - 997
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB) | HTML iconHTML

    In this paper, we present a new configuration of an asynchronous micropipeline, called locally distributed asynchronous (LDA) micropipeline, using a new control circuit. The control circuit generates local control signals according to the 4-phase signaling protocol. The control circuit is used to control the dynamic logic in the datapath. Comparisons based on simulations with other earlier publish... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ADirpNB: a cost-effective way to implement full map directory-based cache coherence protocols

    Publication Year: 2001, Page(s):921 - 934
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1312 KB) | HTML iconHTML

    Directories have been used to maintain cache coherency in shared memory multiprocessors with private caches. The traditional full map directory tracks the exact caching status for each shared memory block and is designed to be efficient and simple. Unfortunately, the inherent directory size explosion makes it unsuitable for large-scale multiprocessors. In this paper, we propose a new directory sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling of hierarchical crossbar-based multicomputer systems

    Publication Year: 2001, Page(s):877 - 890
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1536 KB) | HTML iconHTML

    Crossbar networks have been widely used as the interconnection mechanism in many multiprocessor/multicomputer systems. Crossbar networks can be categorized into three major topological classes: full-crossbar networks, multistage interconnection networks (MINs), and networks consisting of multiple levels of full crossbar connections, called hierarchical crossbar interconnection networks (HCINs). A ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic multiple parity (DMP) disk array for serial transaction processing

    Publication Year: 2001, Page(s):949 - 959
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB) | HTML iconHTML

    The performance of today's database systems is usually limited by the speed of their I/O devices. Fast I/O systems can be built from an array of low cost disks working in parallel. This kind of disk architecture is called RAID (Redundant Arrays of Inexpensive Disks). RAID promises improvement over SLED (Single Large Expensive Disks) in performance, reliability, power consumption, and scalability. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A characterization of bent functions in terms of strongly regular graphs

    Publication Year: 2001, Page(s):984 - 985
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB) | HTML iconHTML

    In this paper, we prove that bent functions can be precisely characterized in terms of a special class of strongly regular graphs, thus providing a positive answer to a question raised in the paper by A. Bernasconi and B. Codenotti (1999) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rational interpolation examples in performance analysis

    Publication Year: 2001, Page(s):997 - 1003
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    The rational interpolation approach has been applied to performance analysis of computer systems previously. In this paper, we demonstrate the effectiveness of the rational interpolation technique in the analysis of randomized algorithms and the fault probability calculation for some real-time systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic neural computation. I. Computational elements

    Publication Year: 2001, Page(s):891 - 905
    Cited by:  Papers (126)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    This paper examines a number of stochastic computational elements employed in artificial neural networks, several of which are introduced for the first time, together with an analysis of their operation. We briefly include multiplication, squaring, addition, subtraction, and division circuits in both unipolar and bipolar formats, the principles of which are well-known, at least for unipolar signal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Longest fault-free paths in star graphs with edge faults

    Publication Year: 2001, Page(s):960 - 971
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    In this paper, we aim to embed longest fault-free paths in an n-dimensional star graph with edge faults. When n⩾6 and there are n-3 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices, exclusive of two exceptions in which at most two vertices are excluded. Since the star graph is regular of degree n-1, n-3 (edge faults) is maximal in the worst case. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCT implementation with distributed arithmetic

    Publication Year: 2001, Page(s):985 - 991
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    This paper presents an efficient method for implementing the Discrete Cosine Transform (DCT) with distributed arithmetic. While conventional approaches use the original DCT algorithm or the even-odd frequency decomposition of the DCT algorithm, the proposed architecture uses the recursive DCT algorithm and requires less area than the conventional approaches, regardless of the memory reduction tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic neural computation. II. Soft competitive learning

    Publication Year: 2001, Page(s):906 - 920
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    For pt. I see ibid., p.891-905. An investigation has been made into the use of stochastic arithmetic to implement an artificial neural network solution to a typical pattern recognition application. Optical character recognition is performed on very noisy characters in the E-13B MICR font. The artificial neural network is composed of two layers, the first layer being a set of soft competitive learn... 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