Why is Quant math implemented in Floating Point?

[Moreton, Peter]

Hi,
 
I have a simple question, which I'm sure has a straightforward answer: Given that some of the commonly used Quant algorithms are quite compute intensive, especially the Monte-Carlo routines, why are they so frequently implemented using Floating point maths? - wouldn't these routines run much faster if coded using scaled-integers?
 
Peter Moreton
Getronics UK Ltd