mirrors/eiffel-org
1
0
Fork 0
mirror of https://github.com/EiffelSoftware/eiffel-org.git synced 2025-12-07 15:22:31 +01:00
Code Issues Packages Projects Releases Wiki Activity

Author:halw

Browse Source 
Date:2011-04-18T20:13:30.000000Z


git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@886 abb3cda0-5349-4a8f-a601-0c33ac3a8c38
This commit is contained in:
halw
2011-04-19 20:11:49 +00:00
parent 95d2473315
commit 351231dc18
3 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
View File

@@ -11,7 +11,7 @@
The quicksort example is a concurrent implementation of the well-known [http://en.wikipedia.org/wiki/Quicksort quicksort] sorting algorithm developed by computer scientist [http://en.wikipedia.org/wiki/C._A._R._Hoare C. A. R. Hoare]. Quicksort uses a "divide and conquer" strategy to sort a structure. It applies a basic algorithm to the structure which leads to a division of the elements into to two substructures. Then it applies the same algorithm to each of the substructures, and so on, until the whole structure is sorted. Because of the repetitive application of the same algorithm to evolving parts of the structure, the quicksort is often used in computer science classes to provide students with experience in [http://en.wikipedia.org/wiki/Recursion_(computer_science) recursive] computation.
In the SCOOP example, instead of recursive calls, substructures are handled by separate [[Concurrent Eiffel with SCOOP|SCOOP processors]] running concurrently.
In the SCOOP example, instead of recursive calls, substructures are handled (within limits) by separate [[Concurrent Eiffel with SCOOP|SCOOP processors]] running concurrently.
=Highlights=
@@ -22,5 +22,6 @@ The quicksort algorithm is embodied in the class <code>QUICKSORTER</code>, prima
The structures acted upon by <code>QUICKSORTER</code> are managed in instances of class <code>DATA</code>. <code>DATA</code> is a class designed specifically to support the quicksort example.
When the example runs, separate <code>QUICKSORTER</code> processes are used for the recursive sorts up until a certain depth of recursion is reached. The limit is defined by the <code>NATURAL</code> constant <code>max_recursion_depth</code>.

3
documentation/current/solutions/concurrent-computing/index.wiki
View File

@@ -1,5 +1,4 @@
[[Property:title|Concurrent Computing]]
[[Property:link_title|Concurrent computing]]
[[Property:title|Concurrent computing]]
[[Property:weight|-10]]
[[Property:uuid|7c7a399a-076f-fd13-9b5f-f110c212e2e8]]
== Concurrent Computing Solutions ==

3
documentation/current/solutions/preferences/index.wiki
View File

@@ -1,5 +1,4 @@
[[Property:title|Application preferences]]
[[Property:link_title|Preferences]]
[[Property:title|Preferences]]
[[Property:weight|-5]]
[[Property:uuid|08efd11f-6326-90e0-bd63-8dfed4b55890]]
== Application preferences management solutions ==