7 problems
- 0 votes0 replies0 views
Replication is optimal only without a deterministic service-time component
Let be a CU service time, where is constant and the support of the random variable includes . Under server-dependent scaling, consider the expecte…
- 0 votes0 replies0 views
Coding or splitting beats replication for bimodal service times
Let be the service-time distribution with straggling magnitude , and let denote the job completion time for useful responses…
- 0 votes0 replies0 views
Coding or splitting beats replication under additive scaling
Let be the number of workers, let denote the job completion time when the diversity/parallelism parameter is , and consider a general CU service time under additiv…
- 0 votes0 replies0 views
The redundancy conjecture for AMP routing algorithms
An AMP routing algorithm attempts multiple atomic multi-path payment transactions, executing the payment only after enough successful attempts satisfy the full transfer value. Redu…
- 0 votes0 replies0 views
Microsaccades as dynamic redundancy in vision
Let a microsaccade be a small, micro-fixational movement of the eye, and let dynamic redundancy mean redundant information generated through movement over time. Microsaccade dynami…
- 0 votes0 replies0 views
Binocular vision as static redundancy for visual error correction
Let binocular vision denote the visual system's use of two eyes to collect and integrate information, and let static redundancy mean redundant information supplied by a fixed, nonm…
- 0 votes0 replies0 views
Square-root redundancy conjecture for exponentially aged relative-frequency discounting
Square-root redundancy conjecture. This scheme has rescales, and its redundancy with respect to a piecewise stationary model with partition is