Loading...
Please wait, while we are loading the content...
Similar Documents
Calculating Lenient Programs' Performance
| Content Provider | Semantic Scholar |
|---|---|
| Author | Roe, P. |
| Copyright Year | 1990 |
| Abstract | Lenient languages, such as Id Nouveau, have been proposed for programming parallel computers. These languages represent a compromise between strict and lazy languages. The operation of parallel languages is very complex; therefore a formal method for reasoning about their performance is desirable. This paper presents a non-standard denotational semantics for calculating the performance of lenient programs. The semantics is novel in its use of time and time-stamps. 1 Motivation Recently interest has grown in parallel programming using functional languages, particularly lenient languages such as Id Nouveau 8]. In order to derive and debug the performance of parallel programs, it is necessary to reason about their performance (execution time). Reasoning about the performance of sequential functional programs has always been an informal aaair. However given the inherent operational complexity of parallel functional languages, a more formal approach to performance analysis is desirable. A possible exception to this are languages for SIMD machines. To tackle this problem a non-standard semantics has been developed for calculating the performance of lenient functional programs. 2 Background How should parallel performance be measured ? To measure sequential performance it is suucient to count the total number of operations (perhaps only certain ones) that are performed during an evaluation. The performance of a parallel program depends on many aspects of the machine on which it is run, including: the machine's number of processors and its scheduling policy. Including these aspects in reasoning about performance is too complicated. Eager 2] states that the average parallelism of a program is a useful performance measure. This may be used to bound the performance of a program running on a P processor machine. Eager proves that |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://sky.fit.qut.edu.au/~proe/papers/ullapool90.ps.gz |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Central processing unit Computation Computer Computers Denotational semantics Formal methods Functional programming HL7PublishingSubSection |
| Content Type | Text |
| Resource Type | Article |
