From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,7840ada5c7a0804 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!npeer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!post01.iad.highwinds-media.com!newsfe04.iad.POSTED!00000000!not-for-mail From: Brad Moore User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US; rv:1.9.2.15) Gecko/20110303 Thunderbird/3.1.9 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: ANN: Storage pool for Ada 2005 with bindings to Apache Runtime Pools library References: In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 68.145.219.1 X-Complaints-To: internet.abuse@sjrb.ca X-Trace: newsfe04.iad 1301030757 68.145.219.1 (Fri, 25 Mar 2011 05:25:57 UTC) NNTP-Posting-Date: Fri, 25 Mar 2011 05:25:57 UTC Date: Thu, 24 Mar 2011 23:25:53 -0600 Xref: g2news1.google.com comp.lang.ada:18438 Date: 2011-03-24T23:25:53-06:00 List-Id: On 24/03/2011 3:25 PM, Brad Moore wrote: > I actually set the number of workers to 5, which was a bit surprising to > me. I believe there are 9 iterations, which is why the number > of workers doesnt come out to an even number. On my system, an AMD > Quadcore, 5 workers gave me the best time. I was thinking 9 would > have been the best number. Actually, thinking about it some more, it makes sense to me that 5 workers would be the best choice for 9 iterations and 4 processors. At t=0, 5 workers should proceed at the same rate, (assuming that processor affinity is not set on the tasks). The 5 workers should migrate as needed between the 4 processors to ensure fair sharing of the processing resources. Four of the workers will be given two iterations, while one will be given a single iteration. The worker with a single iteration will finish first. At that time the other workers should have roughly one full iteration left. At that point there are four workers with even work loads, and four processors. The workers proceed until all the work is complete, and all processors were fully loaded for the entire processing. Brad