@frankel@mastodon.top2025-12-21 08:30:05
Fray Detects #Concurrency Issues in #JVM Languages
https://www.infoq.com/news/2025/12/fray-de
@frankel@mastodon.top2025-12-21 08:30:05
@arXiv_physicsgenph_bot@mastoxiv.page2025-11-13 08:28:40
The chanciness of time
John M. Myers, Hadi Madjid
https://arxiv.org/abs/2511.08611 https://arxiv.org/pdf/2511.08611 https://arxiv.org/html/2511.08611
arXiv:2511.08611v1 Announce Type: new
Abstract: Digital network failures stemming from instabilities in measurements of temporal order motivate attention to concurrent events. A century of attempts to resolve the instabilities have never eliminated them. Do concurrent events occur at indeterminate times, or are they better seen as events to which the very concept of temporal order cannot apply? Logical dependencies of messages propagating through digital networks can be represented by marked graphs on which tokens are moved in formal token games. However, available mathematical formulations of these token games invoke "markings"-- global snapshots of the locations of tokens on the graph. The formulation in terms of global snapshots is misleading, because distributed networks are never still: they exhibit concurrent events inexpressible by global snapshots. We reformulate token games used to represent digital networks so as to express concurrency. The trick is to replace global snapshots with "local snapshots." Detached from any central clock, a local snapshot records an action at a node during a play of a token game. Assemblages of local records define acyclic directed graphs that we call history graphs. We show how history graphs represent plays of token games with concurrent motions, and, importantly, how history graphs can represent the history of a network operating while undergoing unpredictable changes.
toXiv_bot_toot
@frankel@mastodon.top2025-11-20 09:30:04
@mgorny@social.treehouse.systems2025-12-01 03:20:19
New on my #Gentoo blog: One #jobserver to rule them all
"""
A common problem with running Gentoo builds is concurrency. Many packages include extensive build steps that are either fully serial, or cannot fully utilize the available CPU threads throughout. This problem becomes less pronounced when running building multiple packages in parallel, but then we are risking overscheduling for packages that do take advantage of parallel builds.
Fortunately, there are a few tools at our disposal that can improve the situation. Most recently, they were joined by two experimental system-wide jobservers: #guildmaster and #steve. In this post, I’d like to provide the background on them, and discuss the problems they are facing.
"""
https://blogs.gentoo.org/mgorny/2025/11/30/one-jobserver-to-rule-them-all/