检索结果-内蒙古大学图书馆

35th Symposium on Implementation and Application of functional Languages (IFL)

作者： Krook, Robert Smallbone, Nicholas Svensson, Bo Joel Claessen, Koen Chalmers Univ Technol Gothenburg Sweden Lind Art & Technol Stockholm Sweden

ISBN: (纸本)9798400716317

This paper introduces a new parallel run-time for QuickCheck, a Haskell library and EDSL for specifying and randomly testing properties of programs. The new run-time can run multiple tests for a single property in parallel, using the available cores. Moreover, if a counterexample is found, the run-time can also shrink the test case in parallel, implementing a parallel search for a locally minimal counterexample. Our experimental results show a 3-9x speed-up for testing QuickCheck properties on a variety of heavy-weight benchmark problems. We also evaluate two different shrinking strategies;deterministic shrinking, which guarantees to produce the same minimal test case as standard sequential shrinking, and greedy shrinking, which does not have this guarantee but still produces a locally minimal test case, and is faster in practice.

关键词： property-based testing quickcheck testing parallel functional programming haskell

来源：评论

学校读者我要写书评

暂无评论

Accelerating Nested Data parallelism: Preserving Regularity 26th

Accelerating Nested Data Parallelism: Preserving Regularity

引用

26th International Conference on parallel and Distributed Computing (Euro-Par)

作者： van den Haak, Lars B. McDonell, Trevor L. Keller, Gabriele K. de Wolff, Ivo Gabe Eindhoven Univ Technol Eindhoven Netherlands Univ Utrecht Utrecht Netherlands

ISBN: (纸本)9783030576752;9783030576745

Irregular nested data-parallelism is a powerful programming model which enables the expression of a large class of parallel algorithms. However, it is notoriously difficult to compile such programs to efficient code for modern parallel architectures. Regular data-parallelism, on the other hand, is much easier to compile to efficient code, but too restricted to express some problems conveniently or in a manner to exploit the full parallelism. We extend the regular data-parallel programming model to allow for the parallel execution of array-level conditionals and iterations over irregular nested structures, and present two novel static analyses to optimise the code generated for these programs which reduces the costs of this more powerful irregular model. We present benchmarks to support our claim that these extensions are effective as well as feasible, as they enable to exploit the full parallelism of an important class of algorithms, and together with our optimisations lead to an improvement in absolute performance over an implementation limited to exploiting only regular parallelism.

关键词： Arrays GPGPU Nested data parallelism parallel functional programming

来源：评论

学校读者我要写书评

暂无评论

Colocation of Potential parallelism in a Distributed Adaptive Run-Time System for parallel Haskell 1

引用

19th International Symposium on Trends in functional programming (TFP)

作者： Belikov, Evgenij Loidl, Hans-Wolfgang Michaelson, Greg Heriot Watt Univ Sch Math & Comp Sci Edinburgh EH14 4AS Midlothian Scotland

ISBN: (数字)9783030185060

ISBN: (纸本)9783030185060;9783030185053

This paper presents a novel variant of work stealing for load balancing in a distributed graph reducer, executing a semi-explicit parallel dialect of Haskell. The key concept of this load-balancer is colocating related sparks (potential parallelism) using maximum prefix matching on the encoding of the spark's ancestry within the computation tree, reconstructed at run time, in spark selection decisions. We evaluate spark colocation in terms of performance and scalability on a set of five benchmarks on a Beowulf-class cluster of multi-core machines using up to 256 cores. In comparison to the baseline mechanism, we achieve speedup increase of up to 46% for three out of five applications, due to improved locality and load balance throughout the execution as demonstrated by profiling data. For one less scalable program and one program with excessive amounts of very fine-grained parallelism we observe drops in speedup by 17% and 42%, respectively. Overall, spark colocation results in reduced mean time to fetch the required data and in higher degree of parallelism of finer granularity, which is most beneficial on higher PE numbers.

关键词： parallel functional programming Graph reduction Load balancing Distributed-memory work stealing Adaptive parallelism

来源：评论

学校读者我要写书评

暂无评论

Reliable scalable symbolic computation: The design of SymGridPar2

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2014年第1期40卷 19-35页

作者： Maier, P. Stewart, R. Trinder, P. W. Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland Heriot Watt Univ Sch Math & Comp Sci Edinburgh Midlothian Scotland

Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly irregular parallelism. The SymGridPar framework (SGP) has been developed to address these challenges on small-scale parallel architectures. However the multicore revolution means that the number of cores and the number of failures are growing exponentially, and that the communication topology is becoming increasingly complex. Hence an improved parallel symbolic computation framework is required. This paper presents the design and initial evaluation of SymGridPar2 (SGP2), a successor to SymGridPar that is designed to provide scalability onto 10(5) cores, and hence also provide fault tolerance. We present the SGP2 design goals, principles and architecture. We describe how scalability is achieved using layering and by allowing the programmer to control task placement. We outline how fault tolerance is provided by supervising remote computations, and outline higher-level fault tolerance abstractions. We describe the SGP2 implementation status and development plans. We report the scalability and efficiency, including weak scaling to about 32,000 cores, and investigate the overheads of tolerating faults for simple symbolic computations. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： parallel functional programming Locality control Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Reliable scalable symbolic computation: The design of SymGridPar2

Reliable scalable symbolic computation: The design of SymGri...

引用

28th ACM Symposium on Applied Computing (SAC) on programming Languages Track

作者： Maier, P. Stewart, R. Trinder, P. W. Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland Heriot Watt Univ Sch Math & Comp Sci Edinburgh Midlothian Scotland

关键词： parallel functional programming Locality control Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Seq no more: Better Strategies for parallel Haskell

Seq no more: Better Strategies for Parallel Haskell

引用

3rd ACM Haskell Symposium on Haskell

作者： Marlow, Simon Maier, Patrick Loidl, Hans-Wolfgang Aswad, Mustafa K. Trinder, Phil Microsoft Res Cambridge England Heriot Watt Univ Edinburgh Midlothian Scotland

ISBN: (纸本)9781450302524

We present a complete redesign of evaluation strategies, a key abstraction for specifying pure, deterministic parallelism in Haskell. Our new formulation preserves the compositionality and modularity benefits of the original, while providing significant new benefits. First, we introduce an evaluation-order monad to provide clearer, more generic, and more efficient specification of parallel evaluation. Secondly, the new formulation resolves a subtle space management issue with the original strategies, allowing parallelism (sparks) to be preserved while reclaiming heap associated with superfluous parallelism. Related to this, the new formulation provides far better support for speculative parallelism as the garbage collector now prunes unneeded speculation. Finally, the new formulation provides improved compositionality: we can directly express parallelism embedded within lazy data structures, producing more compositional strategies, and our basic strategies are parametric in the coordination combinator, facilitating a richer set of parallelism combinators. We give measurements over a range of benchmarks demonstrating that the runtime overheads of the new formulation relative to the original are low, and the new strategies even yield slightly better speedups on average than the original strategies.

关键词： Performance Measurement parallel functional programming Strategies

来源：评论

学校读者我要写书评

暂无评论

Seq no more: Better Strategies for parallel Haskell

引用

ACM SIGPLAN NOTICES 2010年第11期45卷 91-102页

作者： Marlow, Simon Maier, Patrick Loidl, Hans-Wolfgang Aswad, Mustafa K. Trinder, Phil Microsoft Res Cambridge England Heriot Watt Univ Edinburgh Midlothian Scotland

关键词： Performance Measurement parallel functional programming Strategies

来源：评论

学校读者我要写书评

暂无评论

Distributed Memory programming on Many-Cores A Case Study Using Eden Divide-&-Conquer Skeletons

Distributed Memory Programming on Many-Cores A Case Study Us...

引用

22th International Conference on Architecture of Computing Systems 2009

作者： Jost Berthold Mischa Dieterle Oleg Lobachev Rita Loogen Phillips-Universität Marburg Fachbereich Mathematik und Informatik

ISBN: (纸本)9783800731336

Eden is a parallel extension of the lazy functional language Haskell providing dynamic process creation and automatic data exchange. As a Haskell extension, Eden takes a high-level approach to parallel programming and thereby simplifies parallel program development. The current implementation is tailored to networks of workstations. Recent work has shown that this implementation shows surprisingly competitive performance on many-core machines, compared to dedicated shared-memory implementations of parallel Haskell. In the paper we describe a case study with different Eden divide-and-conquer skeletons. We analyse their performance comparing example applications implemented using these Eden skeletons against parallel Haskell implementations using shared memory on many-core machines.

关键词： parallel functional programming Divide-and-conquer skeletons core machine functional programming Skeletons networks of workstations Case studies programming shared memory parallel programming distributed memory

来源：评论

学校读者我要写书评

暂无评论

THE IMPACT OF DYNAMIC CHANNELS ON functional TOPOLOGY SKELETONS

引用

parallel PROCESSING LETTERS 2008年第1期18卷 101-115页

作者： Berthold, Jost Loogen, Rita Philipps Univ Marburg Fachbereich Math & Informat Hans Meerwein Str D-35032 Marburg Germany

parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent and child processes. Hence, messages between siblings must be passed via the parent causing inefficiencies that can be avoided by direct communication between arbitrary processes. The Eden parallel functional language provides dynamic channels to implement arbitrary communication topologies. This paper analyses the impact of dynamic channels on Eden's topology skeletons, i.e. skeletons which define process topologies such as rings, toroids, or hypercubes. We compare topology skeletons with and without dynamic channels with respect to runtime and communication. Our case studies confirm that dynamic channels decrease the number of messages by up to 50% and substantially reduce runtime. Detailed analyses of EdenTV (Eden trace viewer) execution profiles reveal a bottleneck in the root process when only hierarchical channel connections are used and a better distribution of communications with dynamic channels.

关键词： parallel functional programming communication topologies topology skeletons channel-based communication performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Analyzing the influence of mixed evaluation on the performance of Eden skeletons

引用

parallel COMPUTING 2006年第7-8期32卷 523-538页

作者： Hidalgo-Herrero, Mercedes Ortega-Mallen, Yolanda Rubio, Fernando Univ Complutense Madrid Dpto Sistemas Informat & Programac E-28040 Madrid Spain Univ Complutense Madrid Dpto Didact Matemat E-28040 Madrid Spain

A key point in the efficiency of parallel programs is the distribution of computation among processes. Haskell parallel dialects-like Eden-use mixed lazy and strict evaluation, and parallel performance is determined by the strategy used. We investigate how alternative evaluation models influence Eden skeletons performance using an implementation of Eden's operational semantics. More concretely, we have chosen the parallel Divide-and-Conquer skeleton for our comparative analysis. Here we show the measures obtained for a simple program but using different mixed evaluation strategies, and we analyze the advantages and drawbacks of each of them. (c) 2006 Elsevier B.V. All rights reserved.

关键词： parallel functional programming Skeletons Semantics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：