42aabce1bb
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1973 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
24 lines
1.1 KiB
Plaintext
24 lines
1.1 KiB
Plaintext
================================================================
|
|
Logtalk - Open source object-oriented logic programming language
|
|
Release 2.30.7
|
|
|
|
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).
|
|
|
|
You probably want to play with the list size in order to find out when the
|
|
list is big enough to make the use of multi-threading worth performance-wise
|
|
(i.e. to compensate the overhead of thread creation and management).
|