By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 4 • Date April 1996

Filter Results

Displaying Results 1 - 11 of 11
  • Parallel computing in networks of workstations with Paralex

    Publication Year: 1996 , Page(s): 371 - 384
    Cited by:  Papers (4)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2646 KB)  

    Modern distributed systems consisting of powerful workstations and high-speed interconnection networks are an economical alternative to special-purpose supercomputers. The technical issues that need to be addressed in exploiting the parallelism inherent in a distributed system include heterogeneity, high-latency communication, fault tolerance and dynamic load balancing. Current software systems fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid transformations: a new class of loop transformations for high-level synthesis and pipelined scheduling applications

    Publication Year: 1996 , Page(s): 399 - 410
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1556 KB)  

    In this paper we present a new class of loop optimizing transformations called valid transformations, which are suitable for fine-grain parallelization applications such as high-level synthesis of VLSI designs or compilers for super-scalar or VLIW machines. This class of transformations are different from existing ones in that valid transformations can be illegal. Nevertheless, if a transformation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using finite state automata to produce self-optimization and self-control

    Publication Year: 1996 , Page(s): 439 - 448
    Cited by:  Papers (15)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1384 KB)  

    A simple game provides a framework within which agents can spontaneously self-organize. In this paper, we present this game, and develop basic theory underlying a robust method for distributed coordination based on this game. This method makes use of finite state automata-one associated with each agent-which guide the agents. We give a new, general method of analysis of these systems, which previo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation in cube network systems based on the covering radius

    Publication Year: 1996 , Page(s): 328 - 342
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1324 KB)  

    When multiple copies of a certain resource exist in a cube network system, it is desirable that every nonresource node can reach the resource in a given number of hops. In this paper, we introduce systematic approaches to resource allocation in a cube system so that each nonresource node is connected with a specified number of resource copies and that the allocation performance measure of interest... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two ranking schemes for efficient computation on the star interconnection network

    Publication Year: 1996 , Page(s): 321 - 327
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (768 KB)  

    A node ranking scheme provides the necessary structural view for developing algorithms on a network. We present two ranking schemes for the star interconnection network both of which allow constant time order preserving communication. The first scheme is based on a hierarchical view of the star network. It enables one to efficiently implement order preserving ASCEND/DESCEND class of algorithms. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized routing with shorter paths

    Publication Year: 1996 , Page(s): 356 - 362
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (960 KB)  

    Studies the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break “spatial locality”, within each permutation, only log log N additional randomizing stages are needed to break “temporal locality” among successive permutations. Thus, log N bits of initial randomization per input, followed by log log N bits of randomiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient optimal reconfiguration algorithm for FDDI-based networks

    Publication Year: 1996 , Page(s): 411 - 424
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2000 KB)  

    We study a new network architecture based on standard FDDI networks. This network, called FDDI-based reconfigurable network (FBRN), is constructed using multiple FDDI token rings and has the ability to reconfigure itself in the event of extensive damage to the network. Thus, an FBRN has the potential to provide high available bandwidth even in the presence of numerous faults. Realization of this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of hardware-based stride and sequential prefetching in shared-memory multiprocessors

    Publication Year: 1996 , Page(s): 385 - 398
    Cited by:  Papers (20)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2252 KB)  

    We study the efficiency of previously proposed stride and sequential prefetching-two promising hardware-based prefetching schemes to reduce read-miss penalties in shared-memory multiprocessors. Although stride accesses dominate in four out of six of the applications we study, we find that sequential prefetching does as well as and in same cases even better than stride prefetching for five applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrix partitioning on a virtual shared memory parallel machine

    Publication Year: 1996 , Page(s): 343 - 355
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1484 KB)  

    The general problem considered in the paper is partitioning of a matrix operation between processors of a parallel system in an optimum load-balanced way without potential memory contention. The considered parallel system is defined by several features the main of which is availability of a virtual shared memory divided into segments. If partitioning of a matrix operation causes parallel access to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous analysis of parallel dynamic programming algorithms

    Publication Year: 1996 , Page(s): 425 - 438
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1984 KB)  

    We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the effects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze two... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On general results for all-to-all broadcast

    Publication Year: 1996 , Page(s): 363 - 370
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1056 KB)  

    All-to-all broadcast refers to the process by which every node broadcasts its certain piece of information to all other nodes in the system. In this paper, we develop all-to-all broadcast schemes by dealing with two classes of schemes. A prior scheme based on generation of minimal complete sets is first described, and then a new scheme based on propagation of experts is developed. The former alway... 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.

Full Aims & Scope

Meet Our Editors

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