PS3 CG problem
Oleg Batrashev
SVN repository
svn co svn://dougdevel.org/ps3/trunk/cg
File CG.lyx (CG.pdf) contains problem description. Directories
impl/tiny and impl/central contain 2 problems. impl/cg.py contains
python code.
You need python and numpy package to run python code. Run with "python
cg.py <suffix>".
You could add your code somewhere under
svn://dougdevel.org/ps3/trunk/, eg
svn://dougdevel.org/ps3/trunk/cg/team1
Usernames are
ain
toomas
lauri
vladimir
rein
ulno
and for password just add "ps3" to a name.
Oleg
P.S. You can also add previous code to this repository under
meaningful directory (eg svn://dougdevel.org/ps3/trunk/primes/team1)
Toomas Laasik
I did some research to get ideas for how to implement the CG problem.
Here is one list of free scientific software you may take a look at:
http://www.ann.jussieu.fr/free.htm.
There you will find many implementations of BLAS matrix arithmetic
interfaces (and much more). I also created small table of the most
closest matrix arithmetic implementations that we might try, use parts
of it or just learn from them. I attached the table to the email as
OpenOffice Calc document. I'd be happy if you improved it also.
PS. This probably is not a problem, but I'd remind just in case that
this svn info is available and usable to anyone who finds our lab web page.
Toomas
Toomas Laasik
The current tasks and people who are responsible for those are:
* Documentation - Toomas
- At first I will create some testcases for matrix and vector
operations that could be both run in pyhton and c/c++. From there after
I will create more general testcases for the whole app if there is
something that could be tested. If anyone himself wants to write
testcases then please do so and send them also to me.
- Also I try to create and maintain some central documentation about
how things are done. Since this is currently very uncertain, I will
start dealing with it as far as some code is forming that is not going
to trash bin.
* Algorithm implementations for sparse matrixes - Ain, Lauri
- This is where algorithms should be chosen/created and implemented.
At first it is not important where and how good they run, but it must be
kept in mind that this is probably the main thing about all the project.
This should be also parallelized sometime in the future amongst SPUs. I
also have thoughts about this, so I will write these somewhere down and
distribute, but you should start on your own of course.
* Dense matrix implementation and converting project to C++ - Rein, Vladimir
- Since Rein has implemented something in C, it would be great if he
would also port it into C++. Vladimir may support him. The other thing
is that currently the dense matrix algorithms have some bugs on it.
Those must be dealt with.
About organisation.
I think we could work all in svn and on same instance of the project
code. Rein, please set this place up.
About communication.
Next project coordination meeting is held in MSN on Thuersday at 15:00
in MSN. So please be present. Just to be sure we can all contact each
other, here are our MSN accounts:
Toomas: toom...@hotmail.com
Vladimir: vov...@gmail.com
Ain: ainu...@hotmail.com
Rein: reinra...@hotmail.com
Lauri: lauri...@hotmail.com
Ulrich: unorb...@hotmail.com
Have a nice evening,
Toomas
Oleg Batrashev
> Next project coordination meeting is held in MSN on Thuersday at 15:00
> in MSN. So please be present. Just to be sure we can all contact each
> other, here are our MSN accounts:
> Toomas: toom...@hotmail.com
> Vladimir: vov...@gmail.com
> Ain: ainu...@hotmail.com
> Rein: reinra...@hotmail.com
> Lauri: lauri...@hotmail.com
> Ulrich: unorb...@hotmail.com
>
Feel free to ask questions about CG or implementation.
Oleg