Timeline for Are there algorithims for polling optimization?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2013 at 13:09 | comment | added | Brian | The nice thing about such algorithms is that you can make guarantees like, "I guarantee that no more than X% + 100ms of your time will be spent waiting on an already-finished job" and "I guarantee the server will not be polled more than Y times, unless the job takes more than 24 hours." | |
| Jul 10, 2013 at 13:01 | history | answered | Bart van Ingen Schenau | CC BY-SA 3.0 |