This repository has been archived on 2023-08-20. You can view files and clone it, but cannot push or open issues or pull requests.
yap-6.3/Logtalk/examples/threads/primes/NOTES.txt
pmoura 6b4bde14e1 Logtalk 2.30.1 files.
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1903 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
2007-06-12 10:39:47 +00:00

20 lines
887 B
Plaintext

================================================================
Logtalk - Open source object-oriented logic programming language
Release 2.30.1
Copyright (c) 1998-2007 Paulo Moura. All Rights Reserved.
================================================================
To load this example and for sample queries, please see the SCRIPT file.
This folder contains a simple example of calculating prime numbers in a
given interval using multiple threads. Try to run the example in single
and multi-processor (or multi-core) computers and compare the results.
Most Prolog compilers allows you to measure the time taken for proving
a goal using proprietary predicates.
Note that this example is only meant to illustrate how to use Logtalk
multi-threading predicates, not to taken as the efficient solution for
finding primes numbers on a given interval (with or without threads).