Proceedings Euromicro Workshop on Parallel and Distributed Processing

25-27 Jan. 1995

Filter Results

Displaying Results 1 - 25 of 71
  • A parallel algorithm for "document segmentation"

    Publication Year: 1995, Page(s):516 - 521
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (467 KB)

    We present a parallel algorithm for physical segmentation of technical documents. The proposed method follows a "data parallel" approach, based on a divide and conquer implementation. A document page is statically partitioned into n equal-sized rectangular blocks, where n is the number of processors. Each processor independently finds a segmentation of its assigned block, according to the same rul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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
  • Parallel QR algorithm for the complete eigensystem of symmetric matrices

    Publication Year: 1995, Page(s):480 - 485
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    We propose a parallel organization of the QR algorithm for computing the complete eigensystem of symmetric matrices. We developed Occam versions of standard sequential implementations of the QR algorithm: the procedure qr1 which computes only eigenvalues and qr2 for the computation of all eigenvalues and eigenvectors. The Occam procedure parqr2 is a parallel implementation of qr2 and was tested on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ODP-based distribution configuration

    Publication Year: 1995, Page(s):486 - 493
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The new generation of open, distributed, object-based systems poses many new challenges. For example, it raises the issue of how the application should be mapped onto a distributed target platform so that performance and reliability constraints are met. This paper shows how the abstract Engineering Model of ODP, together with the high-level language SDL, can be used to achieve system descriptions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A CAD multiprocessor system for advanced real-time process applications

    Publication Year: 1995, Page(s):494 - 501
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    New processes or new control systems of existing processes in the power generation field require that the design and the implementation of the automation system (i.e. devices committed to control, supervision, man-machine, etc.) would include both the flexibility and the friendliness of a laboratory desk, and the robustness and standardization of an industrial, off the shelf, system. An integrated... 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.
  • 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.
  • A Shared Memory model based on the Dataflow paradigm

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

    In this paper a Shared Memory model designed to be efficiently implemented on a collection of autonomous processing elements is presented. The model is inspired by the Dataflow paradigm. The main features of the model are: the single assignment principle, multi-dimensional addressing scheme, and associative data access primitives. The single assignment principle limits the number of updates of a u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly parallel SCF calculation: the SYSMO Program

    Publication Year: 1995, Page(s):502 - 507
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    This article presents a parallel implementation of the Linear Combination of Atomic Orbitals-Self Consistent Field (LCAO-SCF) algorithm, based on the Parallel Virtual Machine (PVM) environment and the System Modena (SYSMO) suite of computer programs, explicitly oriented for highly parallel computing. Parallelism is achieved at the Single Program Multiple Data (SPMD) level, dividing the calculation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical architectures for computer vision

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

    High computer performance depends only partially on using faster and more reliable hardware, but to a large extent it depends on the architecture and on the processing techniques. An effective platform that matches general planning strategies is given by the hierarchical paradigm. This is true particularly in the field of image processing and computer vision, which is characterized by very large q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive deadlock and livelock free routing algorithm

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

    The paper is concerned with store and forward deadlocks (DL) arising in interprocessor network systems with buffered packet switched communications. Algorithms which implement DL free routing use adaptive or nonadaptive routing modality. Nonadaptive algorithms underuse the interconnection network bandwidth because they impose restrictions to the routing paths; adaptive algorithms are DL free only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An associative communication network for fine and large grain dataflow

    Publication Year: 1995, Page(s):324 - 331
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The Associative Communication Network consists of a crossbar switch melted with a distributed associative memory. The network supports the design of scalable multiprocessor systems with low programming effort for communication. Information between the processors is automatically routed by the network. Based on the Associative Communication Network the Associative Dataflow Architecture ADARC has be... 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.
  • Dependable parallel computing with agents based on a task graph model

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

    We discuss a novel technique for improving the dependability of parallel programs executing on a MIMD shared memory architecture. The idea is to empower certain tasks of each application program to carry out failure detection, and to reschedule the execution of those tasks which are considered to have failed. The technique we propose is based on a task graph representation of the parallel program,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern-driven automatic program transformation and parallelization

    Publication Year: 1995, Page(s):76 - 83
    Cited by:  Papers (8)  |  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.
  • 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.
  • Space efficient data race detection for parallel programs with series-parallel task graphs

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

    A data race or access anomaly is a bug in parallel programs, occurring when two parallel processes access the same shared resource in an unsynchronised fashion, and at least one access modifies the resource. The effects of a data race can be non-deterministic and can give the program debugger a very hard time. Race detection represents a class of methods which automatically detect the presence of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions

    Publication Year: 1995, Page(s):401 - 408
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. Two parallel Jacobi orderings are described. These orderings can generate n(n-1)/2 different index pairs and sort column norms at the same time. The one-sided Jacobi SVD algorithm using these parallel orderings converges in about the same number of sweeps as ... 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.
  • Algorithm-based fault-tolerant programming in scientific computation on multiprocessors

    Publication Year: 1995, Page(s):374 - 382
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Efficient parallel algorithms proposed to solve many fundamental problems in scientific computation are sensitive to processor failures. Because of its low costs, algorithm-based fault tolerance is an interesting concept for introducing fault tolerance into existing multiprocessors. To facilitate fault-tolerant programming in scientific computation, we have modified and developed further an existi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed computer architecture for qualitative simulation based on a multi-DSP and FPGAs

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

    The design of a specialized computer architecture for qualitative simulation is presented. Our interest focuses on the hardware design of an application-specific computer architecture which is composed of programmable processors (digital signal processors TMS320C40) and application-specific integrated circuits (FPGAs). Two design strategies are considered to improve the performance. Primitive func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a massively parallel architecture for integrated circuits testing

    Publication Year: 1995, Page(s):332 - 338
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The paper describes the application of a prototype of a massively parallel processing machine to the acceleration of a number of tasks in the debugging of Integrated Circuits by the use of Scanning Electron Microscopy. In particular the machine is used in a number of low level image processing tasks taking advantage in some cases of the specific characteristics of the images of the surface of a VL... 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.
  • 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.
  • Prototyping DIME, a tightly coupled heterogeneous distributed database system

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

    In this paper, we design and implement a prototypical heterogeneous distributed database system, named DIME (Distributed Information Management). DIME has the following salient properties. First, DIME allows both global retrieval operations and global update operations where different concurrency control schemes are used in different local database systems (LDBSs). Second, DIME implements internat... View full abstract»

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