Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing

19-21 Jan. 2000

Filter Results

Displaying Results 1 - 25 of 54
  • Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2000, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (195 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 2000, Page(s):415 - 416
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Scalability analysis of parallel systems with multiple components of work

    Publication Year: 2000, Page(s):182 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    The generic fixed-value efficiency (FVE) method is proposed in order to study the scalability of parallel algorithms with multiple components of work. The generic FVE method is based on the isoefficiency method. Unlike isoefficiency, however, this method may be applied to parallel algorithm-machine combinations (parallel systems) where the relationship between the total work and its components is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security mechanisms for the MAP agent system

    Publication Year: 2000, Page(s):84 - 91
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Mobile agents represent a new communication paradigm which has recently obtained a great deal of attention from researchers and practitioners. Interesting applications exist in the fields of distributed systems management, mobility and information retrieval. Although widely recognized as a crucial point to be addressed, security has not been pursued in a satisfactory way yet. Most of all the exist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-similarity in SPLASH-2 workloads on shared memory multiprocessors systems

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

    The workload used for evaluating and obtaining performance results in shared memory multiprocessors are widely heterogeneous. Traces have been used over several decades and as computers systems grew in power, semantic benchmarks, like SPLASH2, became the most common workloads. Unfortunately, few benchmarks are available. Recently, self-similar studies have been performed in several computer domain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed and randomized enumeration

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

    The paper describes a randomized distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. The algorithm correctness and efficiency are considered. The expected execution time is of the order of the time needed for a broadcast View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling message-passing programs for static mapping

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

    An efficient mapping of a parallel program in the processors is vital for achieving a high performance on a parallel computer. When the structure of the parallel program in terms of its task execution times, task dependencies, and amount communication data, is known a priori, mapping can be accomplished statically at compile time. Mapping algorithms start from a parallel application model and map ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards efficient BSP implementations of BSR programs for some computational geometry problems

    Publication Year: 2000, Page(s):357 - 364
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    In this paper we present our investigations to implement some computational geometry problems (point in a polygon, intersection problem, convex hull) under the framework of BSR (Broadcasting with Selective Reduction) model of parallel computing, then under the framework of BSP (Bulk Synchronous Parallel Model) programs. BSR is a (theoretical) model with the capabilities of PRAM models augmented wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study of trace-driven simulation for analyzing interconnection networks: cc-NUMAs with ILP processors

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

    The evaluation of network performance under real application loads is carried out by detailed time-intensive and resource-intensive simulations. Moreover, the use of ILP (instruction-level parallel) processors in cc-NUMA (cache-coherent non-uniform memory access) architectures introduces non-deterministic memory accesses; the resulting parallel system must be modeled by a detailed execution-driven... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards reference architectures for distributed groupware applications

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

    Standard groupware products do not fulfill the specific requirements of various application areas, due to technical restrictions, lack of flexibility or non-availability of adapted interfaces. In view of this situation, development of groupware products for specialized application areas will continue to be necessary. Our approach is to support this kind of software development project by providing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First steps in metacomputing with Amica

    Publication Year: 2000, Page(s):197 - 204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    The metacomputing system Amica is a new approach to support the development of coarse-grained applications for distributed dynamic heterogeneous systems (e.g. computers linked to the Internet). It aims at the location-transparent and convenient design of distributed applications and at the easy integration of legacy systems. Applications are described in the form of application graphs based on a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replicating the R in URL

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

    The Web supports access to a very wide variety of services and objects via the simple naming mechanism provided by the Uniform Resource Locator or URL. When resources are read-only entities, which is still the common case, there is little problem in returning their output to clients in the face of multiple concurrent accesses. However, the Web is increasingly being adopted as the front-end for dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Groups in bulk synchronous parallel computing

    Publication Year: 2000, Page(s):244 - 251
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    An extension to the Bulk Synchronous Parallel Model (BSP) to allow the use of asynchronous BSP groups of processors is presented. In this model, called Nested BSP, processor groups can be divided and processors in a group synchronize through group dependent collective operations generalizing the concept of barrier synchronization. A classification of problems and algorithms attending to their para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating structured program instances with a high degree of locality

    Publication Year: 2000, Page(s):267 - 274
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    Memory hierarchy-consciousness is an important requirement for the design of high-performance programs. We describe a tool that supports the programmer in restructuring performance-critical code sections. The tool works with small program instances, which are obtained by fixing program parameters such as loop bounds, and rewriting the program as an operation sequence. The tool automatically reorde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The parallel cellular programming model

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

    We present a synchronous parallel programming model designed for massively parallel fine grained applications such as cellular automata, finite element methods or partial differential equations. In this model we assume that the number of parallel processes in a program is much larger than the number of processors of the machine on which it is run. We present the computational model and the communi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite element computations on cluster of PCs and workstations

    Publication Year: 2000, Page(s):56 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In the last decade distributed processing on clusters of PCs and workstations have become a popular alternative way for parallel computations due to their low cost compared to parallel supercomputers. The most important factor that limits the parallel efficiency of an algorithm running on a cluster is the low bandwidth and high latency of the network that interconnects the computers. Specially des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency requirements of distributed shared memory for Lamport's bakery algorithm for mutual exclusion

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

    As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes. An application of weaker consistency models (e.g. causal, processor, PRAM), available in replicated distributed shared memory (DSM) systems appealing due to possible performance improvement may imply incorrectness of the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-D wavelet packet decomposition on multicomputers

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

    In this work we describe and analyze algorithms for 2-D wavelet packet decomposition for MIMD distributed memory architectures. The main goal is the generalization of former parallel WP algorithms which are constrained to a number of processor elements equal to a power of 4. We discuss several optimizations and generalizations of data parallel message passing algorithms and finally compare the res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The TIRAN approach to reusing software implemented fault tolerance

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

    Available solutions for fault tolerance in embedded automation are often based on strong customisation, have impacts on the whole life-cycle, and require highly specialised design teams, thus making dependable embedded systems costly and difficult to develop and maintain. The TIRAN project develops a framework which provides fault tolerance capabilities to automation systems, with the goal of allo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PQE HPF-a library for exploiting the capabilities of a PQE-1 heterogeneous parallel architecture

    Publication Year: 2000, Page(s):166 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Heterogeneous computing is a special form of parallel and distributed computing where computations are performed using a single autonomous computer operating in both SIMD and MIMD modes, or using a number of connected autonomous computers. In multimode system heterogeneous computing, tasks can be executed in both SIMD and MIMD simultaneously. In this paper, we present PQE HPF, a High Performance F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gypsy: a component-based mobile agent system

    Publication Year: 2000, Page(s):126 - 134
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Gypsy is a component-based, dynamically extensible environment for mobile agent systems. The runtime environment consists of lightweight servers that provide a distributed execution environment for agents, and a remote administration tool that supports the set-up and shutdown of servers and agents. A server hosts a number of places to which agents may move to execute their functions. Each place is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures

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

    The most important issue in sequential program parallelisation is the efficient assignment of computations into different processing elements. In the past, too many approaches were devoted in efficient program parallelization considering various models for the parallel programs and the target architectures. The most widely used parallelism description model is the task graph model with precedence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast parallel algorithms for 3D reconstruction of angiographic images

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

    The reconstruction of angiographic images can be seen as a discrete optimization problem where a blind search is not suitable. A branch-and-bound algorithm can be used to explore the space state using a priori information. The critical issue in parallel search algorithms is the distribution of the search space among the processors. We work with two control schemes: centralized and distributed. Acc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification for reactive bulk-synchronous programming

    Publication Year: 2000, Page(s):190 - 196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    Extends bulk-synchronous programming (BSP) to incorporate reactive (i.e. non-terminating) programming. We propose a semantic model for BSP which allows a process to have infinitely many supersteps. The semantics reveals the essential difference between BSP and sequential specifications. Based on the model, a specification language, called the Super-Step Specification (SSS) language, is proposed to... View full abstract»

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