Difference between pages "Procedures" and "NAS-IS Benchmark"
m (1 revision imported) |
(Created page with '== Overview == NASA's Parallel Benchmarks (NPBs) are a common, convenient way of evaluating performance of different classes of machine. By using the official NASA implementatio…') |
||
| Line 1: | Line 1: | ||
| − | + | == Overview == | |
| + | |||
| + | NASA's Parallel Benchmarks (NPBs) are a common, convenient way of evaluating performance of different classes of machine. By using the official NASA implementation it is possible to evaluate Mesham against that of existing languages. To date the evaluation has been done against NASA's C-MPI code, which is the most common, and arguable most efficient, language choice in parallel computing. | ||
| + | |||
| + | There are numerous benchmarks in the NPB suite, to date we have implemented benchmark IS (Integer Sort), which will sort numbers, in parallel, using a modified version of the bucket sort algorithm. This benchmark has five classes associated with it - class S with 65,000 numbers, class W with 1,000,000 numbers, class A with 8,000,000 numbers, class B with 33,000,000 numbers and lastly class C with 340,000,000 numbers. We have performed evaluation using class B and C, which involves sorting the greatest amount of numbers and hence the largest challenge, although all classes are supported by the benchmark code. | ||
| + | |||
| + | The benchmark has been tuned for performance, this does mean that some of the more low level primitive communication types have been used and hence is not as easily readable as many of the other examples. Having said that, it has not taken long to write and is easy modifiable if required. | ||
| + | |||
| + | == Performance Results == | ||
| + | |||
| + | |||
| + | |||
| + | == Source Code == | ||
| + | |||
| + | The source code is more extensive than other examples, with combination files for each class of experiment. It is therefore not included on this page but you can download it. | ||
| + | |||
| + | == Notes == | ||
| + | |||
| + | Be aware, this version of the code requires at least version 0.5 of both Mesham and the runtime library. The benchmark will not work with the version 0.41(b) release which is also on the website. | ||
| + | |||
| + | == Download == | ||
Revision as of 12:14, 11 January 2010
Overview
NASA's Parallel Benchmarks (NPBs) are a common, convenient way of evaluating performance of different classes of machine. By using the official NASA implementation it is possible to evaluate Mesham against that of existing languages. To date the evaluation has been done against NASA's C-MPI code, which is the most common, and arguable most efficient, language choice in parallel computing.
There are numerous benchmarks in the NPB suite, to date we have implemented benchmark IS (Integer Sort), which will sort numbers, in parallel, using a modified version of the bucket sort algorithm. This benchmark has five classes associated with it - class S with 65,000 numbers, class W with 1,000,000 numbers, class A with 8,000,000 numbers, class B with 33,000,000 numbers and lastly class C with 340,000,000 numbers. We have performed evaluation using class B and C, which involves sorting the greatest amount of numbers and hence the largest challenge, although all classes are supported by the benchmark code.
The benchmark has been tuned for performance, this does mean that some of the more low level primitive communication types have been used and hence is not as easily readable as many of the other examples. Having said that, it has not taken long to write and is easy modifiable if required.
Performance Results
Source Code
The source code is more extensive than other examples, with combination files for each class of experiment. It is therefore not included on this page but you can download it.
Notes
Be aware, this version of the code requires at least version 0.5 of both Mesham and the runtime library. The benchmark will not work with the version 0.41(b) release which is also on the website.
