Results 1  10
of
67
On the Portability and Efficiency of Parallel Algorithms and Software
 Delft University of Technology
, 1994
"... Parallel software development must face the fact that different architectures require different implementations. Flexibility in modifying parallel methods and software is necessary because the efficiency of algorithms is dependent on the characteristics of the target computer. Furthermore different ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Parallel software development must face the fact that different architectures require different implementations. Flexibility in modifying parallel methods and software is necessary because the efficiency of algorithms is dependent on the characteristics of the target computer. Furthermore different
Data abstractions for portable parallel codes
"... Development of parallel software is a very complex task. Many details, such as domain type, partition method, or mapping scheme, should be considered during the implementation phase. However, they are usually taken into account in the design phase because the developers do not have the appropriate a ..."
Abstract
 Add to MetaCart
abstractions. This causes that small conceptual changes, for example a modification in the distribution policy, imply the developing of an application from scratch. The result is that it is not always possible to obtain portable and efficient parallel codes. In this paper, we present a programming methodology
Portable Vectorized Software for Bessel Function Evaluation
 ACM Trans. Math. Software
, 1992
"... A suite of computer programs for the evaluation of Bessel functions and modified Bessel functions of orders zero and one for a vector of real arguments is described. Distinguishing characteristics of these programs are that (a) they are portable across a wide range of machines, and (b) they are vect ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
algorithms; G.1.2 [Numerical Analysis]: ApproximationChebyshev approximation and theory, elementary function approximation; G.4 [Mathematics of Computing]: Mathematical Softwarealgorithm analysis, efficiency, portability General Terms: Algorithms Additional Keywords and Phrases: Bessel function
Efficient Algorithms for Cyclic Scheduling
 Res. Rep. RC 17068, IBM T. J. Watson
, 1991
"... This work addresses the problem of nonpreemptively scheduling a cyclic set of interdependent operations, representing for instance a program loop, when p identical processors are available. For p = 1 we give a simple, efficient, polynomial time algorithm producing optimum results. When p ! 1 the ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This work addresses the problem of nonpreemptively scheduling a cyclic set of interdependent operations, representing for instance a program loop, when p identical processors are available. For p = 1 we give a simple, efficient, polynomial time algorithm producing optimum results. When p ! 1
A Parallel Software Infrastructure for Structured Adaptive Mesh Methods
 in Proceedings of Supercomputing '95, IEEE Computer
, 1995
"... Structured adaptive mesh algorithms dynamically allocate computational resources to accurately resolve interesting portions of a numerical calculation. Such methods are difficult to implement and parallelize because they rely on dynamic, irregular data structures. We have developed an efficient, por ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
Structured adaptive mesh algorithms dynamically allocate computational resources to accurately resolve interesting portions of a numerical calculation. Such methods are difficult to implement and parallelize because they rely on dynamic, irregular data structures. We have developed an efficient
Parallel Implementation
"... of some characteristics of softwares for parallel computer algebra. SBSH means Sugarbush. PCLBSTM means PACLIB/STURM and PCGVR PAC/GIVARO. Conclusions. Major problems that appears in the design and implementation of parallel computer algebra systems (online scheduling of tasks, distributed garbag ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
huge libraries of complex algorithms. Second, active research should be done in the design of efficient and portable parallel algorithms for more complex problems. Thierry Gautier (INRIA, LMCIMAG), Hoon Hong (NCSU), JeanLouis Roch (LMCIMAG), Gilles Villard (CNRS, LMCIMAG), Wolfgang Schreiner
Parallel Algorithms for Inductance Extraction of VLSI Circuits ∗
"... Inductance extraction involves estimating the mutual inductance in a VLSI circuit. Due to increasing clock speed and diminishing feature sizes of modern VLSI circuits, the effects of inductance are increasingly felt during the testing and verification stages. Hence, there is a need for fast and accu ..."
Abstract
 Add to MetaCart
step as well. A twotier parallelization scheme allows an efficient parallel implementation using both OpenMP and MPI directives simultaneously. The experiments conducted on various multiprocessor machines demonstrate the portability and parallel performance of the software.
Highlevel Abstractions for Performance, Portability and Continuity of Scientific Software on Future Computing Systems
, 2014
"... In this report we present research on applying a domain specific highlevel abstractions development strategy with the aim to “futureproof “ a key class of high performance computing (HPC) applications that simulate hydrodynamics computations at AWE plc. We build on an existing highlevel abstrac ..."
Abstract
 Add to MetaCart
level abstraction framework, OPS, that is being developed for the solution of multiblock structured meshbased applications at the University of Oxford. The target application, is an unclassified benchmark application, CloverLeaf, that consists of algorithms of interest from the hydrodynamics workload at AWE plc
Paradigms for Parallel Distributed Programming
 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'96). v.2
, 1996
"... The work proposes a new classification of parallel algorithm schemes to program multicomputer systems, these schemes being called paradigms. The proposed classification is intended to improve the programmability and portability of distributed parallel algorithms derived with these paradigms. In ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The work proposes a new classification of parallel algorithm schemes to program multicomputer systems, these schemes being called paradigms. The proposed classification is intended to improve the programmability and portability of distributed parallel algorithms derived with these paradigms
An ArchitectureIndependent Parallel Implicit Flow Solver with Efficient I/O
 8 th SIAM Conf. Parallel Proc. for Scientific Computing
, 1997
"... The design and performance of the implicit flow solver RANSMP are discussed. The efficient bidirectional multipartition solver algorithm, in conjunction with the MPI and newly developed MPI I/O libraries, leads to truly portable program text and performance. Computational results are presented ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The design and performance of the implicit flow solver RANSMP are discussed. The efficient bidirectional multipartition solver algorithm, in conjunction with the MPI and newly developed MPI I/O libraries, leads to truly portable program text and performance. Computational results
Results 1  10
of
67