| Announcement |
Expressive Power |
| Efficient Execution |
Static Shape Analysis |
| F=I+Sh |
| Categorical Semantics
|
| Poly-dimensionality |
| Array Programming |
| Parallel Programming |
| Why a New Language? |
Efficient Execution
------------------------------------------------------------- | |Map Reduce Q'sort FFT MM-loops MM-ip | |_______________|____________________________________________| |---------------|--------------------------------------------| |FISh |1.04 0.37 1.93 3.57 4.36 7.05 | |---------------|--------------------------------------------| |Ocaml(in-lined)|4.00 2.66 3.53 | |---------------|--------------------------------------------| |Ocaml |5.99 4.59 15.47 8.16 7.71 60.61 | |---------------|--------------------------------------------| |speedup |5.8 12.4 8.0 2.3 1.8 8.6 | --------------------------------------------------------------Benchmark user times
As a polymorphic language.
-------------------- | | Quicksort | |_______|___________| |-------|-----------| |FISh | 1.70 | |-------|-----------| |C | 3.59 | |-------|-----------| |Ocaml | 8.97 | |_______|___________| |-------|-----------| |speedup| | |over C | 2.1 | --------------------Benchmark user times
See Benchmarks for more details and conclusions.
Last Updated:
Main |
Announcement |
Latest Paper |
Distribution |
Tutorial
Ready Reference |
Benchmarks |
Designer
Please feel free to send any comments.
Copyright Barry Jay © 1998
