| ??? 04/30/08 12:22 Read: times |
#154214 - well, it's simple Responding to: ???'s previous message |
I happened to stumble over some of my notes from when I developed the algorithm
top: set a flag 'first' mask: all zeroes match: all ones read: read if collision reset 'first' set bit in mask bit > goto read: if none if 'first' you are done reset 'first' clear bit in match bit >1 set bit in mask goto read: if read w/o collision you found one, tell it its node, tell it to go deaf if 'first' you are done else from top Erik |
| Topic | Author | Date |
| Followup on slave enumeration algorithm | 01/01/70 00:00 | |
| algorithm | 01/01/70 00:00 | |
| well, it's simple | 01/01/70 00:00 | |
| Typo | 01/01/70 00:00 | |
| a matter of time | 01/01/70 00:00 | |
| Time | 01/01/70 00:00 | |
| figure it out this way | 01/01/70 00:00 | |
| Guessing the time | 01/01/70 00:00 | |
| More on theory vs. practice | 01/01/70 00:00 | |
| the practical reality ... | 01/01/70 00:00 | |
| of course .... | 01/01/70 00:00 | |
| Well done..starting for third countries | 01/01/70 00:00 | |
| But still | 01/01/70 00:00 | |
| Starting for third countries | 01/01/70 00:00 | |
| Jecksons please read the previous thread | 01/01/70 00:00 | |
| Third countries | 01/01/70 00:00 | |
| I am feeling Dizzy | 01/01/70 00:00 | |
| and what does that tell us | 01/01/70 00:00 | |
Keeping this thread alive | 01/01/70 00:00 |