Proceedings. Advances in Parallel and Distributed Computing

19-21 March 1997

Filter Results

Displaying Results 1 - 25 of 60
  • Proceedings. Advances in Parallel and Distributed Computing

    Publication Year: 1997
    Request permission for reuse | PDF file iconPDF (2262 KB)
    Freely Available from IEEE
  • An effective parallelizing scheme of MPEG-1 video encoding on Ethernet-connected workstations

    Publication Year: 1997, Page(s):4 - 11
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1025 KB)

    Although MPEG-1 Video is a promising and the most widely used moving picture compression standard it requires a lot of computational resources to encode the moving pictures with a reasonable frame size and quality. In this paper we propose and implement an efficient parallelizing scheme for an MPEG-1 Video encoding algorithm on Ethernet-connected workstations which is the most widely available com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel VLSI neural system design for time-delay speech recognition computing

    Publication Year: 1997, Page(s):12 - 17
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (614 KB)

    Neural system, as processors of time-sequence patterns, have been successfully applied to several speaker-dependent speech recognition computing. They can be efficiently implemented by a pipelined architecture. In this paper, parallel time-delay speech recognition computing for VLSI neural systems is presented. The system design methodology is to emphasize coordination between computational model,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient parallel texture classification for image retrieval

    Publication Year: 1997, Page(s):18 - 25
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    This paper proposes an efficient parallel approach to texture classification for image retrieval. The idea behind this method is to pre-extract texture features in terms of texture energy measurement associated with a 'tuned' mask and store them in a multi-scale and multi-orientation texture class database via a two-dimensional linked list for query. Thus each texture class sample in the database ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel design and implementation of SOM neural computing model in PVM environment of a distributed system

    Publication Year: 1997, Page(s):26 - 31
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (601 KB)

    A parallel design and implementation of the Self-Organizing Map (SOM) neural computing model is proposed. The parallel design of SOM is implemented in a parallel virtual machine (PVM) environment of a distributed system. A practical realization of SOM algorithm is investigated, the construction of computing module in parallel virtual machine is discussed, the communication methods and an optimizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The study of parallel simulation processing based on MPP technology

    Publication Year: 1997, Page(s):34 - 40
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    Computer numerical simulation is widely applied in engineering and social fields. It has shown great value in these fields. Small scale simulation applications can be processed on the traditional simulation computer, but with the size of problem increasing, sequential processing cannot meet the requirements. Dynamic real-time simulation and super real-time simulation require high performance simul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definition of control variables for automatic performance modeling

    Publication Year: 1997, Page(s):42 - 49
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    Automatic model generation is studied as part of a hybrid modeling strategy using simulation for performance analysis. Two major steps have to be carried out in this context. The program which is being investigated has to be translated into a model. During the translation, runtime has to be estimated for numerous computational blocks of statements which are replaced by simple delays. For performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of buffered multistage interconnection networks in case of packet multicasting

    Publication Year: 1997, Page(s):50 - 57
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (799 KB)

    Multistage Banyan networks are frequently proposed as connections in multiprocessor systems. There exist several studies to determine the performance of networks in which messages are unicasted. (One processor sends a message to one and only one other processor.) In this paper, a timed Petri net model is used to derive the performance of buffered Banyan networks, in which messages may also be mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation research on multiprocessor interconnection networks with wormhole routing

    Publication Year: 1997, Page(s):58 - 64
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (702 KB)

    To design a parallel computer system, selecting an appropriate network is an important issue. This paper presents the simulation results on the performance of message passing interconnection networks used commonly in multiprocessor systems. Comparisons have been made on the performance of various interconnection networks like crossbar, mesh, hypercube, tree and hypertree with wormhole routing. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enlarging the scope of vector-based computations: extending Fortran 90 by nested data parallelism

    Publication Year: 1997, Page(s):66 - 73
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    This paper describes the integration of nested data parallelism into Fortran 90. Unlike flat data parallelism, nested data parallelism directly provides means for handling irregular data structures and certain forms of control parallelism, such as divide-and-conquer algorithms thus enabling the programmer to express such algorithms far more naturally. Existing work deals with nested data paralleli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The /spl chi/-calculus

    Publication Year: 1997, Page(s):74 - 81
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (829 KB)

    The paper proposes a new process algebra, called /spl chi/-calculus. The language differs from /spl pi/-calculus in several aspects. First it takes a more uniform view on input and output. Second, the closed names of the language are homogeneous in the sense that there is only one kind of bound name. Thirdly, the effects of communications in /spl chi/-calculus are delimited by localization operato... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "SEQ OF PAR" style structured parallel programming

    Publication Year: 1997, Page(s):82 - 89
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    This paper presents a new structured parallel programming model, "SEQ OF PAR", based on the Communication Closed Layer (CCL) principle of causal composition for parallel programs and Bird-Meertens formalism (BMF) of locality-based parallel computation. This model is to support for more general, architecture-independent parallel programming. It provides a structured approach to integrate task (or p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language support for synchronous parallel critical sections

    Publication Year: 1997, Page(s):92 - 99
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1025 KB)

    We introduce a new parallel programming paradigm, namely synchronous parallel critical sections. Such parallel critical sections must be seen in the context of switching between synchronous and asynchronous modes of computation. Thread farming allows to generate bunches of threads to solve independent subproblems asynchronously and in parallel. Opposed to that, synchronous parallel critical sectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards abstraction of message passing programming

    Publication Year: 1997, Page(s):100 - 107
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (895 KB)

    Data-parallel applications are usually programmed in the SPMD paradigm by using a message passing system such as MPI or PVM. However programming by using message passing primitives is still tedious and error-prone. This paper presents an abstraction of message passing programming in C++ to relieve programmers of low-level considerations. The runtime overhead introduced by the abstraction is shown ... View full abstract»

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

    Publication Year: 1997, Page(s):108 - 115
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (649 KB)

    Past attempts to apply Girard's linear logic to Lafont's interaction nets by treating "symbols" as logical rules, however, failed to come to a significant explanation. In this paper, we try to model "symbols" as external axioms and use "tensor" to describe partition of auxiliary ports. We show that our solution leads to a very natural logical interpretation of the computation on interaction nets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coherent parallel programming in C/spl par/

    Publication Year: 1997, Page(s):116 - 122
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (745 KB)

    This paper presents the coherent parallel programming concept using a new parallel language called C/spl par/ (pronounced C Parallel). The C/spl par/ language is based on the standard C language with a small set of extended constructs for parallelism and process interaction. At the core of C/spl par/ is a structured construct called coherent region, which facilitates the development of coherent pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel recursive algorithm for tridiagonal systems

    Publication Year: 1997, Page(s):124 - 130
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (681 KB)

    In this paper, a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) which is also based on the recursive method, the computation cost is reduced by a factor of two while maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructuring. The complexity of the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers

    Publication Year: 1997, Page(s):131 - 138
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Delaunay triangulation has been much used in such applications as volume rendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulation is large computation time required to obtain the triangulation on an input points set. This time can be reduced by using more than one processor, and several parallel algorithms for Delaunay triangulation have been pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel matrix computations and their applications for biomagnetic fields

    Publication Year: 1997, Page(s):139 - 142
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (375 KB)

    In this paper we present the results of a parallel implementation of a heart field simulation algorithm. The application of biomagnetic fields offers a wide range for using parallel algorithms. Pathological changes in the human body, especially in the heart muscle, can be diagnosed and localised by means of biomagnetic field parameters. The benefit of this diagnosis method is to fit an individual ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel solver of generalized eigenproblem on Dawning-1000

    Publication Year: 1997, Page(s):144 - 148
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In this paper, we consider the parallel implementation of solving generalized eigenproblem of Hermitian type matrices on Dawning-1000. It arises from the theoretical analysis of nonlinear optical crystal structures. We use Cholesky factorisation, Househoulder transformation, bisection method and inverse iteration to complete the computation. The implementation is based on the BLAS library and comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimization by redundancy using an extended LogP model

    Publication Year: 1997, Page(s):149 - 155
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (850 KB)

    We present a strategy for optimizing parallel algorithms introducing redundant computations. In order to calculate the optimal amount of redundancy, we generalize the LogP model to capture messages of varying sizes using functions instead of constants for the machine parameters. We validate our method for a wave simulation algorithm on a Parsytec PowerXplorer with eight processors and a workstatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiency issues of a parallel FEM implementation on shared memory computers

    Publication Year: 1997, Page(s):156 - 161
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (442 KB)

    In the field of parallel FEM methods a number of highly efficient solutions for distributed memory systems exist, but the passage to adaptive parallel FEM simulations leads, in all probability, to a more dynamic behaviour with respect to data placement and load balancing. Therefore shared-memory architecture seems to be a more appropriate solution for getting efficient implementations. This paper ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast parallel algorithm for finding the kth longest path in a tree

    Publication Year: 1997, Page(s):164 - 169
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    We present a fast parallel algorithm running in O(log/sup 2/n) time on a CREW PRAM with O(n) processors for finding the kth longest path in a given tree of n vertices (with /spl Theta/(n/sup 2/) intervertex distances). Our algorithm is obtained by efficient parallelization of a sequential algorithm which is a variant of both N. Megiddo et al.'s algorithm and G.N. Fredrickson et al.'s algorithm bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving sparse least squares problems on massively distributed memory computers

    Publication Year: 1997, Page(s):170 - 177
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    In this paper we study the parallel aspects of PCGLS, a basic iterative method whose main idea is to organize the computation of conjugate gradient method with preconditioner applied to normal equations, and incomplete modified Gram-Schmidt (IMGS) preconditioner for solving sparse least squares problems on massively parallel distributed memory computers. The performance of these methods on this ki... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A versatile directory scheme (Dir/sub 2/NB+L) and its implementation on BY91-1 multiprocessors system

    Publication Year: 1997, Page(s):180 - 185
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (801 KB)

    Cache coherence and synchronization between processors have been two critical issues in designing a shared memory multiprocessors system. From the perspective of hardware design, a directory based cache coherence protocol and lock mechanism are employed to prevent inconsistency of caches and warrant atomic memory accesses. The BY91-1 multiprocessors efficiently integrate supports for cache coheren... View full abstract»

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