jason@lanai.cs.ucla.edu (Jason Rosenberg) (02/02/91)
This has probably been discussed on the net so far, but....
What experience have people been having with the speed of version 2.0.
We have a stack which manipulates a large number of data cards, and spends
a lot of time moving and searching around the stack. It seems to be
notieceably slower running under version 2.0 than it used to under 1.whatever.
What's the deal? Is this as it should be? Does version 2.0 actually take
longer because it is more powerful and has more to deal with? Is 2.0 only
faster when you execute long, computational scripts which can take advantage
the compiler?
--
Jason Rosenberg 3531 Boelter Hall
University of California
jason@cs.ucla.edu Los Angeles, CA 90024
{uunet,rutgers,ucbvax}!ucla-cs!jason (213) 202-7126