By Topic

Proceedings Euromicro Workshop on Parallel and Distributed Processing

25-27 Jan. 1995

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings Euromicro Workshop on Parallel and Distributed Processing

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Pattern-driven automatic program transformation and parallelization

    Publication Year: 1995, Page(s):76 - 83
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The PARAMAT system is able to automatically parallelize a wide class of sequential numeric codes operating on dense vectors, matrices etc. without any user interaction, for execution on distributed memory message-passing multiprocessors. A powerful pattern recognition tool locally identifies program semantics and concepts in scientific codes. It also works for dusty deck codes that have been `encr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global execution time minimization by allocating tasks in parallel systems

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

    We have studied the allocation of directed acyclic graphs (DAGs) into a given parallel machine (PM); this is an NP-complete problem. Previous papers presented allocation algorithms all making many rough simplifications so that the achieved allocations are too far from the optimum and do not minimize the actual execution time of the program. We analyzed the impact of the precedence relations on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in parallel and distributed processing of tree-based multiple-task jobs

    Publication Year: 1995, Page(s):98 - 105
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The efficient processing of tree based multiple task jobs arriving in batches to parallel and distributed systems is presented. This type of processing can be found in such application fields as, for example, automatic diagnostics and document recognition. A key management issue in such systems is task allocation. Load balancing is often proposed as the task allocation approach. The load balancing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical locality algorithm for NUMA compilation

    Publication Year: 1995, Page(s):106 - 113
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A compiler algorithm which exploits program locality and reduces the latency overhead in parallel hierarchical memory machines is described. By applying the appropriate transformation at different levels of the hierarchy, the amount of nonlocal accesses between processors is minimised. Similarly, the memory structure within a processor is exploited so reducing the amount of communication between l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved data parallel algorithm for Boolean function manipulation using BDDs

    Publication Year: 1995, Page(s):33 - 39
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm adopts Binary Decision Diagrams (BDDs), which are the state-of-the-art approach for representing and handling boolean functions. The algorithm is well suited for SIMD architectures and is based on distributing BDD nodes among the available Processing Elements and traversing BDDs in a breadth-first manne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning and mapping of large FEM-graphs by self-organization

    Publication Year: 1995, Page(s):227 - 235
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    We consider the problem of mapping large scale FEM graphs to highly parallel distributed memory computers. Typically, these programs show a low-dimensional grid-like communication structure. We argue that conventional domain decomposition methods that are usually employed today are not well suited for future highly parallel computers as they do not take into account the interconnection structure o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-balancing and object-orientation: a case study from mesoscale flow modelling

    Publication Year: 1995, Page(s):114 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    Parallel processing is a natural choice to achieve higher performance for many applications from the area of scientific computing. Among them, the models of atmospheric circulation attract public attention, since they can be used for the simulation of the impact of human activities on our environment. The paper promotes the use of object-oriented design techniques to implement large data parallel ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing distributed shared memory based on DCE

    Publication Year: 1995, Page(s):84 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    The Distributed Computing Environment (DCE) software of the Open Software Foundation offers solutions for security problems and for shared file management in heterogeneous computer networks. It allows distributed programming by remote procedure calls and parallel programming by threads. Distributed shared memory in a computer network pretends a globally shared address space among networked compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration of dense non-convex iteration sets

    Publication Year: 1995, Page(s):156 - 163
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The enumeration of points contained in a polyhedron is one of the key algorithmic problems in the transformation of scientific programs. However, current algorithms can only operate on convex and “regularly non-convex” polyhedra. If the iteration sets to be enumerated do not fit in either category, the final code must scan a superset of the union of iteration domains and determine at r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Word parallelism vs spatial parallelism: a performance optimization technique on the PAPRICA system

    Publication Year: 1995, Page(s):236 - 243
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Starting from the analysis of the hardware efficiency of SIMD systems which use an external memory for data storage, this paper discusses a critical point in hardware design. In particular it presents a technique aimed to the maximization of the data bus efficiency. This technique is based on the transformation of the initial data set into a packed one, and can be successfully implemented on syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerance on regular decomposition grid applications

    Publication Year: 1995, Page(s):358 - 365
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Writing parallel applications is considerably more complex due to additional problems not found in the sequential environment. The main problems include communication, synchronization data partitioning and distribution, mapping of processes, heterogeneity and fault tolerance. Fault tolerance is a very important feature in parallel/distributed systems since the mean time between failures of the sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributing code in a parallel fine grain machine using the actor model

    Publication Year: 1995, Page(s):122 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    One way to gain execution time on massively parallel systems is to minimise I/O operations by reducing code loading. A solution to this problem is to distribute code dynamically among all processors. The actor model is well suited to this execution model. Actors are modelled as processes which have to be duplicated at execution, at request and depending on the application growth. Our project aims ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel simulation of message routing networks

    Publication Year: 1995, Page(s):138 - 145
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    An implementation of a conservative parallel simulator with deadlock avoidance is presented. Its performance when working with a realistic model of a message routing network is evaluated and contrasted against a sequential simulator. Different factors that improve the performance of the parallel simulation are discussed, focusing in the model under study and the available computer: a network of tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting path parallelism in logic programming

    Publication Year: 1995, Page(s):164 - 173
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    This paper presents a novel parallel implementation of Prolog. The system is based on Multipath, a novel execution model for Prolog that implements a partial breadth-first search of the SLD-tree. The paper focusses on the type of parallelism inherent to the execution model, which is called path parallelism. This is a particular case of data parallelism that can be efficiently exploited in a SPMD a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correctness of a distributed deadlock resolution algorithm for the single request model

    Publication Year: 1995, Page(s):254 - 261
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    We consider the problem of the distributed deadlock resolution. Starting from a high level specification of the problem and the resolution algorithm for a system with single request model, we provide successive levels of decreasing abstraction of the initial specification in order to achieve a solution in a complete distributed system. The successive refinements and the final distributed deadlock ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterated Runge-Kutta methods on distributed memory multiprocessors

    Publication Year: 1995, Page(s):12 - 19
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    In this article, we consider the iterated Runge-Kutta (IRK) method which is an iteration method based on a predictor-corrector scheme for the solution of ordinary differential equations. The method uses embedded formulae to control the stepsize. We present different algorithms of the IRK method on distributed memory multiprocessors using appropriate communication primitives. The theoretical perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-dimensional partitioning for massively parallel database machines

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

    Harder, new requirements are appearing in the area of database systems. The popularity reached by parallel database systems during the past decade, due to their high performance and scalability characteristics should be currently maintained and enhanced by including more powerful processing tools. We present a general technique for declustering data in a parallel relational database using multi-di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A neural circuit for the maximum 2-satisfiability problem

    Publication Year: 1995, Page(s):319 - 323
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    In this paper we discuss a uniform family of circuits, realizing neural networks to solve approximately the maximum 2-satisfiability problem. An implementation on FPGA for the problem instances of 16 variables and 480 clauses is presented. The circuit shows a good performance solving problem instances in 20 μs with relative error less than 0.003 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design and implementation of a dependable space instrument

    Publication Year: 1995, Page(s):366 - 373
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The Digital Wave Processor, DWP, is an example of a dependable distributed system which has been built and will be flown on the ESA/NASA Cluster satellites. Pre-flight testing of the DWP instruments is nearly complete and the results of this programme of testing are described. Much of the fault-tolerant behaviour of DWP has been tested and found to function as expected. Of the problems which have ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of splitting methods for solving block tridiagonal linear systems on transputers

    Publication Year: 1995, Page(s):409 - 415
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    This paper is concerned with the parallel implementation of two splitting methods for solving block tridiagonal linear systems on a transputer network. For both methods, we describe the data allocation, the workload distribution and the interprocessor communications and we evaluate the effectiveness of the two parallel algorithms by numerical experiments on a set of test problems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HeterEL-a server for programming parallel heterogeneous systems

    Publication Year: 1995, Page(s):472 - 479
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Heterogeneous parallel computing can be considered a first step towards general purpose parallel machines. Different communication libraries are available for heterogeneous parallel computing. Most of them are based on the message passing model. The virtual shared memory communication model is now obtaining an increasing attention. Our point of view is that the availability of both models, followi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing network contention for mapping tasks onto massively parallel computers

    Publication Year: 1995, Page(s):210 - 218
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    This paper presents a new framework aimed at compile-time determination of satisfactory sub-optimal solutions to the mapping problem onto modern massively parallel computing systems. The approach incorporates realistic assumptions on the models both for parallel programs and target architectures. It is refined for the K-ary n-cube family of processor networks that use a deterministic routing algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences in dynamic placement of actors on multicomputer systems

    Publication Year: 1995, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    The availability of low-cost microprocessors and the advances in communication technologies have promoted a great interest in multicomputer architectures. These systems are characterized by high performance, availability and extensibility at low cost but nowadays lack of good programming tools which could help the programmer to really exploit the resources of the computing system. One of the most ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling actor programs using Predicate/Transition nets

    Publication Year: 1995, Page(s):194 - 200
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The actor model is a model of concurrent computation which is powerful enough to represent all the operations needed to exploit parallel and distributed machines. In this paper, we propose to model actor programs with Predicate/Transition nets. Predicate/Transition nets are high-level Petri nets with data structures instead of tokens and predicates associated with transitions. This formalism permi... View full abstract»

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