Higher Order Parallel Research Articles

Parallelism in a Region Inference Context

Region inference is a type-based program analysis that takes a non-annotated program as input and constructs a program that explicitly manages memory allocation and deallocation by dividing the heap into a stack of regions, each of which can grow and shrink independently from other regions, using constant-time operations. Whereas region-based memory management has shown useful in the contexts of explicit region-based memory management, and in particular, in combination with parallel execution of code, combining region inference with techniques for higher-order parallel programming has not been investigated. In this paper, we present an implementation of a fork-join parallel construct suitable for a compiler based on region inference. We present a minimal higher-order language incorporating the parallel construct, including typing rules and a dynamic semantics for the language, and demonstrate type soundness. We present a novel effect-based region-protection inference algorithm and discuss benefits and shortcomings of the approach. We also describe an efficient implementation embedded in the MLKit Standard ML compiler. Finally, we evaluate the approach and the implementation based on a number of parallel benchmarks, and thereby demonstrate that the technique effectively utilises multi-core architectures in a higher-order functional setting.

Affine Hypersurfaces of Arbitrary Signature with an Almost Symplectic Form

In this paper we study affine hypersurfaces with non-degenerate second fundamental form of arbitrary signature additionally equipped with an almost symplectic structure omega . We prove that if R^pomega =0 or nabla ^pomega =0 for some positive integer p then the rank of the shape operator is at most one. The results provide complete classification of affine hypersurfaces with higher order parallel almost symplectic forms and are generalization of recently obtained results for Lorentzian affine hypersurfaces.

On 4‐dimensional Lorentzian affine hypersurfaces with an almost symplectic form

AbstractIn this paper we study 4‐dimensional affine hypersurfaces with a Lorentzian second fundamental form additionally equipped with an almost symplectic structure ω. We prove that the rank of the shape operator is at most one if or for some positive integer k. This result is the final step in a classification of Lorentzian affine hypersurfaces with higher order parallel almost symplectic forms.

Realization of an nth-order parallel immittance function employing only (n − 1) FTFNs

A novel realization of higher-order parallel immittance functions using four-terminal flooding nullors (FTFNs) is presented. It can be used to carry out the immittance function systematically. Only (n − 1) FTFNs and (2n − 1) passive elements are required for realizing an nth-order parallel immittance, having the capability of orthogonal adjustability of all immittance values. The use of the FTFN as an active element simplifies the circuit implementation and makes it attractive for practical application. Filter circuits are used to verify the theoretical analysis by HSPICE. Simulation results support the proposed approach

Parallel Sequence Matching with TACO's Distributed Object Groups – A Case Study from Molecular Biology

TACO is a template library that implements higher-order parallel operations on distributed object sets by means of reusable topology classes and C++ function templates. In this paper we discuss an experimental application that exploits TACO's distributed object groups and collective operations for computing the similarity between groups of molecular sequences, a computationally intensive core problem in molecular biology research. In particular we show how TACO's distributed collections can be conveniently combined with well known concepts found in the C++ standard template library (STL) to solve matching and sorting problems effectively on distributed hardware platforms. The resulting implementation is concise and gives excellent parallel performance on PC- and workstation clusters.

Higher-order parallel methods for a model of percutaneous drug absorption

A number of parallel algorithms based on higher-order Pade approximations are developed for the numerical solution of a mathematical model of percutaneous drug absorption. These methods are L o-stable and require only the application of tridiagonal solvers with complex arithmetic.

Parallel algorithms for solving initial value problems: front broadening and embedded parallelism

This paper reviews and develops i) broadening of the computation front (BCF) techniques, and ii) block implicit (BI) methods to speed up the numerical solution of IVPS in ODEs by using MIMD computing systems. In particular consideration is given to the performance, accuracy and stability characteristics of the techniques and possible extension of the BCF methods to improve the accuracy. It has been shown that it is not possible to get fourth and higher order parallel explicit Runge-Kutta (RK) methods by using the BCF techniques. This paper also characterizes some of the drawbacks of BCF and considers two further techniques to exploit the parallelism embedded in BI methods.

Affine surfaces with higher order parallel cubic form

Affine surfaces with higher order parallel cubic form

Higher order parallel submanifolds of a complex space form

Higher order parallel submanifolds of a complex space form