Re: Binqry Tree sort

nejla.ghaboosi@xxxxxxxxx wrote: 

Thanks chuck for your advices. I'll obey from those rules. and
second about the algorithm which I asked. Actually I'm looking
for a parallel proessing, not a sequential proessing with just
one processor. Assume each node of a tree as a processor. The
connection between processors are like the binary tree. In other
words I want to use the binary tree as my parallel architecture.

You failed to quote context, making your post rather useless. That is why I asked you to read my sig and the URL it points to before posting again. Please do so.

Sedgewicks "Algorithms in C" has a good discussion of sorting methods for parallel processing.

--
"If you want to post a followup via groups.google.com, don't use
 the broken "Reply" link at the bottom of the article.  Click on
 "show options" at the top of the article, then click on the
 "Reply" at the bottom of the article headers." - Keith Thompson
More details at: <http://cfaj.freeshell.org/google/>
.

Relevant Pages

  • Re: Binqry Tree sort
    ... Actually I'm looking for a parallel proessing, ... The connection between processors are like the binary tree. ... The parent processor compares the ... Now I'm looking for a parallel algorithm wich uses parallel binary tree ...
    (comp.programming)
  • Re: Binqry Tree sort
    ... and second about the algorithm which I asked. ... Actually I'm looking for a parallel proessing, ... The connection between processors are like the binary tree. ... Hmm, does each processor have its own tiny memory space, and do they ...
    (comp.programming)
  • Re: Suitable Data Structure?
    ... >implement the following algorithm effectively: ... The precise components jof v that will ... >Simply selecting the largest element in requires Ooperations, ... >course, O, which could be obtained if a binary tree could be used. ...
    (sci.math.num-analysis)
  • Monotone Decomposition
    ... It's the first step in the classic Otriangulation algorithm. ... During the plane-sweep some of the active edges are stored in a binary tree or similar Osearch-structure. ... I have no idea how the search for the rightmost edge should work. ... The only reliable way to get the rightmost intersection-point seems to calculate the intersections and compare them. ...
    (comp.graphics.algorithms)
  • Suitable Data Structure?
    ... implement the following algorithm effectively: ... The precise components jof v that will ... Simply selecting the largest element in requires Ooperations, ... course, O, which could be obtained if a binary tree could be used. ...
    (sci.math.num-analysis)