Messages in this thread | | | Date | Thu, 30 Mar 2000 02:49:51 -0800 | From | Karen Shaeffer <> | Subject | [OT]state space logic execution speed |
| |
Hi Folks,
I am developing a state space logic machine. In considering the implementation, I have two choices.
1.) I can utilize an array of integers, manipulating the space with operations on these integers.
2.) I can utilize bit-fields, manipulating the space with operations on these bit-fields.
Can anyone please advise me about the tradeoffs inherent to these two options concerning speed of execution WRT decision logic and the implication for porting to other target platforms. I'm looking for maximum execution speed. The target platform is initially X86. I have some ideas about this, but would be interested in other opinions as well.
You can send responses directly to me or on the list here, whatever is most appropriate.
TIA, Karen -- ---- Karen Shaeffer Neuralscape; Santa Cruz, Ca. 95060 shaeffer@neuralscape.com http://www.neuralscape.com -------------------------------------------------------
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |