By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • Date Mar 1997

Filter Results

Displaying Results 1 - 8 of 8
  • Heuristics for scheduling I/O operations

    Publication Year: 1997, Page(s):310 - 320
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2436 KB)

    The I/O bottleneck in parallel computer systems has recently begun receiving increasing interest. Most attention has focused on improving the performance of I/O devices using fairly low level parallelism in techniques such as disk striping and interleaving. Widely applicable solutions, however, will require an integrated approach which addresses the problem at multiple system levels, including app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressionless routing: a framework for adaptive and fault-tolerant routing

    Publication Year: 1997, Page(s):229 - 244
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Compressionless routing (CR) is an adaptive routing framework which provides a unified framework for efficient deadlock free adaptive routing and fault tolerance. CR exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. Fault tolerant compressionless routing (FCR) extends CR to support end to end fault tolerant delivery. Det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic crash recovery without changing application messages

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

    We present an optimistic crash recovery technique without any communication overhead during normal operations of the distributed system. Our technique does not append any information to the application messages, it does not suffer from the domino effect, and each processor rolls back at most once during recovery. We present three distributed rollback algorithms, their complexities, and correctness... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel computer vision on a reconfigurable multiprocessor network

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

    A novel reconfigurable architecture based on a multiring multiprocessor network is described. The reconfigurability of the architecture is shown to result in a low network diameter and also a low degree of connectivity for each node in the network. The mathematical properties of the network topology and the hardware for the reconfiguration switch are described. Primitive parallel operations on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable multibus configuration for connecting transputer links

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

    The paper presents the development and the performance of a novel bus based message passing interconnection scheme which can be used to join a large number of INMOS transputers via their serial communication links. The main feature of this architecture is that it avoids the communication overhead which occurs in systems where processing nodes relay communications to their neighbors. It also produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

    Publication Year: 1997, Page(s):272 - 284
    Cited by:  Papers (89)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Real time systems are being increasingly used in several applications which are time critical in nature. Fault tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. We study a scheme that provides fault tolerance through scheduling in real time multiprocessor systems. We schedule multiple copies of dynamic, aperiodic, nonpreemptive ta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal wormhole routing

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

    We examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+dη log P) time with high probability, where L is the number of flits in a packet, and η=min {d, L}; only a constant number of flit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On routing maskable messages in hypercube-derived multistage interconnection networks

    Publication Year: 1997, Page(s):285 - 291
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A vast number of message patterns can be represented by (s d) masks. We consider the problem of routing maskable messages in the hypercube derived multistage interconnection networks. Network contention is settled by delivering conflicting data in different network cycles. We propose an indirect, two phase routing strategy which is optimal within two network cycles. For (... View full abstract»

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

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology