A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Empirical Parallel Performance Prediction from Semantics-Based Profiling
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
The PMLS parallelizing compiler for Standard ML is based upon the automatic instantiation of algorithmic skeletons at sites of higher order function use. ...
In this paper, the formulation of a general rule count cost model as a set of over-determined linear equations is discussed, and their solution by singular value decomposition, and by a genetic algorithm ...
We have also adapted one of the example programs for our compiler, a parallel genetic algorithm (GA) [8] , to estimate the parameters for the system. ...
doi:10.1007/11428848_100
fatcat:g45nkf7v4fckliyzud3hhsi43q
Prototyping Parallel Algorithms using Standard ML
1995
Procedings of the British Machine Vision Conference 1995
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Here we demonstrate the power and generality of our approach to parallel algorithm development by a representative set of vision algorithms encoded in SML. ...
We have been developing techniques for deriving parallel implementations of vision algorithms from prototypes written in a functional language (SML). ...
Results from the instrumentation of a functional prototype based on higher order functions, combined with performance models for parallel skeletons, enables the accurate prediction of the behaviour of ...
doi:10.5244/c.9.67
dblp:conf/bmvc/ScaifeMW95
fatcat:z6mko5vvgba3pkdoqcun67u3gq
Discovering applications of higher order functions through proof planning
2005
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The close association between higher order functions (HOFs) and algorithmic skeletons is a promising source of automatic parallelisation of programs. ...
The approach has been implemented in the λClam proof planner and tested on a range of examples. The work was conducted within the context of a parallelising compiler for Standard ML. ...
Acknowledgments This work was supported by UK EPSRC grant GR/L42889, "Parallelising compilation of Standard ML through prototype instrumentation and transformation". ...
doi:10.1007/s00165-004-0054-5
fatcat:r33urpmtivfolpzxpg4636fjxa
Static dependent costs for estimating execution time
1994
Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We present experimental results that validate our cost system on three compilers and architectures. ...
In particular, a procedure's static dependent cost can depend on the size of input data structures and the cost of input rst-class procedures. ...
We used the SML NJ compiler version 0.93 on a Sparc IPX to run experiments after a simple syntactic translation from FX SDC to ML. ...
doi:10.1145/182409.182439
dblp:conf/lfp/ReistadG94
fatcat:7y7elngrg5hghktr5gjqd7zi6q
Static dependent costs for estimating execution time
1994
ACM SIGPLAN Lisp Pointers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We present experimental results that validate our cost system on three compilers and architectures. ...
In particular, a procedure's static dependent cost can depend on the size of input data structures and the cost of input rst-class procedures. ...
We used the SML NJ compiler version 0.93 on a Sparc IPX to run experiments after a simple syntactic translation from FX SDC to ML. ...
doi:10.1145/182590.182439
fatcat:bpvoh6lbyndwnpgkspumnvqfjy
Characterising Effective Resource Analyses for Parallel and Distributed Coordination
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We outline a continuum of coordination cost models and a range of analysis techniques. ...
Given the spectrum of cost models and associated analysis techniques available, what combination should be selected for a specific parallel or distributed context? We address the question as follows. ...
The dynamic component is implemented on a Sequent Symmetry shared-memory machine on top of a parallel SML/NJ implementation. ...
doi:10.1007/978-3-642-15331-0_5
fatcat:v3nemcm36vcyfg4ms2igfeauna
OSL: An Algorithmic Skeleton Library with Exceptions
2013
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Algorithmic skeletons, that are patterns of parallel algorithms on distributed data structures, offer such a structured model. ...
However very few algorithmic skeleton libraries provide a specific parallel exception mechanism, and no C++-based library. ...
A skeleton often captures the pattern of a classical parallel algorithm such as a pipeline, a parallel reduction, or parallel operations on distributed collections. ...
doi:10.1016/j.procs.2013.05.189
fatcat:i4kmmoudl5a7zcxqs7fczuedn4
Resource analyses for parallel and distributed coordination
2011
Concurrency and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper surveys one particularly important application area, namely parallel or distributed computing. ...
and depends on the near-optimal deployment of the processors to share the potentially parallel portion. ...
The compiler analysed SML programs to identify HOFs that could be used as loci of potential parallelism. These were then realised by instantiating the corresponding parallel algorithmic skeletons. ...
doi:10.1002/cpe.1898
fatcat:abmlmqopxraofkdqbvk5r575ya
Page 7824 of Mathematical Reviews Vol. , Issue 2003j
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Michaelson and Susumu Horiguchi, Com- parative cross-platform performance results from a parallelizing SML compiler (138-154); Yasuhiko Minamide, Runtime behavior of conversion interpretation of subtyping ...
ISBN 3-540-43537-9
Contents: Ricardo Pena and Clara Segura, Sized types for typ- ing Eden skeletons (1-17); Dietmar Kreye, A compilation scheme
68 COMPUTER SCIENCE
7824
for a hierarchy of array types ( ...
Automatic parallelization of canonical loops
2013
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Automatic parallelization allows application developers to focus on the algorithmic details of the problem they are solving, leaving for the compiler the task of generating correct and efficient parallel ...
This paper presents a compilation technique that performs automatic parallelization of canonical loops. ...
, are parallel skeletons [Cole 1988 ]. ...
doi:10.1016/j.scico.2012.09.006
fatcat:ej63dromjzbfffgmwt22cklwka
Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an Isabelle/HOL formalization of Gabow's algorithm for finding the strongly connected components of a directed graph. ...
Using data refinement techniques, we extract efficient code that performs comparable to a reference implementation in Java. ...
of a path-based algorithm path-based algorithms, and can be used as a starting point for defining the actual algorithms. ...
doi:10.1007/978-3-319-08970-6_21
fatcat:p4akokmztnetbmlat5bf37ahva
SPINET: A Parallel Computing Approach to Spine Simulations
1996
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A finite element program for static analysis has been parallelized for the MUSIC machine. ...
Research in scientitic programming enables us to realize more and more complex applications, and on the other hand, application-driven demands on computing methods and power are continuously growing. ...
The two approaches are based on a conjugate gradient solver and a frontal solver. ...
doi:10.1155/1996/607139
fatcat:yrxumawmtbaubcy6h2q62o6fa4
Why Parallel Functional Programming Matters: Panel Statement
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Thus, no implementation based on a xed set of skeletons can hope to be completely general. ...
Algorithmic S k eletons Algorithmic skeletons were so named by Cole 31] . ...
doi:10.1007/978-3-642-21338-0_17
fatcat:n3tvygfvdbcrpmmbrnxn7xshcq
Implicit parallel programming in pH by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001
2003
Journal of functional programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Having been out of academia for a number of years, I jumped at the chance to review these volumes, seeing this as an opportunity to get back up to speed with what was happening with the functional programming ...
algorithmic skeleton libraries to pH systems. ...
The first one is the algorithmic skeletons paradigm introduced by Murray Cole where specific higher-order functions are given well-understood parallel semantics with known complexities and used to express ...
doi:10.1017/s0956796803224874
fatcat:4nf5exqfbrewdc5m3ptlxwlnh4
Pushing the Level of Abstraction of Digital System Design: a Survey on How to Program FPGAs
2022
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We review these abstraction solutions, provide a timeline, and propose a taxonomy for each abstraction trend: programming models for HDLs; IP-based or System-based toolchains for HLS; application, architecture ...
Therefore, researchers focused on FPGA abstractions and automation tools. ...
ACKNOWLEDGEMENTS The authors are grateful for feedbacks from Reviewers and NECSTLab members, with a particular mention to A. Damiani, A. Parravicini, E. D'Arnese, F. Carloni, F. Peverelli, and R. ...
doi:10.1145/3532989
fatcat:nsk5lwvt3vba5fbxmaj7sgpwru
« Previous
Showing results 1 — 15 out of 80 results