Under exponential backoff, download schedules contain the maximum time we will wait, even if the random amount is larger. initial time we will wait, and everything else is random exponential from that point onwards.
But in most cases, the random amount is much smaller than the maximum, so we could replace the item with the actual maximum, or delete it from the schedule altogether. (On the public network, the maximum is 4x the last entry, on test networks, it's 3x.)
So once we're sure that we will never revert to deterministic schedules, we should make each schedule into a single initial value, and remove the deterministic code.
We should make these changes based on the schedules in #23347 (moved).
To upload designs, you'll need to enable LFS and have an admin enable hashed storage. More information
Child items ...
Show closed items
Linked items 0
Link issues together to show that they're related.
Learn more.
Trac: Description: Under exponential backoff, download schedules contain the maximum time we will wait, even if the random amount is larger.
But in most cases, the random amount is much smaller than the maximum, so we could replace the item with the actual maximum, or delete it from the schedule altogether. (On the public network, the maximum is 4x the last entry, on test networks, it's 3x.)
I'll make these changes based on the schedules in #23347 (moved).
to
Under exponential backoff, download schedules contain the maximum time we will wait, even if the random amount is larger.
But in most cases, the random amount is much smaller than the maximum, so we could replace the item with the actual maximum, or delete it from the schedule altogether. (On the public network, the maximum is 4x the last entry, on test networks, it's 3x.)
We should make these changes based on the schedules in #23347 (moved).
Trac: Summary: Remove redundant items from download schedules to Remove deterministic download schedule code and configs Description: Under exponential backoff, download schedules contain the maximum time we will wait, even if the random amount is larger.
But in most cases, the random amount is much smaller than the maximum, so we could replace the item with the actual maximum, or delete it from the schedule altogether. (On the public network, the maximum is 4x the last entry, on test networks, it's 3x.)
We should make these changes based on the schedules in #23347 (moved).
to
Under exponential backoff, download schedules contain the maximum time we will wait, even if the random amount is larger. initial time we will wait, and everything else is random exponential from that point onwards.
But in most cases, the random amount is much smaller than the maximum, so we could replace the item with the actual maximum, or delete it from the schedule altogether. (On the public network, the maximum is 4x the last entry, on test networks, it's 3x.)
So once we're sure that we will never revert to deterministic schedules, we should make each schedule into a single initial value, and remove the deterministic code.
We should make these changes based on the schedules in #23347 (moved).
#24151 (moved) is a duplicate; copied text from that ticket is:
It looks like the only code that uses DL_SCHED_DETERMINISTIC is testing code. We should rip out all code related to it. This will make it easier to refactor in the future and reduce the binary size by eliminating dead code.
we might want to change this to something that does NOT say "comma list"
So, these values still accept the same format as before (ignoring everything except the first entry), and they still emit a subset of the format that they emitted before.
On the other hand, they are closer to TimeInterval now than they were before. So I'l change them to that. Done in commit b205061eb13abd68a5335f8008c5121ef230c34e.
Also, merged.
Trac: Status: merge_ready to closed Resolution: N/Ato implemented