This is the mail archive of the gsl-discuss@sources.redhat.com mailing list for the GSL project.
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
| Other format: | [Raw text] | |
Hi all, I'm sorry to interfere with this enjoyable and, at least for me, extremely instructive discussion about architectures comparison but I would like to resubmit to your attention the problem of the generation of power exponential random variates in gsl. Using the modified program by Olaf (thanks a lot for your suggestions !)I tested again on two machines (Mobile Pentium 4 and Opteron) adding my new findings to Olafs' original result.txt (attached). If I can dare a tentative summary, it seems Intel, Alpha and Power4+ share more or less the same sequence of "best" algorithm when b is increased, i.e. GS-ED-EN-GS (analogously to the original paper by Tadikamalla) while Sun is better with a GS-ED-GS sequence and on AMD GS is almost always preferable. Do you think that, in a hypothetical rewriting of the actual implementation of the power exponential random variable generator in GSL (randist/exppow.c), one should take in consideration the different architectures, maybe via architecture-specific pieces of code toggled by preprocessor directives? Or it would be better to try to cook up a "reasonable" routine valid on "the average machine" (whatever that means... probably nothing) I would be happy if someone can provide me with some opinion/suggestion on this point. Best, Giulio.
Attachment:
results.txt
Description: Text document
Attachment:
pgp00000.pgp
Description: PGP signature
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |