From: Francis Cianfrocca <garbagecat10@...>
Date: 2007-02-07T06:59:41+09:00
Subject: Re: MultiThreading in C++

------=_Part_5786_9787825.1170799179158
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

The best way to solve this problem is not to use threads. It's local-compute
and local-memory bound so there is no capturable system latency. The problem
appears to be parallelizable to some degree. If you are sure you'll be
running it on multi-processor or multicore hardware, then break up the
dataset into multiple chunks, and run each one through a separate process.
Threads add nothing here.

On 2/6/07, ktxn1020 <kn0805@hotmail.com> wrote:
>
> Hi,
>
> I am pretty new to multithreaded programming. I have a question with a
> hope someone can help me out.
>
> I want to find distances between points using thread (Win MFC)
>
> For instance distance from:
> p1 to p2, p3, p4, p5
> p2 to p1, p3, p4, p5
> p3 to p1, p2, p4, p5
> p4 to p1, p2, p3, p5
> p5 to p1, p2, p3, p4
>
> with
>
> p1(x1, y1) = p1(42.67,73.75)
> p2(x2, y2) = p2 (61.22, 149.9)
> p3(x3, y3) = p3(30.27, 97.73)
> p4(x4, y4) = p4(35.18,101.83)
> p5(x5, y5) = p5(41.15, 104.87)
>
>
> using formular distance = square root (square (x2 - x1) + square (y2 -
> y1))
>
> How can I do it and what is the best way to do this?
>
> Thanks in advance,
>
>
>

------=_Part_5786_9787825.1170799179158--