Logtalk 2.30.1 files.
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1903 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
32
Logtalk/examples/threads/sorting/NOTES.txt
Normal file
32
Logtalk/examples/threads/sorting/NOTES.txt
Normal file
@@ -0,0 +1,32 @@
|
||||
================================================================
|
||||
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 multi-threading implementation of the merge sort
|
||||
algorithm. Depending on the size of the lists that are ordered, using
|
||||
only one thread can be faster. The number of threads to use in sorting
|
||||
is set using the msort/1 object parameter. You may need to adjust the
|
||||
size of the memory areas used by your Prolog compiler, depending on the
|
||||
size of the lists you want to sort.
|
||||
|
||||
This example uses a simple implementation of the merge sort algorithm,
|
||||
intended only to illustrate Logtalk multi-threading features. For any
|
||||
other purpose, you may find the following paper a worthwhile reading:
|
||||
|
||||
@incollection{ apt93modular,
|
||||
author = "Krzysztof R. Apt and Dino Pedreschi",
|
||||
title = "Modular Termination Proofs for Logic and Pure Prolog Programs.",
|
||||
booktitle = "116",
|
||||
month = "31",
|
||||
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
|
||||
address = "ISSN 0169-118X",
|
||||
pages = "35",
|
||||
year = "1993",
|
||||
url = "citeseer.ist.psu.edu/apt93modular.html" }
|
||||
|
Reference in New Issue
Block a user