Partial evaluation is an automatic program transformation that optimizes programs by specialization. We speed up the specialization process by utilizing the natural coarse-grained parallelism inherent in the partial e...
详细信息
Partial evaluation is an automatic program transformation that optimizes programs by specialization. We speed up the specialization process by utilizing the natural coarse-grained parallelism inherent in the partial evaluation process. We have supplemented an existing partial evaluation system for the Scheme programming language by a farm-of-workers model for parallel partial evaluation in a network of loosely coupled workstations. Our implementation speeds up specialization by a factor of 2-3 on 6 processors.
The paper presents the Abstract Configuration Language (ACL) implemented within the parallel Objects object-oriented parallel programming environment. ACL defines a set of directives that allow users to specify the al...
详细信息
ISBN:
(纸本)0818678836
The paper presents the Abstract Configuration Language (ACL) implemented within the parallel Objects object-oriented parallel programming environment. ACL defines a set of directives that allow users to specify the allocation needs of his/her application components without being aware of the architectural details. ACL directives drive the allocation decisions of the run-time support, by adapting its general-purpose behaviour to follow applications particular allocation needs. The effectiveness of the ACL approach in increasing the performances of parallelapplications is confirmed by a testbed application.
In this paper we propose a distributed computing environment, namely, Virtual-Cube (VC), to support arbitrarily large binary hypercube computing on a cluster of homogeneous workstations that are interconnected by ethe...
详细信息
In this paper we propose a distributed computing environment, namely, Virtual-Cube (VC), to support arbitrarily large binary hypercube computing on a cluster of homogeneous workstations that are interconnected by ethernet LAN. The embedding concept between binary hypercube parallel architectures and a cluster of computers interconnected through computer networks is introduced. Upon Virtual-Cube, an SIMD parallel language VCPL is provided. The advantages of Virtual-Cube system include (a) it can be considered as a practical and economical binary hypercube machine, and (b) it brings the parallel solutions on binary hypercube directly into distributedapplications. Currently, a prototype of Virtual-Cube is implemented on NeXT workstations.
The functional programming introduced by Geometrica in geometry is illustrated with various aspects of the concept of parallelism. parallelism is well defined for a continuous curve. Its generalisation to a broken lin...
详细信息
ISBN:
(纸本)9525153029
The functional programming introduced by Geometrica in geometry is illustrated with various aspects of the concept of parallelism. parallelism is well defined for a continuous curve. Its generalisation to a broken line or a polygon requires some convention at the vertices where the normal and the distance are undefined. The next level of generalisation consists of defining a curve whose distance to a reference curve varies according to a given law. Such a curve is called paraxial. applications to architecture and optics are proposed.
The problem of global synchronization in massively parallel systems is discussed for the level of models represented by asynchronous cellular automata arrays. Synchronization is called global if a given asynchronous a...
详细信息
ISBN:
(纸本)0818678704
The problem of global synchronization in massively parallel systems is discussed for the level of models represented by asynchronous cellular automata arrays. Synchronization is called global if a given asynchronous automata array functions in logical time so that its behavior can be homomorphously mapped to the behavior of the prototype synchronous system in physical time. Our approach is decomposing the asynchronous array to synchro-stratum which acts as a distributed asynchronous clock and automata stratum whose automata have a construction similar to that of the synchronous prototype array automata. For various disciplines of prototype synchronization, the corresponding variants of synchro-stratum implementation for the asynchronous analogue are discussed.
We introduce the distributed theorem prover Peers-mcd for networks of workstations. Peers-mcd is the parallelization of the Argonne prover EQP, according to our Clause-Diffusion methodology for distributed deduction. ...
详细信息
We introduce the distributed theorem prover Peers-mcd for networks of workstations. Peers-mcd is the parallelization of the Argonne prover EQP, according to our Clause-Diffusion methodology for distributed deduction. The new features of Peers-mcd include the AGO (Ancestor-Graph Oriented) heuristic criteria for subdividing the search space among parallel processes. We report the performance of Peers-mcd on several experiments, including problems which require days of sequential computation. In these experiments Peers-mcd achieves considerable, sometime super-linear, speed-up over EQP. We analyze these results by examining several statistics produced by the provers. The analysis shows that the AGO criteria partitions the search space effectively, enabling Peers-mcd to achieve super-linear speed-up by parallel search.
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine. In order to take advantage of the parallel architecture, we extended the Maple kernel with a set of...
详细信息
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine. In order to take advantage of the parallel architecture, we extended the Maple kernel with a set of message passing primitives based on the Paragon's native message passing library. Using these primitives, we implemented a parallel version of Karatsuba multiplication for univariate polynomials over Zp. Our speedup timings illustrate the practicability of our approach. On top of the message passing primitives we have implemented a higher level model of parallelprocessing based on the manager-worker scheme;a Maple application on one node of the parallel machine submits jobs to Maple processes residing on different nodes, then asynchronously collects the results. This model proves to be convenient for interactive usage of a distributed memory machine. Apart from the message passing parallelism we also use localized multi-threading to achieve symmetric multiprocessing within each node of the Paragon. We combine both approaches and apply them to the multiplication of large bivariate polynomials over small prime fields.
Mobile agents are programs that call move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents h...
详细信息
ISBN:
(纸本)0818678704
Mobile agents are programs that call move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributedapplications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, and the specific features that support mobile computers and disconnected operation. These features include network-sensing tools and a docking system that allows an agent to transparently move between mobile computers, regardless of when the computers connect to the network.
Implementing realistic scientific applications on parallel platforms requires a high-level, problem-adequate and flexible programming environment. The hybrid system PROMOTER pursues a two-level approach allowing easy ...
详细信息
ISBN:
(纸本)0818678836
Implementing realistic scientific applications on parallel platforms requires a high-level, problem-adequate and flexible programming environment. The hybrid system PROMOTER pursues a two-level approach allowing easy and flexible programming at both language and library levels. The core concept of PROMOTER's language model is its highly abstract and unified concept of data and communication structures. The paper briefly addresses the programming model, but focuses on implementation aspects of the compiler and runtime system. Finally, performance results are given, evaluating the efficiency of the PROMOTER system.
This paper presents an outline of a parallel algorithm ibr the identification of parameters in the Swartzendruber formula. This formula appears in the mathematical model of the prelinear filtration of ground water. Th...
详细信息
ISBN:
(纸本)3540628282
This paper presents an outline of a parallel algorithm ibr the identification of parameters in the Swartzendruber formula. This formula appears in the mathematical model of the prelinear filtration of ground water. The parameter inverse problem is formulated as an appropriate control problem. The idea of the proposed algorithm (called MSP) is to review large areas of the domain through proper, parallel investigation of many parts of it. The results of numerical tests are included. Some improvements to the algorithm are also proposed.
暂无评论