Repeating history : execution replay for Parallel Haskell programs
MetadataShow full item record
Parallel profiling tools, such as ThreadScope for Parallel Haskell, allow programmers to obtain information about the performance of their parallel programs. However, the information they provide is not always sufficiently detailed to precisely pinpoint the cause of some per- formance problems. Often, this is because the cost of obtaining that information would be prohibitive for a complete program execution. In this paper, we adapt the well-known technique of execution replay to make it possible to simulate a previous run of a program. We ensure that the non-deterministic parallel behaviour of the application is prop- erly emulated while the deterministic functional code is run unmodified. In this way, we can gather additional data about the behaviour of a par- allel program by replaying some parts of it with more detailed profiling information. We exploit this ability to identify performance bottlenecks in a quicksort implementation, and to derive a version that gives better speedups on multicore machines.
Ferrerio , H , Janjic , V , Castro , L & Hammond , K 2013 , Repeating history : execution replay for Parallel Haskell programs . in Trends in Functional Programming : 13th International Symposium . vol. 7829 , Lecture Notes in Computer Science (LNCS) , Springer , pp. 231-246 . DOI: 10.1007/978-3-642-40447-4_15
Trends in Functional Programming
© 2013. Springer-Verlag Berlin Heidelberg. This is an Accepted Manuscript of an article published in Lecture Notes on Computer Science, subseries Trends in Functional Programming 2013. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40447-4_15
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.