A note on the height of binary search trees
Journal of the ACM (JACM)
The art of Prolog: advanced programming techniques
The art of Prolog: advanced programming techniques
Parsing and compiling using Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
A relational approach to monitoring complex systems
ACM Transactions on Computer Systems (TOCS)
Computer-assisted microanalysis of programs
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Distributed Prolog System with And Parallelism
IEEE Software
DPM: A Measurement System for Distributed Programs
IEEE Transactions on Computers
Natural Language Communication with Computers
Parallel Quicksort: an exploration of concurrent programming in Ada
ACM SIGAda Ada Letters
The last mile: parallel programming and usability
Proceedings of the FSE/SDP workshop on Future of software engineering research
| Hi-index | 0.00 |
This paper consists of two parts: the first provides the theoretical foundations for analyzing parallel programs and illustrates how the theory can be applied to estimate the execution time of a class of parallel programs being executed on a MIMD computer. The second part describes a program analysis system, based on the theoretical model, which allows a user to interactively analyze the results of executing (or simulating the execution) of such parallel programs. Several examples illustrating the use of the tool are presented. A novel contribution is the separation (both at the conceptual and the implementation levels) of the machine-independent and the machine-dependent parts of the analysis. This separation enables the users of the system to establish speed-up curves for machines having varying characteristics.