Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!lavaca.uh.edu!menudo.uh.edu!sugar!ficc!peter From: peter@ficc.ferranti.com (Peter da Silva) Newsgroups: comp.unix.sysv386 Subject: Re: UNIX Performance Penalties Keywords: UNIX vs DOS Message-ID: Date: 31 Oct 90 19:03:47 GMT References: <652@anacapa.NCEL.Navy.Mil> <2202@sixhub.UUCP> Reply-To: peter@ficc.ferranti.com (Peter da Silva) Organization: Xenix Support, FICC Lines: 9 In article <2202@sixhub.UUCP> davidsen@sixhub.UUCP (bill davidsen) writes: > If your application is compiled for 32 bit unix using a good > compiler, and uses 32 bit int data, you will get about 2:1 (I didn't > believe it until I measured it either). I'm surprised it's so small. The speed difference for pure-CPU on a 286 between small and large model (accessing 20000-int-long array at effectively random versus accessing a 40000-int-long array) is on the order of 11:1! -- Peter da Silva. `-_-' +1 713 274 5180. 'U` peter@ferranti.com