Merging in parallel computation



Hi everyone,

We are a research group working on classic algorithms on PRAM. One of
the dominant papers on merging, sorting and searching in parallel is
published by C. P. Kruskal in IEEE Trans. on Computer in 1983.

I have looked up ieeexplore and searched other databases for this
paper, but unfortunately, it doesn't seem to be available online. We
would appreciate it if someone could guide us on how to get this paper.


We could also use further information on latest works on parallel
merging algorithms. We are particularly interested in time-efficient
algorithms on CREW.

Regards,
bme

[Moderator:
Depending where you are (say in the US), contact a public library or
better a University library and get an interlibrary loan copy.

%A Clyde P. Kruskal
%T Searching, Merging, and Sorting in Parallel Computation
%J IEEE Transactions on Computers
%V C-32
%N 10
%D October 1983
%P 942-946
%K Ricase,
comparison problems, computational complexity, merging,
parallel computation, searching, sorting,

]
--
.



Relevant Pages

  • Re: Book searched
    ... > by Donald Knuth. ... Sorting and searching is in Volume 3. ... A perhaps somewhat easier to read book is one of the "Algorithms ...
    (comp.unix.programmer)
  • Re: VB6 LISTBOX problem
    ... "Stefan Berglund" wrote in message ... various algorithms. ... Have you glanced at volume 3 "Sorting ... and Searching" recently? ...
    (microsoft.public.vb.general.discussion)
  • Re: Book searched
    ... >by Donald Knuth. ... Sorting and searching is in Volume 3. ... introduction to computing and algorithms by shackelford, ...
    (comp.unix.programmer)
  • Re: In-place algorithm
    ... storage for the algorithm (ignoring space needed for merging). ... contiguous arrays and linked lists. ... less efficient than equivalent algorithms for contiguous arrays. ...
    (comp.programming)
  • Re: Similarity searching
    ... a factor of N*log, if the arrays are big you won't in general have to compare to the last element so I don't see the factor of L**2, and I don't see where that C**2 factor is coming from at all. ... There are also sorting algorithms which don't compare each item to every other item, yet still generate a sorted result. ... Similarity searching is still an active science, but there are a lot of useful algorithms out there now. ...
    (comp.lang.fortran)