By Topic

Parallel and Distributed Processing, 2000. Proceedings. 8th Euromicro Workshop on

Date 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.
  • 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.
  • 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.
  • Communication support for distributed multimedia components

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

    The development of distributed multimedia applications has always been a challenge for both expert and nonexpert developers. Middleware and supporting frameworks have emerged to simplify this process by providing reusable components that can be plugged together in many configurations to help application developers building up their applications. In distributed multimedia, the adoption of such fram... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for process migration in software DSM environments

    Publication Year: 2000, Page(s):158 - 165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Proves that process migration can successfully be implemented for software distributed shared memory (DSM) environments. We have developed a migration framework that is able to transparently migrate DSM processes, thereby preserving the consistency of running applications. The migration framework is integrated into the CORAL (Cooperative Online monitoRing Actions Layer) system, an online monitorin... 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.
  • Using agent wills to provide fault-tolerance in distributed shared memory systems

    Publication Year: 2000, Page(s):317 - 324
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In this paper we describe how we use mobile objects to provide distributed programs coordinating through a persistent distributed shared memory (DSM) with tolerance to sudden agent failure, and use the increasingly popular Linda-like tuple space languages as an example for implementation of the concept. In programs coordinating and communicating through a DSM a data structure is shared between mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel simulated annealing for the set-partitioning problem

    Publication Year: 2000, Page(s):343 - 350
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FINESSE: a prototype feedback-guided performance enhancement system

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

    FINESSE is a prototype environment designed to support rapid development of parallel programs for single-address space computers by both expert and non-expert programmers. The environment provides semi-automatic support for systematic, feedback-based reduction of the various classes of overhead associated with parallel execution. The characterisation of parallel performance by overhead analysis is... 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.
  • A QoS performance measure framework for distributed heterogeneous networks

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

    In a distributed heterogeneous computing environment, users' tasks are allocated resources to simultaneously satisfy, to varying degrees, the tasks' different, and possibly conflicting, quality of service (QoS) requirements. When the total demand placed on system resources by the tasks, for a given interval of time, exceeds the resources available, some tasks will receive degraded service or no se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tailoring a self-distributing architecture to a cluster computer environment

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

    This paper analyzes the consequences of existing network structure for the design of a protocol for a radical COMA (Cache Only Memory Architecture). Parallel computing today faces two significant challenges: the difficulty of programming and the need to leverage existing “off-the-shelf” hardware. The difficulty of programming parallel computers can be split into two problems: distribut... 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.
  • Evaluation of a virtual shared memory machine by the compilation of data parallel loops

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

    We introduce DVSA, distributed virtual shared areas, a virtual machine supporting the sharing of information on distributed memory architectures. The shared memory is structured as a set of areas where the size of each area may be chosen in all architecture dependent range. DVSA supports the sharing of areas rather than of variables because the exchange of chunks of data may result in better perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining low-latency communication protocols with multithreading for high performance DSM systems on clusters

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

    With the development of clusters based on high performance networks, it is now possible to design efficient Distributed Shared Memory systems. In this paper we present the approach we choose to implement a high performance DSM system on top of a cluster by combining the use of low-latency communication protocols (MPI-BIP on Myrinet networks) with multithreading approach (PM2). We present our appro... 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.
  • Implementation of an annotation service on the WWW-Virtual Notes

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

    We present the implementation of Virtual Notes, an annotation service on the World Wide Web using only standard Internet technology. Therefore Virtual Notes are immediately usable by anyone on the WWW without preparation. This makes the solution especially suited for environments lacking a coherent workgroup, e.g. teaching or research. Also described are the user interface, several use cases and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reusable message passing components

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

    Reusability of executables is an integral part in the design and implementation of message passing programs, as from the same executable component a number of interacting processes are spawned. In practice, reuse of executables within an application is usually achieved when processes execute within a specific regular topology and within a specific message passing environment (e.g. PVM, MPI). We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming with data driven model

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

    In this paper, bye present a new powerful method for parallel program representation called Data Driven Graph (DDG). DDG takes all advantages of classical Directed Acyclic graph (DAC) and adds much more. Simple definition, flexibility and ability to represent loops and dynamically created tasks. With DDG, scheduling becomes an efficient tool for increasing performance of parallel systems. DDG is n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust multigrid solver on parallel computers

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

    In this paper two well-known robust multigrid solvers for anisotropic operators on structured grids are compared: alternating-plane smoothers with full coarsening and plane smoothers combined with semicoarsening. The study takes into account not only numerical properties but also architectural ones, focusing on cache memory exploitation and parallel characteristics. Experimental results for the se... 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.
  • Specification-driven monitoring of TCP/IP

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

    Specification-driven monitoring is a novel technique for systematically analyzing the functional and temporal behavior of a system starting from specification to the implementation with the help of monitoring. This paper briefly shows the method and the tools belonging to it. The main part comprises a measurement study of a TCP/IP protocol stack fully specified in SDL. This study shows, how the TC... View full abstract»

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