Static Performance Prediction of Skeletal Parallel Programs

Hayashi, Yasushi; Cole, Murray

doi:10.1080/10637190208941434

Cited by 11 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hierarchical approaches were also proposed in [4]. Parallel algorithmic skeleton are often use to proposed a cost prediction based on a structured approach, as in [9]. In [12], a shape analysis techniques developed in the fish programming language is used to propose language with an accurate, portable cost model.…”

Section: Related Workmentioning

confidence: 99%

Toward Performance Prediction for Multi-BSP Programs in ML

Allombert¹,

Gava²,

Tesson³

2018

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

bsml and multi-ml are functional parallel programming languages "à la ml" based of the respectively the bsp and multi-bsp bridging models. multi-bsp extends bsp to take into account hierarchical architectures. For both models, it is possible to predict the performances of algorithms thanks to embedded cost models. To do so, we propose formal operational semantics with cost annotations for the two aforementioned languages. This work has been done in a incremental manner. First we recall the cost semantics of core-ml language. Then, we adapt it to bsml and then to multi-ml. It is then possible to evaluate the cost of a program following the annotated semantics. Finally, we compare the theoretical approach with the current implementation on a code example.

show abstract

Section: Related Workmentioning

confidence: 99%

Toward Performance Prediction for Multi-BSP Programs in ML

Allombert¹,

Gava²,

Tesson³

2018

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

show abstract

“…The importance of estimating the QoS of parallel applications is a widely recognised issue in the parallel design pattern community. [18] and [15] were among the earliest works to estimate the QoS of parallel applications. Given an application defined as a composition of data parallel patterns, [18] exploits a differential equation solver composition to generate alternative compositions, and to estimate the QoS, thus enabling their comparison.…”

Section: Related Workmentioning

confidence: 99%

“…Given an application defined as a composition of data parallel patterns, [18] exploits a differential equation solver composition to generate alternative compositions, and to estimate the QoS, thus enabling their comparison. [15] instead translates a data parallel application into a program written in an intermediate language, and it abstractly interprets the obtained program to estimate the QoS of the original application. Both [18] and [15] differ from our approach since they target data parallel patterns and since they do not cope with non-determinism.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analysing Multiple QoS Attributes in Parallel Design Patterns-Based Applications

Brogi

Danelutto

Sensi

et al. 2016

Int J Parallel Prog

View full text Add to dashboard Cite

Parallel design patterns can be fruitfully combined to develop parallel software applications. Different combinations of patterns can feature different QoS while being functionally equivalent. To support application developers in selecting the best combinations of patterns to develop their applications, we hereby propose a probabilistic approach that permits analysing, at design time, multiple QoS attributes of parallel design patterns-based application. We also present a proof-of-concept implementation of our approach, together with some experimental results

show abstract

“…pthreads, OpenMP, etc. Algorithmic skeletons also provide good structural cost models [14,20]. In this paper, we will use four basic parallel skeletons, each of which operates over a stream of input values, producing a stream of results: task farms, pipelines, feedbacks, and divide-andconquer.…”

Section: Structured Parallel Programsmentioning

confidence: 99%

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

2016

View full text Add to dashboard Cite

The increasing importance of parallelism has motivated the creation of better abstractions for writing parallel software, including structured parallelism using nested algorithmic skeletons. Such approaches provide high-level abstractions that avoid common problems, such as race conditions, and often allow strong cost models to be defined. However, choosing a combination of algorithmic skeletons that yields good parallel speedups for a program on some specific parallel architecture remains a difficult task. In order to achieve this, it is necessary to simultaneously reason both about the costs of different parallel structures and about the semantic equivalences between them. This paper presents a new type-based mechanism that enables strong static reasoning about these properties. We exploit well-known properties of a very general recursion pattern, hylomorphisms, and give a denotational semantics for structured parallel processes in terms of these hylomorphisms. Using our approach, it is possible to determine formally whether it is possible to introduce a desired parallel structure into a program without altering its functional behaviour, and also to choose a version of that parallel structure that minimises some given cost model.

show abstract

Static Performance Prediction of Skeletal Parallel Programs

Cited by 11 publications

References 11 publications

Toward Performance Prediction for Multi-BSP Programs in ML

Toward Performance Prediction for Multi-BSP Programs in ML

Analysing Multiple QoS Attributes in Parallel Design Patterns-Based Applications

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Contact Info

Product

Resources

About