PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS

1998 ◽  
Vol 09 (04) ◽  
pp. 351-375 ◽  
Author(s):  
PETER CAPPELLO ◽  
ÖMER EĞECIOĞLU
Keyword(s):  
Lower Bound ◽  
Diophantine Equations ◽  
Gaussian Elimination ◽  
Triangular Matrix ◽  
Fixed Time ◽  
Matrix Product ◽  
Time Step ◽  
Linear Diophantine Equations ◽  
Array Computations ◽  
Dag Model

Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules parametrized by n, compute a lower bound on the number of processors required by the schedule as a function of n. In our formulation, the number of tasks that are scheduled for execution during any fixed time step is the number of non-negative integer solutions dn to a set of parametric linear Diophantine equations. We present an algorithm based on generating functions for constructing a formula for these numbers dn. The algorithm has been implemented as a Mathematica program. Example runs and the symbolic formulas for processor lower bounds automatically produced by the algorithm for Matrix-Vector Product, Triangular Matrix Product, and Gaussian Elimination problems are presented. Our approach actually solves the following more general problem: Given an arbitrary r× s integral matrix A and r-dimensional integral vectors b and c, let dn(n=0,1,…) be the number of solutions in non-negative integers to the system Az=nb+c. Calculate the (rational) generating function ∑n≥ 0dntn and construct a formula for dn.

scholarly journals Scientific Programming with High Performance Fortran: A Case Study Using the xHPF Compiler

1997 ◽  
Vol 6 (1) ◽  
pp. 127-152
Author(s):  
Eric De Sturler ◽  
Volker Strumpen
Keyword(s):  
High Performance ◽  
Parallel Implementation ◽  
Gaussian Elimination ◽  
Primary Objective ◽  
Matrix Product ◽  
Dense Matrix ◽  
High Performance Fortran ◽  
Partial Pivoting ◽  
Intel Paragon

Recently, the first commercial High Performance Fortran (HPF) subset compilers have appeared. This article reports on our experiences with the xHPF compiler of Applied Parallel Research, version 1.2, for the Intel Paragon. At this stage, we do not expect very High Performance from our HPF programs, even though performance will eventually be of paramount importance for the acceptance of HPF. Instead, our primary objective is to study how to convert large Fortran 77 (F77) programs to HPF such that the compiler generates reasonably efficient parallel code. We report on a case study that identifies several problems when parallelizing code with HPF; most of these problems affect current HPF compiler technology in general, although some are specific for the xHPF compiler. We discuss our solutions from the perspective of the scientific programmer, and presenttiming results on the Intel Paragon. The case study comprises three programs of different complexity with respect to parallelization. We use the dense matrix-matrix product to show that the distribution of arrays and the order of nested loops significantly influence the performance of the parallel program. We use Gaussian elimination with partial pivoting to study the parallelization strategy of the compiler. There are various ways to structure this algorithm for a particular data distribution. This example shows how much effort may be demanded from the programmer to support the compiler in generating an efficient parallel implementation. Finally, we use a small application to show that the more complicated structure of a larger program may introduce problems for the parallelization, even though all subroutines of the application are easy to parallelize by themselves. The application consists of a finite volume discretization on a structured grid and a nested iterative solver. Our case study shows that it is possible to obtain reasonably efficient parallel programs with xHPF, although the compiler needs substantial support from the programmer.

Coordination sequences and layer-by-layer growth of periodic structures

2019 ◽  
Vol 234 (5) ◽  
pp. 291-299
Author(s):  
Anton Shutov ◽  
Andrey Maleev
Keyword(s):  
Generating Functions ◽  
Diophantine Equations ◽  
Periodic Structures ◽  
Layer Growth ◽  
Layer By Layer ◽  
Explicit Formulas ◽  
New Approach ◽  
Coordination Numbers ◽  
Linear Diophantine Equations ◽  
Recurrent Relations

Abstract A new approach to the problem of coordination sequences of periodic structures is proposed. It is based on the concept of layer-by-layer growth and on the study of geodesics in periodic graphs. We represent coordination numbers as sums of so called sector coordination numbers arising from the growth polygon of the graph. In each sector we obtain a canonical form of the geodesic chains and reduce the calculation of the sector coordination numbers to solution of the linear Diophantine equations. The approach is illustrated by the example of the 2-homogeneous kra graph. We obtain three alternative descriptions of the coordination sequences: explicit formulas, generating functions and recurrent relations.

scholarly journals Improved bounds for the availability and unavailability in a fixed time interval for systems of maintained, interdependent components

1980 ◽  
Vol 12 (01) ◽  
pp. 200-221 ◽  
Author(s):  
B. Natvig
Keyword(s):  
Lower Bound ◽  
System Reliability ◽  
Nuclear Reactors ◽  
Random Variables ◽  
Fixed Time ◽  
Time Interval ◽  
Coherent System ◽  
Exact Results ◽  
Fixed Time Interval ◽  
Special Case

In this paper we arrive at a series of bounds for the availability and unavailability in the time interval I = [t A , t B ] ⊂ [0, ∞), for a coherent system of maintained, interdependent components. These generalize the minimal cut lower bound for the availability in [0, t] given in Esary and Proschan (1970) and also most bounds for the reliability at time t given in Bodin (1970) and Barlow and Proschan (1975). In the latter special case also some new improved bounds are given. The bounds arrived at are of great interest when trying to predict the performance process of the system. In particular, Lewis et al. (1978) have revealed the great need for adequate tools to treat the dependence between the random variables of interest when considering the safety of nuclear reactors. Satyanarayana and Prabhakar (1978) give a rapid algorithm for computing exact system reliability at time t. This can also be used in cases where some simpler assumptions on the dependence between the components are made. It seems, however, impossible to extend their approach to obtain exact results for the cases treated in the present paper.

scholarly journals On the Non-Linear Diophantine Equations 31x + 41y = z2 and 61x + 71y = z2

2018 ◽  
Vol 18 (2) ◽  
pp. 185-188
Author(s):  
Satish Kumar ◽  
◽  
Deepak Gupta ◽  
Hari Kishan
Keyword(s):  
Diophantine Equations ◽  
Linear Diophantine Equations ◽  
Non Linear
Sign in / Sign up

Export Citation Format

Share Document