Path: utzoo!attcan!uunet!lll-winken!lll-ncis!helios.ee.lbl.gov!nosc!ucsd!rutgers!psuvax1!psuvm.bitnet!uh2
From: UH2@PSUVM.BITNET (Lee Sailer)
Newsgroups: comp.sys.amiga
Subject: Re: 68881 and the PA was:(none)
Message-ID: <66514UH2@PSUVM>
Date: 5 Jan 89 19:20:13 GMT
References: <533@boing.UUCP> <1434@percival.UUCP> <547@boing.UUCP> <13012@cup.portal.com> <1441@percival.UUCP>
Distribution: na
Organization: Penn State Erie, Behrend College
Lines: 16

In article <1441@percival.UUCP>, billc@percival.UUCP (William J. Coldwell) says:
>
>
>  The math chip will only speed up IEEE math functions, not FFP, or regular
>  integer/transcendental math functions.
>

Another posting suggested that for elementary operations, +-*/, FFP and
IEEE/68881 are about the same, but that for trig functions, the
68881 is about 30 times faster.

Would it be possible to write a NEW mathffp.library that was really a sort
of ieeemath.library (or whatever its name is) in disguise.  That way, if
you have a program that opens the ffp library, uses a lot of trig, and
is slow, you could substitute the new ffp library, and be fast.

Usual disclaimer.  I dunno nuthin'