| ??? 06/13/06 11:44 Read: times |
#118215 - New packages Responding to: ???'s previous message |
2. Each time a new package arrives I have to compare it to all the buffers to find wether it exists or not.
A solution would be a hash-table but I couldn't find an apropriate algorithm which would be faster than comparing all the bytes. For a buffer this small, and messages this short, I think using a hash table might actually be more computationally intensive (since after you find a match in the hash table, you still need to verify that the messages are indeed identical). Of course, even comparing all bytes can be done in several ways. The algorithm checking for message identity can stop after finding one byte that does not match, because this answers the question "Are the messages identical?" with a "No". |
| Topic | Author | Date |
| Buffer management optimalization | 01/01/70 00:00 | |
| Simple things first ... | 01/01/70 00:00 | |
| You can use circular buffer | 01/01/70 00:00 | |
| Fragmentation problem... | 01/01/70 00:00 | |
| all methods have some problems | 01/01/70 00:00 | |
| Start of package or End of package | 01/01/70 00:00 | |
| Packages explanation | 01/01/70 00:00 | |
| Individual buffers | 01/01/70 00:00 | |
| Good Idea | 01/01/70 00:00 | |
| New packages | 01/01/70 00:00 | |
| hash table unefective | 01/01/70 00:00 | |
| why keep that many | 01/01/70 00:00 | |
| Reason of 5 or more buffer | 01/01/70 00:00 | |
| Protocol specifics | 01/01/70 00:00 | |
| One way protocol | 01/01/70 00:00 | |
| One way protocol | 01/01/70 00:00 | |
| never | 01/01/70 00:00 | |
| Definition of need | 01/01/70 00:00 | |
| Grant, I agree with what you post re thi | 01/01/70 00:00 | |
| Simply reason why one way transmission | 01/01/70 00:00 | |
then why not just do it the easy way | 01/01/70 00:00 |