From 64684ea2c861db2f79d8c01e675c2fc7e740210c Mon Sep 17 00:00:00 2001 From: halw Date: Mon, 14 Mar 2011 23:47:21 +0000 Subject: [PATCH] Author:halw Date:2011-03-14T22:50:56.000000Z git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@846 abb3cda0-5349-4a8f-a601-0c33ac3a8c38 --- .../concurrent-computing/concurrent-eiffel-scoop/index.wiki | 2 +- .../concurrent-eiffel-scoop/scoop-examples/quicksort.wiki | 4 +++- 2 files changed, 4 insertions(+), 2 deletions(-) diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/index.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/index.wiki index b436bc18..cbee1155 100644 --- a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/index.wiki +++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/index.wiki @@ -215,7 +215,7 @@ Now consider the only case, Case 1, determining asynchronous calls. Separate calls to commands are asynchronous. This means that when a client executes an asynchronous feature call, it “logs” the need for its associated feature application. But then rather than waiting for the feature application to complete, the client routine continues execution of instructions beyond the asynchronous call. -It is in this case that concurrent computation is achieved. The process of the client object is free to continue processing while the processor handling the target of the asynchronous feature call applies that feature. +It is in this case that concurrent computation is achieved. The processor of the client object is free to continue processing while the processor handling the target of the asynchronous feature call applies that feature. ==Design by Contract and SCOOP== diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki index f50876f5..8a57fc54 100644 --- a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki +++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki @@ -1,6 +1,6 @@ [[Property:title|Quicksort]] [[Property:weight|-7]] -[[Property:uuid|facf6973-e3c1-0a3f-b9e8-f55d1ca29a11]] +[[Property:uuid|61632685-20ad-293b-44b6-907b15d0447a]] {{UnderConstruction}} @@ -9,7 +9,9 @@ =Description= +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 natural division of the elements into to 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. =Highlights=