By Topic

IEEE Transactions on Computers

Issue 3 • Date Mar 1991

Filter Results

Displaying Results 1 - 16 of 16
  • A decomposition procedure for the analysis of a closed fork/join queueing system

    Publication Year: 1991, Page(s):365 - 370
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    An iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. The iterative procedure converges to the exact soluti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of single stage interconnection networks

    Publication Year: 1991, Page(s):357 - 365
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    A single-stage interconnection network (SSIN) consisting of only one stage of switches and recirculation through processors is studied. An analytical probability model for SSINs using 2×2 switches is introduced, and results obtained with the model are compared with simulation results. Four SSINs with different network sizes, loading, and routing strategies are discussed. Processors with and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved algorithms for mapping pipelined and parallel computations

    Publication Year: 1991, Page(s):295 - 306
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of packet-switched multiple-bus multiprocessor systems

    Publication Year: 1991, Page(s):352 - 357
    Cited by:  Papers (9)  |  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Performance analyses of packet-switched multiple-bus multiprocessor systems are presented. Approximate queuing network models are developed for both synchronous and asynchronous control schemes, and the results are shown to be in good agreement with simulation results. The analysis of the synchronous system is based on a decomposition technique, with each of the shared resources in the system bein... View full abstract»

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

    Publication Year: 1991, Page(s):284 - 294
    Cited by:  Papers (81)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and is guaranteed not to create any traffic-conge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subcube allocation in hypercube computers

    Publication Year: 1991, Page(s):341 - 352
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB)

    A precise characterization of the subcube allocation problem and a general methodology to solve it are presented. Subcube allocation and coalescing algorithms that have the goal of minimizing fragmentation are developed. The concept of a maximal set of subcubes (MSS), which is useful in making allocations that result in a tightly packed hypercube, is introduced. The problems of allocating subcubes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of the ISO transport protocol

    Publication Year: 1991, Page(s):253 - 262
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    The performance of different implementations of the ISO transport protocol class 4 on top of a connectionless link-layer protocol in the presence of transmission errors is studied by means of simulation. A main goal of the study is to find robust protocol versions yielding good performance for all possible combinations of implementations. The performance measure investigated is the throughput that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic technique for processor and link assignment in multicomputers

    Publication Year: 1991, Page(s):325 - 333
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    A graph-based solution to the mapping problem using the simulated annealing optimization heuristic is developed. An automated two-phase mapping strategy is formulated: process annealing assigns parallel processes to processing nodes, and connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized. To evaluate the quality of ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict-free vector access using a dynamic storage scheme

    Publication Year: 1991, Page(s):276 - 283
    Cited by:  Papers (30)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    An approach whereby conflict-free access of any constant stride can be made by selecting a storage scheme for each vector based on the accessing patterns used with that vector is considered. By factoring the stride into two components, one a power of 2 and the other relatively prime to 2, a storage scheme that allows conflict-free access to the vector using the specified stride can be synthesized.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal scheduling of signature analysis for VLSI testing

    Publication Year: 1991, Page(s):336 - 341
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    A simple algorithm that shows how to optimally schedule the test-application and the signature-analysis phases of VLSI testing is presented. The testing process is broken into subintervals, the signature is analyzed at the end of each subinterval, and future tests are aborted if the circuit is found to be faulty, thus saving test time. The mathematical proofs associated with the algorithm are give... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The expected (not worst-case) throughput of the Ethernet protocol

    Publication Year: 1991, Page(s):245 - 252
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The Ethernet protocol is analyzed using a space-time model in which the occurrence of a collision is determined not only by frame arrival times but also by locations of nodes. The space-time model is described, and the expected throughput of the Ethernet protocol is derived assuming that frames arrive by a Poisson process. Numerical results show that the expected throughput can be significantly hi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic spectrum applied to fault detection for combinational networks

    Publication Year: 1991, Page(s):320 - 324
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A method for the derivation of fault signatures for the detection of faults in single-output combinational networks is described. The approach uses the arithmetic spectrum instead of the Rademacher-Walsh spectrum. It is a form of data compression that serves to reduce the volume of the response data at test time. The price which is paid for the reduction in the storage requirements is that some of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization of min-cut partitioning to tree structures and its applications

    Publication Year: 1991, Page(s):307 - 314
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    A generalization of the min-cut partitioning problem, called min-cost tree partitioning, is introduced. In the generalized problem. the nodes of a hypergraph G are to be mapped onto the vertices of a tree structure T, and the cost function to be minimized is the cost of routing the hyperedges of G on the edges of T . The standard min-cut problem is the simple ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A special function unit for database operations (SFU-DB): design and performance evaluation

    Publication Year: 1991, Page(s):263 - 275
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    The design and analysis of a special function unit for database operations (SFU-DB) that uses a novel hardware sorting module, the automatic retrieval memory (ARM), are described. The SFU-DB is a functionally independent unit that efficiently performs certain nonnumeric operations. It can function as a coprocessor for a host CPU or as a special processing unit in a highly parallel processing syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stabilized parallel algorithm for direct-form recursive filters

    Publication Year: 1991, Page(s):333 - 336
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A stabilized parallel algorithm for direct-form recursive filters is obtained, using a method of derivation in the Z domain. The degree of parallelism, stability, and complexity of the algorithm is examined. It is shown how to reduce the number of multiplications compared to the number required in a naive implementation. The algorithm is regular and modular, so very efficient VLSI architectures ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing storage efficient decision trees

    Publication Year: 1991, Page(s):315 - 320
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The problem of designing storage-efficient decision trees from decision tables is examined. It is shown that for most cases, the construction of the storage optimal decision tree is an NP-complete problem, and therefore a heuristic approach to the problem is necessary. A systematic procedure analogous to the information-theoretic heuristic is developed. The algorithm has low computational complexi... 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