Path: utzoo!utgpu!attcan!uunet!seismo!sundc!pitstop!sun!amdcad!ames!ncar!tank!uxc!uxc.cso.uiuc.edu!urbsdc!aglew
From: aglew@urbsdc.Urbana.Gould.COM
Newsgroups: comp.arch
Subject: Re: RISC v. CISC --more misconcepti
Message-ID: <28200226@urbsdc>
Date: 2 Nov 88 06:41:00 GMT
References: <998@l.cc.purdue.edu>
Lines: 22
Nf-ID: #R:l.cc.purdue.edu:998:urbsdc:28200226:000:975
Nf-From: urbsdc.Urbana.Gould.COM!aglew    Nov  2 00:41:00 1988


>There are many other operations which are cheap in hardware and expensive in
>software.  Maybe we should have a "competition" to see how many operations
>we can come up with for which silicon can do a quick, efficient, accurate job,
>but which are clumsy and expensive in software.
>
>I will toss in a few for starters.
>
>	Find the distance to the next one in a bit stream FAST.  It would
>be good to have an exception handler if one is not found.  I am considering
>algorithms not worth implementing if the operation is slow.
>
>Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907
>Phone: (317)494-6054
>hrubin@l.cc.purdue.edu (Internet, bitnet, UUCP)

Out of curiousity, would you care to explain exactly what you use the bit spacing
primitives for? I can guess, based on conversations with users and signal
processing experience, but I'd like an exact understanding.

Ditto the POP, bit population, count the number of set bits in a word,
operation.