Corpus ID: 57819447

Shape Analysis for Parallel Computing

@inproceedings{Jay1995ShapeAF,
  title={Shape Analysis for Parallel Computing},
  author={C. Jay},
  year={1995}
}
  • C. Jay
  • Published 1995
  • Computer Science
Shapes are also known as (data) structures, containers, or indexing systems. They are used extensively in parallel computing to determine communication strategies, load-balancing, evaluation strategies, etc. Although widely used, most applications of shape are ad hoc, and may occur either during compilation, optimisation or at run-time. A primary goal of shape theory is to organise these techniques under a single umbrella, supported by a simple semantics. This paper focuses on potential… Expand
Exploiting Shape in Parallel ProgrammingC
Shape theory is a new approach to data types and programming based on the separation of a data type into its \shape" and \data" parts. Shape is common in parallel computing. This paper identi esExpand
Exploiting shape in parallel programming
  • C. Jay, D. G. Clarke, J. Edwards
  • Computer Science
  • Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, ICA/sup 3/PP '96
  • 1996
TLDR
This paper identifies areas where the explicit use of shape reduces the burden of programming a parallel computer, using examples from an implementation of Cholesky decomposition. Expand
Shape Analysis of Functional Programs with Algebraic Data Types
Data distribution algebras are an abstract notion for the description of parallel programs. Their dynamic execution can be optimized if they are shapely. In this paper we describe a shape analysisExpand
Shapeliness analysis of functional programs with algebraic data types
TLDR
A shape analysis which allows compile-time shapeliness-tests is described which operates on the structure of algebraic data types and works for arbitrary functional programs rather than only shapely ones and besides a first-order calculus is proposed which can handle higher-order functions. Expand
Shape-based cost analysis of skeletal parallel programs
TLDR
This work presents an automatic cost-analysis system for an implicitly parallel skeletal programming language and achieves the first automated analysis of a complete derivation, the well known maximum segment sum algorithm of Skillicorn and Cai. Expand
A cost analysis for a higher-order parallel programming model
TLDR
The main contribution of the thesis is the cost model which aims to predict realistic performances and which considers several possible parallel implementations for a given program before selecting a cost-e ective one. Expand
The Transformational Derivation of Parallel Programs Using Data-distribution Algebras and Skeletons
The transformational derivation of parallel programs for distributed-memory architectures using skeleton-based approaches is one of the most promising methods for parallel program development. TheseExpand
- Dimension and Shape Invariant Array Programming : The Implementation and the Application
-Designing an architecture to handle large conceptual data blocks is very much needed. This paper implements a model for the shape and dimension invariant programming of arrays based on the notationExpand
Functorial Ml Capsule Review
We present an extension of the Hindley-Milner type system that supports a generous class of type constructors called functors, and provide a parametrically polymorphic algorithm for their mapping,Expand
STATIC PERFORMANCE PREDICTION OF SKELETAL PARALLEL PROGRAMS
TLDR
This work constitutes the first completely static system to account for both computation and communication in such a context and presents details of the language and its BSP implementation strategy together with an account of the analysis mechanism. Expand
...
1
2
...

References

SHOWING 1-3 OF 3 REFERENCES
A Semantics for Shape
  • C. Jay
  • Computer Science
  • Sci. Comput. Program.
  • 1995
TLDR
The shapely types are closed under the formation of fixpoints, and hence include the usual algebraic types of lists, trees, etc, and include other standard data structures such as arrays, graphs and records. Expand
Matrices, Monads and the Fast Fourier Transform
This paper presents a formal semantics for vectors and matrices, suitable for static type-checking. This is not available in apl, which produces run-time type errors, or in the usual functionalExpand
Covariant Types
  • C. Jay
  • Computer Science
  • Theor. Comput. Sci.
  • 1997
TLDR
This work suggests a new approach to the semantics of system F, and new ways of basing type systems on the categorical notions of functor and natural transformation. Expand