Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!cs.utexas.edu!longway!std-unix From: std-unix@longway.TIC.COM (Moderator, John S. Quarterman) Newsgroups: comp.std.unix Subject: Re: Floating Point Verification Summary: paranoia, source from netlib Message-ID: <212@longway.TIC.COM> Date: 14 Jul 88 21:23:45 GMT References: <208@longway.TIC.COM> Reply-To: uunet!gatech.edu!ut-sally!ut-emx!chpf127 (J. Eaton) Organization: The University of Texas at Austin, Austin, Texas Lines: 41 Approved: jsq@longway.tic.com (Moderator, John S. Quarterman) From: uunet!gatech.edu!ut-sally!ut-emx!chpf127 (J. Eaton) In article <208@longway.TIC.COM> > From: uunet!tahoe.unr.edu!bryson (Derry Bryson) > > I am searching for a standard to check floating point processors and > emulators against. Basically what I would like to find is a program > that performs several operations and evaluates the accuracy of the answers > based upon some kind of accepted standard. If anyone has any information > or advice I would greatly appreciate hearing from you. ... > Volume-Number: Volume 14, Number 28 There is a program called PARANOIA available from netlib@anl-mcs.arpa (the online software library maintained at Argonne National Laboratory) which does what you want. There are five versions I know about, one each in C, Pascal, and Basic, and two in Fortran (double/single). This program tries to test the floating point processor and/or library of floating point subroutines. If the machine you use has one library which all languages share it shouldn't matter what version you use (but running all of them might prove to be interesting...) To get a copy of one of the versions, send a message of the form: send from paranoia is one of: paranoia.b, paranoia.c, paranoia.p, spara.f, or dpara.f your message can include more than one request, but only one request per line. You might also want to get the general netlib index, by sending the message: send index J. Eaton UT Department of Chemical Engineering Not really doing anything with chemicals. Volume-Number: Volume 14, Number 31