Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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
  • 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.
  • 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 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.
  • 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.
  • Parallelizing a global optimization method in a distributed-memory environment

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

    We present research into parallelizing the zone-parallel method of global optimization. The method belongs to the class of genetic algorithms and is briefly, described in the paper upon introduction to genetic algorithms, parallelization models for genetic algorithms are presented. The subsequent part of the paper is devoted to the global optimization problem of finding sources of tremors in coal ... 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 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.
  • Predictability of bulk synchronous programs using MPI

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

    The BSP cost model provides a general framework to design efficient and portable data-parallel algorithms. Execution costs of BSP programs are predicted combining a limited number of program and machine dependent parameters. BSP programs can be written using several programming tools. In this work we explore the predictability of bulk synchronous programs implemented with the Message Passing Inter... 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.
  • 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.
  • 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.
  • 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.
  • Performance and transparency of message passing and DSM services within the GENESIS operating system for managing parallelism on COWs

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

    The primary paradigm for building parallel applications for execution on clusters of workstations (COWs) can be generalised into message passing (MP) and distributed shared memory (DSM). Unfortunately the currently available run-time environments and operating systems do not provide satisfactory levels of transparency, management support, and only support either MP or DSM. We propose a unique and ... 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.
  • ViMPIOS, a “truly” portable MPI-IO implementation

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

    We present ViMPIOS, a novel MPI-IO implementation based on ViPIOS, the Vienna Parallel Input Output System. ViMPIOS inherits the defining characteristics of ViPIOS, which makes it a client-server based system focusing on cluster architectures. ViMPIOS stands out from all other MPI-IO implementations by its “truly” portable design, which allows not only applications to be transferred be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two management approaches of the split data cache in multiprocessor systems

    Publication Year: 2000, Page(s):301 - 308
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    As processor speed continues, the gap between the processor cycle and the memory subsystem cycle is expected to grow. One solution to this growing problem is to maximize the first level (LI) cache hit ratio, therefore the mean memory access time call decrease. Several studies have been made in order to manage more efficiently the LI data cache, both in uniprocessor and in multiprocessor systems. T... 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.
  • 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.
  • 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.
  • PVM application-level tuning over ATM

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

    The use of software packages that allow for distributed application computing is becoming more and more attractive due to the advent of high speed computer networks as well as of high performance general purpose workstations. Nevertheless it is well known that the success of cluster-based parallel computing depends on the performance of communication among processors, which in turn depends on the ... 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.
  • 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.