Can anyone tell where can I find the host code of the OpenCL bitonic sort Algorithm given in the the book OpenCL in Action by Matthew Scarpino...?
The code samples for the book can be found in the downloads section on the following page of the publisher's website: Manning: OpenCL In Action
Related
I am looking for an opensource OpenCL sorting code. the ones available with AMD, Intel and NVIDIA SDK require the input size to be multiple of 2. Bolt library on the other hand is only restricted to AMD platforms.
Can anyone point me to such code? thanks
The open-source Boost.Compute C++ library (which is built on OpenCL) has a sort() function and can sort any arbitrary number of values on the GPU.
Another open-source alternative is VexCL (MIT License). It provides sort() and sort_by_key() functions. See sort.cpp for the examples.
Can anybody put up a neat implementation of Tim Sort in C++ and if possible algorithm link too . I couldn't find basic step to step explanation of tim sort on the net.
Well , next time search more :)
Here it is but in no way basic :-
https://github.com/swenson/sort/blob/master/demo.c
Does anyone have source code implementing this algorithm for finding cycles, preferably in a modern statically-typed language like SML, OCaml, Haskell, F#, Scala?
The following is a Java implementation of the algorithm you need:
https://github.com/1123/johnson. Java running on the JVM, you can also use it from Scala.
I struggled on this too, I came up with this page that lists some implementations for Johnson algorithm (the one looking for elementary circuits) in Java and OCaml. The author of the blog post fixed some issues in the original implementations, on the same page I linked before there are also the fixed versions of both implementations.
You can find it here as part of jgrapht implementation.
Will C++ and Boost Graph Library work for you?
Is there any materials I can read on run space analysis of an algorithm +O, +Theta , +Omega etc ? Need help for a Data Structures and Algorithm class I am taking.
Check out chapter eight of Michael Sipser, Introduction to the Theory of Computation. A great chapter from a great book.
Consider
Introduction to Algorithms
It's what most computer science undergraduates have to read inorder to understand runtime complexity theory.
Its the gold standard but the puedocode approach it uses to decribe the algorithms is dated. Most indiviuals are better able to understand simple C or javascript type statements than the puedocode approach that the book uses.
Can somebody please provide a gist of the Byzantine Fault Tolerant algorithm and Liskov's algorithm?
Thanks.
I think the introduction to Chapter 4 of Castro and Liskov's article from 1999 gives a concise and good overview of the inner workings of the algorithm: http://pmg.csail.mit.edu/papers/osdi99.pdf
You can know much details of how PBFT works by reading the paper published in OSDI(1999).
If you want to have understanding the algorithm throughly used in PBFT, then, I highly recommend doctoral thesis and technical paper. Both are written by original author, Miguel Castro. It contains almost everything that you want to know about PBFT. And if you want to see its implementation in code-level, you can download and check the software in this page.