[Beowulf] Open source prime number application
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Kyle Spaans 3lucid at gmail.comThu Aug 23 16:32:36 PDT 2007
- Previous message: [Beowulf] Open source prime number application
- Next message: [Beowulf] latency vs bandwidth for NAMD
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
I've found some C code that's ready to go with MPI. It's for doing matrix multiplication. So all that you'd have to do is find some nice big matrices to multiply! I guess you wouldn't even necessarily need to know the right answers either. Info link: http://www.hcsw.org/projects.html --> mmult.c Download link: http://www.hcsw.org/downloads/mmult.c
- Previous message: [Beowulf] Open source prime number application
- Next message: [Beowulf] latency vs bandwidth for NAMD
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list