By Topic

Parallel and Distributed Processing, 1998. PDP '98. Proceedings of the Sixth Euromicro Workshop on

23-23 Jan. 1998

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (304 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1998, Page(s):519 - 520
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • A case for merging the ILP and DLP paradigms

    Publication Year: 1998, Page(s):217 - 224
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    The goal of this paper is to show that instruction level parallelism (ILP) and data-level parallelism (DLP) can be merged in a single architecture to execute vectorizable code at a performance level that can not be achieved using either paradigm on its own. We will show that the combination of the two techniques yields very high performance at a low cost and a low complexity. We will show that thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting write semantics in implementing partially replicated causal objects

    Publication Year: 1998, Page(s):157 - 163
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    To support efficient access to objects that support cooperation between users, the objects need to be replicated at nodes where they are frequently accessed. Causal consistency is a consistency criterion particularly attractive for objects shared in cooperative applications. It is based on a causality relation on read and write operations issued by concurrent processes. It only requires that write... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of the pipelined hash-join algorithm in a heterogeneous distributed environment

    Publication Year: 1998, Page(s):486 - 491
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A pipelined distributed parallel hash-join algorithm is executed in a distributed heterogeneous supercomputing environment which consists of the Connection Machine CM2, and the Cray C90. This algorithm implements the computationally intensive join operation of relational databases. The hash and join phases of the algorithm are executed on the architectures determined to be best suited for them. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-level CHILL debugging system in cross-development environments

    Publication Year: 1998, Page(s):211 - 216
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    CHILL is a concurrent programming language, especially for implementing telecommunications software. ETRI has used the language for the development of switching software. Generally, switching software is characterized by real-time execution, parallel and distributed processing, large scale source code, and high complexity. The software is also developed on cross development environments. In this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A safe distributed deadlock resolution algorithm for the OR request model

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

    This paper presents an algorithm for resolving OR deadlocks in distributed systems. The algorithm works in two concurrent phases. Firstly, it collects the paths of the WFG (at each initiator process). A termination detection mechanism is used to know the ending of this phase. Collected paths are then analyzed to discover whether the process belongs to a deadlock. The proposed algorithm has two pri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental study of BSP sorting algorithms

    Publication Year: 1998, Page(s):479 - 485
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The bulk-synchronous parallel (BSP) model of computation has been proposed as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. The authors implement, using the Oxford BSP Toolset, BSPlib, a number of BSP deterministic and randomized sorting algorithms on a variety of parallel system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new distribution format for reshaped arrays in High Performance Fortran

    Publication Year: 1998, Page(s):204 - 210
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Data parallel languages designed for distributed memory computing environments provide a single global address space to the programmer. The mapping from this global address space to the distributed local address space is performed by a compiler, which does this mapping based on the array distribution format. Thus, each array in a data parallel language program has its own distribution format. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causal broadcasting based on sliding windows

    Publication Year: 1998, Page(s):143 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Causal broadcasting protocols are usually implemented on top of communication subsystems which adopt a FIFO sliding window flow control using acknowledgement messages. Such messages can be source of information about the causality relations among application messages which can reduce the amount of control information necessary to guarantee causal deliveries (i.e., a vector of unbounded integer). I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Work platforms: basic infrastructure for groupware-a conceptual framework

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

    In the past, the field of CSCW has concentrated on providing support for the cooperative and coordination aspects of human work with the help of networked computer systems. The dominant issues now are the integration of different existing tools into comprehensive CSCW systems and the interoperation of heterogeneous CSCW systems. Work platforms based on services are providing new impulses for this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving sparse triangular systems on distributed memory multicomputers

    Publication Year: 1998, Page(s):470 - 478
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The authors describe and compare two different methods for solving sparse triangular systems in distributed memory multiprocessor architectures. The two methods involve some preprocessing overheads so they are primarily of interest in solving many systems with the same coefficient-matrix. Both algorithms start off from the idea of the classical substitution method. The first algorithm presented in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel simulation in rewriting logic: some observations

    Publication Year: 1998, Page(s):197 - 203
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    In this paper, the relationship between the computational models of object-oriented rewriting and parallel discrete-event simulation models is explored. A discrete-event simulation program in which several objects interact with each other by exchanging messages may have a high degree of concurrency (which can be exploited using optimistic or conservative parallel simulation methods). We report on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting the parallel divide-and-conquer method to solve the symmetric tridiagonal eigenproblem

    Publication Year: 1998, Page(s):13 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    In this paper we present a new divide-and-conquer parallel algorithm to compute the eigenvalues of symmetric tridiagonal matrices. This algorithm combines the use of rank-one modifications in the division phase and the application of the Laguerre iteration in the updating phase. Our method is compared with one based on the same scheme but using rank-two modifications. A thorough experimental analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences on implementing PARMACS macros to run the SPLASH-2 suite on multiprocessors

    Publication Year: 1998, Page(s):64 - 69
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    In order to evaluate the goodness of parallel systems, it is necessary to know how parallel programs behave. The SPLASH-2 applications provide us with a realistic workload for such systems. So, we have made different implementations of the PARMACS macros used by SPLASH-2 applications, based on several execution and synchronization models, from classical Unix processes to multithreaded systems. Res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ghost packets: a deadlock-free solution for k-ary n-cube networks

    Publication Year: 1998, Page(s):133 - 139
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Improving interconnection subsystems is crucial for the overall performance of a multicomputer system. Hence, a theoretical presentation of a new deadlockfree message flow model for k-ary n-cube networks is developed in this paper. The key idea of this flow control mechanism is to preserve enough free resources for each possible routing dependency cycle, so that packet progress will be guaranteed.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A special-purpose parallel computer for solving partial differential equations

    Publication Year: 1998, Page(s):509 - 517
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    The paper describes a special-purpose single instruction multiple data (SIMD) computer that implements multigrid algorithms for solving partial differential equations. The authors show that the multigrid machine is a very good alternative to commercial microprocessor-based parallel computers for solving partial differential equations, which is one of the most demanding applications. The computer o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A flexible state-saving library for message-passing systems

    Publication Year: 1998, Page(s):335 - 341
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Message passing applications on a distributed computer require tools to integrate state saving and rollback, to support dynamic program reconfiguration, fault tolerance and others. The paper presents the results of integrating two independently developed tools that combine flexibility and portability. The User-Triggered CheckPointing (UTCP) provides checkpointing and recovery while relying on the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock avoidance and adaptive routing in interconnection networks

    Publication Year: 1998, Page(s):359 - 364
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Networks of workstations are rapidly emerging as a cost effective alternative to parallel computers. Switch based interconnects with irregular topologies allow the wiring flexibility, scalability and incremental expansion capability required in this environment. The irregularity also makes routing and deadlock avoidance on such systems quite complicated. Current proposals avoid deadlock by removin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tailorable component architectures for CSCW-systems

    Publication Year: 1998, Page(s):302 - 308
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    Tailorability is generally regarded as a key property of CSCW systems, because cooperative activities provide for very dynamic and diversified requirements. Extensive tailorability has to be supported by the design of the system architecture. We investigate the value of component architectures for this purpose and discuss several design options for the questions raised by this approach. We propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh

    Publication Year: 1998, Page(s):463 - 469
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one-sided Jacobi approach and is targeted to a multicomputer in which nodes can be arranged as a two-dimensional mesh with an arbitrary number of rows and columns. The algorithm is analysed through simple analytical models of execution time, which show that an adequate choice of the mesh configuration ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PARASOL interface to new parallel solvers: a case study

    Publication Year: 1998, Page(s):279 - 285
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The paper presents an overview of the PARASOL interface and its potential impact on facilitating transfer of technology from the academic researchers to the industrial end users. The PARASOL project aims at developing scalable direct and iterative solvers and testing them on real problems with respect to applicability and robustness in the industrial applications such as linear structural analysis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A toolset for visualization and analysis of parallel real-time embedded systems based on fast prototyping techniques

    Publication Year: 1998, Page(s):186 - 194
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1704 KB)

    This paper describes a toolset, whose objective is to provide full support for the analysis and testing of temporal behavior in the development of parallel realtime systems. The development approach supported by the toolset is based on an incremental prototyping technique combined with successive analyses and tests of the temporal behavior of prototypes carried out along the development cycle. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-performance mixed-machine heterogeneous computing

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

    The focus of this invited keynote paper (to be presented by H.J. Siegel) is mixed-machine heterogeneous computing, where a suite of different kinds of high-performance machines are interconnected by high-speed links. Such a system can be orchestrated to perform an application whose subtasks have diverse execution requirements. Subtasks are assigned to and executed on the machines that will result ... View full abstract»

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

    Publication Year: 1998, Page(s):438 - 444
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    We investigate the performance of barrier synchronisation on both shared memory and distributed memory architectures, using a wide range of techniques. The performance results obtained show that distributed memory architectures behave predictably, although their performance for barrier synchronisation is relatively poor. For shared memory architectures, a much larger range of implementation techni... View full abstract»

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