diff options
| author | Shinya Sato <shinnya.sato@gmail.com> | 2022-10-27 21:39:11 +0900 |
|---|---|---|
| committer | Shinya Sato <shinnya.sato@gmail.com> | 2022-10-27 21:39:11 +0900 |
| commit | 910119af13c9cbe420966cb6307a9dc9a77ab2b8 (patch) | |
| tree | ae01a639d8b0cb215804a6f9e39aba1a113d2d63 | |
| parent | 77981e1fdbdc1a9edc50d3e7058a2e73918d9965 (diff) | |
| download | inpla-910119af13c9cbe420966cb6307a9dc9a77ab2b8.tar.gz inpla-910119af13c9cbe420966cb6307a9dc9a77ab2b8.zip | |
Update README.md
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -27,7 +27,7 @@ Inpla is a multi-threaded parallel interpreter of interaction nets. Once you wri - - The above table contains execution time in second on average of ten times execution by using Linux PC (Core i7-9700 (8 threads, no Hyper-threading), 16GB memory). The fastest one is shown with bold style. Scripts for the comparison table are in the `comparison` directory. These are written to have the same algorithms as much as possible, though only the Ackermann function in Inpla is optimised to interaction nets computing because it is not too competitive. + - The above table contains execution time in second on average of ten times execution by using Linux PC (Core i7-9700 (8 threads, no Hyper-threading), 16GB memory). The fastest one is shown with bold style. Scripts for the comparison table are in the `comparison` directory. These are written to have the same algorithms as much as possible, though only the Ackermann function in Inpla is a little optimised to interaction nets computing so that it can take advantage of the parallelism well. - Inpla8 and Inpla8r mean 8 threads without/with [reuse-annotated](./Gentle_introduction_Inpla.md#reuse-annotations) execution, respectively. |