By Topic

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
  • 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.
  • 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.
  • 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.
  • 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.
  • PAVE: parallel algorithms visually explored, a prototype tool for the investigation of data structures in parallel numerical iterative algorithms

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

    It is commonly acknowledged that since the advent of supercomputing, the ability of computer scientists to efficiently interpret the large masses of data produced has been significantly reduced. By transforming the masses of numbers produced into intuitive and instructive pictures visualization offers the scientist a way of seeing the unseen. In this paper a prototype algorithm investigation tool ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object oriented approach to fault tolerant software

    Publication Year: 1995, Page(s):383 - 390
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    In this paper we are interested in the use of software techniques for fault tolerance in the framework of distributed object oriented programming. We survey different degrees of integration between paradigms for object oriented software development and those for fault tolerance. We then provide the outline of a unifying approach to fault tolerance in object oriented systems. This approach, named M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using PVM to implement a distributed dependable simulation system

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

    In the past decade, the use of distributed algorithms to model simulations is considerably increased, in order to gain speedup over traditional sequential simulations. Also, there has been much interest in using inexpensive, powerful workstation nets, with high speed interconnection, instead of expensive parallel computers. In this paper, we briefly present the kernel of a distributed system (PV 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.
  • VIPER: a tool for the visualisation of parallel programs

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

    The VIPER tool visualises the execution of a parallel program. VIPER focuses on the class of parallel programs constructed around the Mona Lisa parallel programming paradigm. Mona Lisa is a typed paradigm, providing the user with a small set of high level primitives for data exchange. The information provided by VIPER is directly related to the execution of these primitives. This makes the tool mo... 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.
  • 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.
  • Design issues and the system architecture of TICOM-IV, a highly parallel commercial computer

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

    We describe design issues and preliminary considerational factors for highly parallel commercial computer design. The design issues described in this paper include application area analysis, scalability, availability, network topology and memory hierarchy. We explain how these issues are related to each other and how they affect the system performance. We then describe the system architecture of T... 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.
  • Flexible data parallel training of neural networks using MIMD-Computers

    Publication Year: 1995, Page(s):27 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    An approach to flexible and efficient data parallel simulation of neural networks on large scale MIMD machines is presented. We regard the exploitation of the inherent parallelism of neural network models as necessary if larger networks and training data sets respectively are to be considered. Nevertheless it is essential to provide the flexibility for investigating various training algorithms or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging of concurrent processes

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

    Supercomputing power is a solution to the users need for more accurate results and larger problem sizes. In addition to the problems that arise in the design stage of a parallel program it is difficult to localize and correct errors in the testing and debugging phase. Where memory hot spots and bus contention are problems with shared memory architectures, nondeterminism arising from message races ... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 PRAM oriented language

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

    A new programming language oriented to the PRAM model is presented and results of its implementation on transputer networks are reported. During the last four years of teaching at the Computer Science Faculty of La Laguna University, the new language has proved to be a practical tool for the study, design, analysis and verification of PRAM algorithms. The theoretical analysis predicts the good per... 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.