Skip to content
#edge computing Open access

ferinazumaDEV/politeclient: v0.1.2

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

Deprecated Python below 3.11 is compatibility, not support. The floor becomes 3.11 in 0.2.0 (3.10 reaches end of life in October 2026). Nothing changes within 0.1.x; CI keeps running on every version the package still declares. Fixed RetryPolicy.backoff_for no longer raises OverflowError past attempt ~1024. 2 ** attempt is an exact int in Python and stops fitting a float there, so a client configured with a large max_retries crashed on the attempt it should simply have slept max_backoff for. It now does. parse_retry_after follows the delay-seconds grammar of RFC 9110 (ASCII digits only). int() also accepted +5, -5 and digits from other scripts (٣, 12); those now return None, so the computed backoff applies instead. A value with more digits than a float can hold raised OverflowError; it now means "never", which compute_delay clamps to max_backoff. TokenBucket.acquire rejects zero, negative and NaN token counts with ValueError. A negative amount refilled the bucket past its capacity (acquire(-10) on a bucket of 2 left 12 tokens: a limiter you could bypass), zero was a silent no-op, and NaN never returned because it compares false with everything. TokenBucket.acquire no longer spins when the refill lands a few ULPs short of the request. With a deterministic clock (what the clock/sleep parameters exist for) the sub-ULP sleep was absorbed and the loop never advanced; with the real clock it busy-waited until the monotonic clock ticked. A deficit within floating-point noise now counts as satisfied. RateLimit, TokenBucket and RetryPolicy reject non-finite configuration at construction. rate=inf overflowed in capacity, rate=nan slipped past rate <= 0 and blew up in math.ceil, burst=inf built a bucket that never limits, and max_backoff=nan would have slept NaN. Rate-limit cases raise RateLimitConfigError; retry-policy cases raise ValueError. All five were found by tests/test_adversarial.py, a new suite that states the invariants a caller relies on (a bounded, finite backoff; a bucket whose tokens only go down when acquired; the RFC grammar) and feeds the code the inputs a real client meets at the edges. Every test in it failed against the previous code before the fix was written.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.