Database systems engineering
Parallel graph reduction with the (v , G)-machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
ACM SIGMOD Record
GUM: a portable parallel implementation of Haskell
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Experience with the design of a performance tuning tool for parallel programs
Journal of Systems and Software
H/Direct: a binary foreign language interface for Haskell
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Understanding the Performance of Parallel Symbolic Programs
PSLS '95 Proceedings of the International Workshop on Parallel Symbolic Languages and Systems
Self-Describing Files + Smart Modules = Parallel Program Visualization
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
A Strategic Profiler for Glasgow Parallel Haskell
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
An incremental, strongly typed, database query language (functional, combinators)
An incremental, strongly typed, database query language (functional, combinators)
Algorithm + strategy = parallelism
Journal of Functional Programming
Space profiling for parallel functional programs
Journal of Functional Programming
| Hi-index | 0.00 |
The full details of a parallel computation can be very complex. To understand and improve performance one useful resource is a log-file recording all the computational events that change the number or status of parallel tasks. Raw log-files are not easy reading for the programmer, so profiling tools present only graphical summary charts. These charts sometimes show just what the programmer needs to know, but they often become too crowded, or fail to show enough, or both. Moreover, the charts are static so the programmer has little control over what is displayed. In this paper we discuss a tool that combines the advantages of graphical representation of computations with a query interface. The programmer interactively extracts specific information about the computation. Results of queries can be displayed in a graphical form; and parameters of subsequent queries can be specified by pointing within a past display.