Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000

1-5 May 2000

Filter Results

Displaying Results 1 - 25 of 108
  • Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (450 KB)
    Freely Available from IEEE
  • Panel on top 10 most influential parallel and distributed processing concepts in the last millennium

    Publication Year: 2000, Page(s):289 - 294
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2000, Page(s):839 - 842
    Request permission for commercial reuse | PDF file iconPDF (15 KB)
    Freely Available from IEEE
  • Effective load sharing on heterogeneous networks of workstations

    Publication Year: 2000, Page(s):431 - 438
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We consider networks of workstations which are not only time-sharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workstations. Many load sharing schemes mainly target sharing CPU resources, and have been intensively evaluated in homogeneous distributed environments. However the penalties of data accesses and movement in modern computer s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image layer decomposition for distributed real-time rendering on clusters

    Publication Year: 2000, Page(s):421 - 428
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    We propose a novel work partitioning technique, image layer decomposition (ILD), designed specifically to support distributed real-time rendering on commodity clusters. ILD has several advantages over previous partitioning algorithms for our targeted environment, including its compatibility with the use of hardware graphics accelerators, decoupling of communication bandwidth requirement from scene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using available remote memory dynamically for parallel data mining application on ATM-connected PC cluster

    Publication Year: 2000, Page(s):411 - 420
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Personal computer/Workstation (PC/WS) clusters are promising candidates for future high performance computers, because of their good scalability and cost performance ratio. Data intensive applications, such as data mining and ad hoc query processing in databases, are considered very important for massively parallel processors, as well as conventional scientific calculations. Thus, investigating th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing retrieval and processing of multi-dimensional scientific datasets

    Publication Year: 2000, Page(s):405 - 410
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    We have developed the Active Data Repository (ADR), an infrastructure that integrates storage, retrieval, and processing of large multi-dimensional scientific datasets on distributed memory parallel machines with multiple disks attached to each node. In earlier work, we proposed three strategies for processing range queries within the ADR framework. Our experimental results show that the relative ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting multisets in anonymous rings

    Publication Year: 2000, Page(s):275 - 280
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    An anonymous ring network is a ring where all processors (vertices) are totally indistinguishable except for their input value. Initially, to each vertex of the ring is associated a value from a totally ordered set; thus, forming a multiset. In this paper we consider the problem of sorting such a distributed multiset and we investigate its relationship with the election problem. We focus on the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Lagrange interpolation on the star graph

    Publication Year: 2000, Page(s):777 - 782
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    This paper introduces a parallel algorithm for computing an N=n!-point Lagrange interpolation on an n-star (n>2). It exploits several communication techniques on stars in a novel way which can be adapted for computing similar functions. The algorithm is optimal and consists of three phases: initialization, main and final. While there is no computation in the initialization phase, the main phase... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded-response-time self-stabilizing OPS5 production systems

    Publication Year: 2000, Page(s):399 - 404
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    This paper examines the task of constructing bounded-time self-stabilizing rule-based systems that take their input from an external environment. Bounded response-time and self-stabilization are essential for rule-based programs that must be highly fault-tolerant and perform in a real-time environment. We present an approach for solving this problem using the OPS5 programming language as it is one... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting on the OTIS-mesh

    Publication Year: 2000, Page(s):269 - 274
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-mesh, a network with diameter 4√N-3 consisting of N connected meshes of size √N×√N. We show that k-k sorting can be done in 8√N+O(N1/3) steps for k=1, 2, 3, 4 and in 2k√N+O(kN1/3) steps for k>4 with constant buffer-size for all k. We show ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • De Bruijn isomorphisms and free space optical networks

    Publication Year: 2000, Page(s):769 - 774
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The de Bruijn digraph B(d, D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed. In this paper we show that any digraph defined on words and alphabets of the same size, through an arbitrary permutation on the alphabet and an arbitrary permutation on the word indices, is isomorphic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VisOK: a flexible visualization system for distributed Java object application

    Publication Year: 2000, Page(s):393 - 398
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    Distributed object systems are known to be very complex. Consequently it is very difficult, if not impossible, to see the overall relationship among participating objects in the system. That complicates the issues connected with performance tuning and maintenance. An economical way to visualize the system is clearly needed. In this paper, we propose a tracing facility for Java-based distributed ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skiplist-based concurrent priority queues

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

    This paper addresses the problem of designing scalable concurrent priority queues for large scale multiprocessors machines with up to several hundred processors. Priority queues are fundamental in the design of modern multiprocessor algorithms, with many classical applications ranging from numerical algorithms through discrete event simulation and expert systems. While highly scalable approaches h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelengths requirement for permutation routing in all-optical multistage interconnection networks

    Publication Year: 2000, Page(s):761 - 768
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and switches, one approach is to assign the wavelengths to the communication paths so that the paths which receive the same wavelength are node-disjoint. Our goal is to minimize the number of wavelengths required for permut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision-process analysis of implicit coscheduling

    Publication Year: 2000, Page(s):115 - 120
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    This paper presents a theoretical framework based on Bayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilistic modeling, We show that the approach presented can be applied for processes with arbitrary communication mixes. We also note that our approach can be used for deciding the additional s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PaDDMAS: parallel and distributed data mining application suite

    Publication Year: 2000, Page(s):387 - 392
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algorithms are employed to perform data analysis within a domain, and range from statistical to machine learning and AI based techniques. Several issues need to be addressed however to scale such approaches to large data sets, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiency of dynamic load balancing based on permanent cells for parallel molecular dynamics simulation

    Publication Year: 2000, Page(s):85 - 92
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    This paper addresses a dynamic load balancing method of domain decomposition for 3-dimensional molecular dynamics on parallel computers. In order to reduce interprocessor communication overhead, we are introducing a concept of permanent cells to the dynamic load balancing method. Molecular dynamics simulations on a parallel computer T3E prove that the proposed method using load balancing much impr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sorting an intransitive total ordered set using semi-heap

    Publication Year: 2000, Page(s):257 - 262
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering for any intransitive total ordered set. A new data structure called semi-heap is proposed to construct an optimal Θ(n log n) sorting algorithm. Finally, we propose a cost-optimal parallel algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed models and algorithms for survivability in network routing

    Publication Year: 2000, Page(s):359 - 364
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    We introduce a natural distributed model for analyzing the survivability of distributed networks and network routing schemes based on considering the effects of local constraints on network connectivity. We investigate the computational consequences of two fundamental interpretations of the meaning of local constraints. We consider a full-duplex model in which constraints are applied to edges of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing traffic load for multi-node multicast in a wormhole 2D torus/mesh

    Publication Year: 2000, Page(s):611 - 616
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1428 KB)

    This paper considers the multi-node multicast problem in a wormhole-routed 20 torus/mesh, where an arbitrary number of source nodes each intending to multicast a message to an arbitrary, set of destinations. To resolve the contention and the congestion problems, we propose to partition the network into subnetworks to distribute, and thus balance, the traffic load among all network links. Several w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal all-to-all personalized exchange in a class of optical multistage networks

    Publication Year: 2000, Page(s):753 - 760
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting in hypercubes in the circuit switched model

    Publication Year: 2000, Page(s):21 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    In this paper we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, Δ-port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gang scheduling with memory considerations

    Publication Year: 2000, Page(s):109 - 114
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting hierarchy in parallel computer networks to optimize collective operation performance

    Publication Year: 2000, Page(s):377 - 384
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    The efficient implementation of collective communication operations has received much attention. Initial efforts modeled network communication and produced “optimal” trees based on those models. However, the models used by these initial efforts assumed equal point-to-point latencies between any two processes. This assumption is violated in heterogeneous systems such as clusters of SMPs... View full abstract»

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