By Topic

Parallel and Distributed Processing, 1999. PDP '99. Proceedings of the Seventh Euromicro Workshop on

Date 3-5 Feb. 1999

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (257 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1999, Page(s):381 - 382
    Request permission for commercial reuse | PDF file iconPDF (193 KB)
    Freely Available from IEEE
  • Support for tailoring CSCW systems: adaptation by composition

    Publication Year: 1999, Page(s):146 - 152
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    In the last few years it has been realized that flexibility and tailorability are key requirements for software systems in general and for CSCW (Computer Supported Cooperative Work) systems in particular. An important mechanism for providing tailorability is the creation of compound functionality by the composition of specialized modules. In this paper we identify two variants of this composition ... View full abstract»

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

    Publication Year: 1999, Page(s):19 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    The parallel computing model presented in this paper, the Collective Computing model (CCM), is an improvement of the well-known Bulk Synchronous Parallel (BSP) model. The synchronicity imposed by the BSP model restricts the set of available algorithms and prevents the overlapping of computation and communication. Other models, like the LogP model, allow asynchronous computing and overlapping but d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A RAID reconfiguration scheme for gracefully degraded operations

    Publication Year: 1999, Page(s):66 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    One distinct advantage of Redundant Array of Independent Disks (RAID) is fault tolerance. But the performance of a disk array in degraded mode is so poor that no one uses the RAID after failure. Continuous operation of RAID in degraded mode is very important in many real time applications, which can not be interrupted in providing continuous services. In this paper, we propose an efficient archite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing a common time reference in a heterogeneous distributed system

    Publication Year: 1999, Page(s):359 - 366
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    This article introduces SYD, a tool for the generation of time-stamps synchronized with the Universal Time Coordinate: the implementation includes an NTP client and is written in Java. Possible applications include (but are not limited to) the measurement of the performance of distributed applications, their debugging, and the implementation of real-time requirements in distributed systems. The fe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load adaption in LIPS

    Publication Year: 1999, Page(s):374 - 379
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    LIPS is a system for distributed computing using idle-cycles in heterogeneous networks of workstations. Especially data- and compute-intensive applications in the field of cryptography and computer algebra have used the system. The system provides its user with the tuple space based generative communication paradigm of parallel computing as known from the coordination language LINDA. In LIPS, fail... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An atmosphere-ocean forecast system on a hybrid architecture

    Publication Year: 1999, Page(s):309 - 314
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    An operational forecast system is being developed at ENEA, which consists of a high resolution meteorological limited area model coupled with ocean models for the prediction of the state of the Mediterranean Sea and of high water events in the Venice Lagoon. In order to satisfy the operational requirement (3-days forecasts in a few hours) a very effective two level parallelization strategy was ado... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel processor for neural networks

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

    We present two different algorithms implemented through neural networks on a multiprocessor device. The parallel single-chip TI TMS32C80 Multimedia Video Processor (MVP). The goal of this experimentation is to test, on real problems, the performance of this powerful unit made up by one Master Risc Processor and by four Slave Digital Signal Processors (DSPs) and to evaluate its suitability to neura... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing network throughput: optimal versus robust design

    Publication Year: 1999, Page(s):45 - 52
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Interconnection network performance is usually measured in terms of its latency (time required to deliver a message) and throughput (maximum traffic accepted by the network). At first glance, minimizing average message latency is the main designer goal, because average network traffic is usually far from saturation. However, applications can also generate very high peak traffic. In order to deal w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ρ: hierarchical modeling of parallel architectures

    Publication Year: 1999, Page(s):233 - 240
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Although there exist many approaches for classification of computer architectures, no system is able to distinguish parallel computers adequately yet. The first part of this paper is a brief survey of the main characteristics of various parallel architecture concepts and several approaches of classification. We realized that the idea of defining a sharp classification system is questionable in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling advanced modular avionics architectures for early real-time performance analysis

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

    Behavioral simulation including the impact of architectural choices is required to help the designer in reducing design ambiguities and errors of embedded complex systems which are distributed (for performance and reliability requirements) and present hard real-time features (time critical avionics functions), as early in the product life cycle as possible. This paper presents a modeling and simul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance optimisations of the NPB FT kernel by special-purpose unroller

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

    The fast Fourier transform (FFT) is the cornerstone of many supercomputer applications and therefore needs careful performance tuning. Most often, however the real performance of the FFT implementations is far below the acceptable figures. In this paper we explore several strategies for performance optimisations of the FFT computation, such as enhancing instruction-level parallelism, loop merging,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling tasks with communication delays on a two-levels virtual distributed system

    Publication Year: 1999, Page(s):344 - 348
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    A set of tasks has to be scheduled on the parallel identical processors of the clusters of a two-levels distributed memory multiprocessor, subject to precedence constraints and small intra-cluster communication delays. The architecture model includes network of shared memory multiprocessors. In this paper, we present a new critical-path like algorithm that finds an optimal solution to this new pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New dimensions in distributed journalism through Dragon Slayer III

    Publication Year: 1999, Page(s):112 - 118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    In a journalistic scenario new dimensions of cooperative feature writing are described. In order to compose a highly up-to-date article on economic events with global uses and consequences under the tight time constraints of a daily newspaper by utilizing the geographic competence of correspondents and economic or political experts, their latest observations and views (in contrast to heavily using... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DeHiFo-an advanced HPF debugging system

    Publication Year: 1999, Page(s):226 - 232
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    Debuggers are critical tools for software development. The design and implementation of a source-level debugging system that enables the HPF programmer to observe the behavior of the program at the level at which the program has been developed present unique challenges. The main requirement put on an HPF debugger is to observe and control the state of many processors, to summarize and present dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to mapping parallel programs on hypercube multiprocessors

    Publication Year: 1999, Page(s):221 - 225
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    In this work, we propose a heuristic algorithm based on genetic algorithm for the task-to-processor mapping problem in the context of local-memory multiprocessors with a hypercube interconnection topology. Hyper-cube multiprocessors have offered a cost effective and feasible approach to supercomputing through parallelism at the processor level by directly connecting a large number of low-cost proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing and debugging message passing applications based on the synergy of program and specification executions

    Publication Year: 1999, Page(s):196 - 203
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    We outline Ensemble, a design and implementation methodology for composing message passing (MP) applications from program components. We also outline specification composition, directly associated with application composition. We present the integration of specification and implementation of program development. We particularly elaborate on testing and debugging of MP applications based on the syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating selected fault masking and self-diagnosis mechanisms

    Publication Year: 1999, Page(s):97 - 104
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Fault Detection and Isolation (FDI) using self-diagnosing elements is used in distributed systems to facilitate system monitoring and maintenance. Voting algorithms are used to increase reliability by masking faults. This research addresses the integration of self-diagnosing elements and voting algorithms in a Triple Modular Redundant (TMR) configuration. A self-diagnosing element model is present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large scale simulations of quantum chromodynamics in a Europe wide SIMD-MIMD environment

    Publication Year: 1999, Page(s):321 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Large scale simulations of Quantum Chromodynamics are extremely CPU time demanding. Today, simulations in a heterogeneous SIMD-MIMD environment can be an interesting step towards simulations on Teracomputers, as already available for Japanese and US groups View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable VLSI algorithm for the fourth-order elliptic problem

    Publication Year: 1999, Page(s):53 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    The work presents a parallel scalable VLSI algorithm for solving the first fourth-order elliptic boundary value problem on a rectangle. The VLSI complexity AT2 of the algorithm (A-area, T-time) is expressed in terms of the problem size n2 (the number of discretization points) and the VLSI array size p2 (the number of processing cells). The algorithm is based on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method to solve the scalability problem in managing massively parallel processing on the Internet

    Publication Year: 1999, Page(s):256 - 262
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    A set of computers connected by the Internet can be seen as a MIMD virtual parallel computer with distributed memory. We call such a computer a Massively Parallel Virtual Computer (MPVC). The implementation of an MPVC will be feasible in the next few years, as new technologies brine to Internet communication speeds undreamed of nowadays. Problems such as Monte Carlo simulations and image processin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel resolution of alternating-line processes by means of pipelining techniques

    Publication Year: 1999, Page(s):289 - 296
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    The aim of this paper is to present an easy and efficient method to implement alternating-line processes on current parallel computers. First we show how data locality has an important impact on global efficiency, which leads us to the conclusion that one-dimensional compositions are the most convenient ones for 2D problems. Once this is asserted, a parallel algorithm is presented for the solution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct mapped cache performance modeling for sparse matrix operations

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

    Sparse matrices are in the kernel of numerical applications. Their compressed storage, which permits both operations and memory savings, generates irregular access patterns, reducing the performance of the memory hierarchy In this work we present a probabilistic model for the prediction of the number of misses of a direct mapped cache memory, considering sparse matrices with a uniform entries dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance models for I/O bound SPMD applications on clusters of workstations

    Publication Year: 1999, Page(s):263 - 270
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Clusters of workstations represent today a satisfactory alternative to MPPs and supercomputers in many areas of application. The rapidly reduction of the cost of high performance workstations/PCs makes this technology ever more available. Moreover, new concepts for the integration of individual workstations through Local Area Networks are emerging. High speed interconnection networks and optimized... View full abstract»

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