By Topic

Advances in Parallel and Distributed Computing, 1997. Proceedings

Date 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 commercial reuse | PDF file iconPDF (2262 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s):425 - 426
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • Eliminating two kinds of data flow inaccuracy in the presence of pointer aliasing

    Publication Year: 1997, Page(s):410 - 415
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Program languages with sophisticated usage of pointers as C are hard to analyze. Recent researches on pointer analysis focus on tracking the possible values of pointers, when a program point is reached, and great progress has been achieved. However, how to apply the result of pointer analysis to dataflow analysis and other program optimization/parallelization is not well studied. This paper presen... View full abstract»

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

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

    The paper proposes a new process algebra, called χ-calculus. The language differs from π-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 χ-calculus are delimited by localization operators, not by s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing on traditional serial programs by huge node data flow

    Publication Year: 1997, Page(s):406 - 409
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    This paper introduces an algorithm that can generate huge node data flow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of existing program resources. In addition, this idea of huge node data flow algorithm can also be used in distributed processing and multi-thread processing 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
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 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.
  • An improvement on data dependence analysis supporting software pipelining technique

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

    The accuracy of the data dependence analysis of a client program will decide in what an extent the compiler can unleash the power of the potential parallelism of the client program. Most of the current works on dependence analysis are based on the dependence equation and constraint inequalities of loop variable bounds (sometimes augmented with the direction vector). Unfortunately, they can not giv... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (904 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.
  • Efficient implementation of portable C*-like data-parallel library in C++

    Publication Year: 1997, Page(s):398 - 405
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The C* language is a data-parallel extension of the C language which incorporates parallel data types. Since the C++ language provides operator overloading, a C++ library can implement the C* parallel extensions with a similar syntax. Although library implementations are highly portable, some overheads make them impractical. The two major overheads incurred are temporaries in each operator applica... 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
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 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.
  • 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (640 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.
  • Dependence analysis of parallel and distributed programs and its applications

    Publication Year: 1997, Page(s):370 - 377
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may exist in a parallel and/or distributed program, a general approach to define, analyze, and represent these program dependences formally, and applications of an explicit program depende... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (644 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.
  • Interaction nets revisited

    Publication Year: 1997, Page(s):108 - 115
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 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 t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of efficient and reliable multicast servers

    Publication Year: 1997, Page(s):253 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Reliable multicast services in a group of autonomous distributed processes/sites are desirable to maintain the consistent state of shared information accessed by transactions in distributed systems. Many existing protocols are complicated and thus quite expensive and not efficient for availability of distributed systems. This paper discusses the design and implementations of a new logical token ri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of parallel compiler-partial evaluation of parallel lambda language

    Publication Year: 1997, Page(s):390 - 397
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    We describe in this paper a partial evaluator for a parallel programming language. The parallel language we present is a combination of lambda calculus and message passing communication mechanism. By improving some techniques originally used for partial evaluation of sequential language and introducing some new methods, we successfully solve the problems caused by some internal semantic difference... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (448 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.
  • Parallel recursive algorithm for tridiagonal systems

    Publication Year: 1997, Page(s):124 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 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.
  • Task assignment for distributed computing

    Publication Year: 1997, Page(s):270 - 277
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    In the course of the development of reactive systems often real time constraints have to be met. In such time critical applications heterogeneous multi-processor systems are used in order to fulfill these time constraints. This paper presents a hybrid partitioning method that uses a stochastic algorithm together with mixed integer linear programming. This method supports the development of time cr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An environment for the parallel execution of multigrain clustered tasks

    Publication Year: 1997, Page(s):320 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    In this paper, we present an original approach for the design and execution of distributed applications that require numerous tasks of variable grain. The approach is based on the concept of task cluster which is an entity that groups tasks with strong logical interaction and that guarantees efficient communications between them. We describe the implementation of the model, that mainly relies on t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable parallel workstation cluster system

    Publication Year: 1997, Page(s):307 - 313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    In this paper, we argue that because of recent advance of network & CPU technologies, workstation clusters are poised to become the primary parallel computing infrastructure for science and engineering computing. After analyzing and comparing the communication performance of three popular networks: 10 Mbps Ethernet, 100 Mbps Ethernet and 640 Mbps Myrinet on an experimental workstation cluster,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATOLL: a high-performance communication device for parallel systems

    Publication Year: 1997, Page(s):228 - 234
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Fast and efficient communication is one of the major design goals not only for parallel systems but also for clusters of workstations. The proposed model of the high performance communication device ATOLL features very low latency for the start of communication operations and reduces the software overhead for communication specific functions. To close the gap between off-the-shelf microprocessors ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of multidimensional loops with non-uniform dependences

    Publication Year: 1997, Page(s):362 - 369
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    For a parallelizing compiler, mainly based on loop transformations, dependence information that is as complete and precise as possible is required. In this paper, we propose a generalized method for computing, in any multi-dimensional loop, information which proved to be useful in the case of irregular dependences. Firstly, we solve the basic problem of the existence of a dependence with an algori... 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 (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 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.
  • Towards abstraction of message passing programming

    Publication Year: 1997, Page(s):100 - 107
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 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.