Tootfinder

As Cyber Threats Escalate, the National Vulnerability Database Is Falling Behind
The National Institute of Standards and Technology (NIST) is struggling.
It faces a growing backlog to process data in its vulnerability repository, which publicly shares information assessing and detailing mitigation solutions against new cyber exploits.
With nearly 1,800 new reported vulnerabilities sitting in a queue for analysis this year, delays in processing leave the United States increa…

Stripe's stablecoin arm, Bridge, applied for a US national trust bank charter, joining Circle, Paxos, Ripple, and Coinbase in seeking federal oversight (Vince Dioquino/Decrypt)
https://decrypt.co/344333/stablecoin-issuers-race-bank-charters-stripes-br…

Stablecoin Issuers Race for US Bank Charters as Stripe's Bridge Joins the Queue
Bridge, Stripe’s stablecoin arm, has applied to the OCC for a national trust bank, joining four others vying for federal approval.

A new $1/(1-\rho)$-scaling bound for multiserver queues via a leave-one-out technique
Yige Hong
https://arxiv.org/abs/2510.11015 https://arxiv.org/pdf/2510…

A new $1/(1-ρ)$-scaling bound for multiserver queues via a leave-one-out technique
Bounding the queue length in a multiserver queue is a central challenge in queueing theory. Even for the classic $GI/GI/n$ queue with homogeneous servers, it is highly non-trivial to derive a simple and accurate bound for the steady-state queue length that holds across all scaling regimes. A recent breakthrough by Li and Goldberg (2025) establishes bounds that scale as $1/(1-ρ)$ for any load $ρ< 1$ and number of servers $n$, which is the correct scaling in many well-known scaling regimes, inc…

Fair Kernel-Lock-Free Claim/Release Protocol for Shared Object Access in Cooperatively Scheduled Runtimes
Kevin Chalmers, Jan B{\ae}kgaard Pedersen
https://arxiv.org/abs/2510.10818

Fair Kernel-Lock-Free Claim/Release Protocol for Shared Object Access in Cooperatively Scheduled Runtimes
We present the first spin-free, kernel-lock-free mutex that cooperates with user-mode schedulers and is formally proven FIFO-fair and linearizable using CSP/FDR. Our fairness oracle and stability-based proof method are reusable across coroutine runtime designs. We designed the claim/release protocol for a process-oriented language -- ProcessJ -- to manage the race for claiming shared inter-process communication channels. Internally, we use a lock-free queue to park waiting processes for gaining…

#Gentoo #jobserver revealed another problem with steve in particular, and (I believe) the jobserver protocol in general: blocking clients are prioritized over polling clients.
The problem is simple: when handling blocking reads, steve can issue a job token immediately. When handling a poll, it merely indicates that a token is available, and the client must issue another read request to get it. So if tokens are scarce and there are both blocking and polling clients running, the former are likely to be taking all the incoming tokens.
My idea of working around this is to implement temporary reservations. If a client polls for a token, we reserve one for it. The reserved token can afterwards be only read by the same client. This way, both blocking and polling clients get a token — the former get it immediately, the latter get it reserved for them. And if there are no tokens available, both get into a single FIFO queue, for a poor man's round-robin (steve also throttles all reads to one token at a time).
However, polls technically don't guarantee that the client will eventually read the token, so we need to handle reservation expirations as well.

Fifa kept the costs of 2026 World Cup tickets under wraps until the very moment of sale,
replacing the usual published table of price points with a digital lottery that decided who even got the chance to buy.
Millions spent hours staring at a queue screen as algorithms determined their place in line.
When access finally came for most, the lower-priced sections had already vanished,
many presumably hoovered up by bots and bulk-buyers (and that’s before Fifa quietly r…

Edit: thanks to @…, figured out the Musicolet button(s) to turn off auto-repeat on full albums. It's because they call them queues.
#Musicolet #Android

Gearing up for tonight's decap run.
In the queue: 5x PIC12F683 for delayering, XC6SLX25, XC7S25, ATSAMA5D27, 25AA1024
I'm not bothering to label the sample beakers because I know what most of these chips will look like from having seen other parts in the family. The ATSAM is the main unknown.
Anybody know what foundry it was made at? What node? We'll find out soon I guess.

Oh man, so I'm looking to relax and put on some #StarTrek. Next up in the queue is #STNG S7E18, "Eye of the Beholder", and WHAM deep talk about #suicide . Listening to Data relate his exp…

Google and Apple doing some interesting work to improve the safety of C software, and the results speak for themselves: "The baseline segmentation fault rate across the production fleet dropped by approximately 30 percent"
https://spawn-queue.acm.org/doi/pdf/10.1145/3773097

ACM Queue's George V. Neville-Neil (A.K.A. "Kode Vicious") argues for a scientific process of software development with an emphasis on attaining focus, and having an environment fit for work.
"The Process - From start to finish"
https://queue.acm.org/detail.cfm?id=37

OH at #IETF124: Somebody tell the Fire Alarm that the queue is locked.

L4Span: Spanning Congestion Signaling over NextG Networks for Interactive Applications
Haoran Wan, Kyle Jamieson
https://arxiv.org/abs/2510.02682 https://a…

L4Span: Spanning Congestion Signaling over NextG Networks for Interactive Applications
Design for low latency networking is essential for tomorrow's interactive applications, but it is essential to deploy incrementally and universally at the network's last mile. While wired broadband ISPs are rolling out the leading queue occupancy signaling mechanisms, the cellular Radio Access Network (RAN), another important last mile to many users, lags behind these efforts. This paper proposes a new RAN design, L4Span, that abstracts the complexities of RAN queueing in a simple interface, th…

Who’s ready for Xmas!?
(He said after working off the 1st-of-month dependabot/pre-commit GitHub PR queue.)

from my link log —
Two workers are quadratically better than one: modelling a queue with PRISM.
https://www.hillelwayne.com/post/queueing-prism/
saved 2020-11-02

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Cumulative Games: Who is the current player?
Urban Larsson, Reshef Meir, Yair Zick
https://arxiv.org/abs/2005.06326
- Contest Design with Threshold Objectives
Edith Elkind, Abheek Ghosh, Paul W. Goldberg
https://arxiv.org/abs/2109.03179
- Deep Learning Meets Mechanism Design: Key Results and Some Novel Applications
V. Udaya Sankar, Vishisht Srihari Rao, Y. Narahari
https://arxiv.org/abs/2401.05683 https://mastoxiv.page/@arXiv_csGT_bot/111741115483021453
- Charting the Shapes of Stories with Game Theory
Daskalakis, Gemp, Jiang, Leme, Papadimitriou, Piliouras
https://arxiv.org/abs/2412.05747 https://mastoxiv.page/@arXiv_csGT_bot/113627246220336424
- Computing Evolutionarily Stable Strategies in Multiplayer Games
Sam Ganzfried
https://arxiv.org/abs/2511.20859 https://mastoxiv.page/@arXiv_csGT_bot/115620508246637361
- Autodeleveraging: Impossibilities and Optimization
Tarun Chitra
https://arxiv.org/abs/2512.01112 https://mastoxiv.page/@arXiv_csGT_bot/115649040881525135
- Static Pricing Guarantees for Queueing Systems
Jacob Bergquist, Adam N. Elmachtoub
https://arxiv.org/abs/2305.09168 https://mastoxiv.page/@arXiv_csDS_bot/110382625621173269
- Game of arrivals at a two queue network with heterogeneous customer routes
Agniv Bandyopadhyay, Sandeep Juneja
https://arxiv.org/abs/2310.18149 https://mastoxiv.page/@arXiv_csPF_bot/111322112226936579
- Characterization of Priority-Neutral Matching Lattices
Clayton Thomas
https://arxiv.org/abs/2404.02142 https://mastoxiv.page/@arXiv_econTH_bot/112205968984928881
- Seven kinds of equivalent models for generalized coalition logics
Zixuan Chen, Fengkui Ju
https://arxiv.org/abs/2501.05466 https://mastoxiv.page/@arXiv_csLO_bot/113819715349259373
- Matching Markets Meet LLMs: Algorithmic Reasoning with Ranked Preferences
Hadi Hosseini, Samarth Khanna, Ronak Singh
https://arxiv.org/abs/2506.04478 https://mastoxiv.page/@arXiv_csAI_bot/114635186215388479
toXiv_bot_toot

Reinforcement Learning Based Traffic Signal Design to Minimize Queue Lengths
Anirud Nandakumar, Chayan Banerjee, Lelitha Devi Vanajakshi
https://arxiv.org/abs/2509.21745 https:/…

Reinforcement Learning Based Traffic Signal Design to Minimize Queue Lengths
Efficient traffic signal control (TSC) is crucial for reducing congestion, travel delays, pollution, and for ensuring road safety. Traditional approaches, such as fixed signal control and actuated control, often struggle to handle dynamic traffic patterns. In this study, we propose a novel adaptive TSC framework that leverages Reinforcement Learning (RL), using the Proximal Policy Optimization (PPO) algorithm, to minimize total queue lengths across all signal phases. The challenge of efficientl…

Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems
Yifan Feng, Nail Akar, Zhengchuan Chen, Mehul Motani
https://arxiv.org/abs/2509.23360

Absorbing Markov Chain-Based Analysis of Age of Information in Discrete-Time Dual-Queue Systems
Status update systems require the timely collection of sensing information for which deploying multiple sensors/servers to obtain diversity gains is considered as a promising solution. In this work, we construct an absorbing Markov chain (AMC) to exactly model Age of Information (AoI) in a discretetime dual-queue (DTDQ) status update system with generate at will (GAW) status updates, discrete phase-type (DPH-type) distributed service times and transmission freezing. Specifically, transmission i…

Worker Pool Design Pattern Explanation
https://coffeebytes.dev/en/software-architecture/worker-pool-design-pattern-explanation/

Network-Optimised Spiking Neural Network for Event-Driven Networking
Muhammad Bilal
https://arxiv.org/abs/2509.23516 https://arxiv.org/pdf/2509.23516

Network-Optimised Spiking Neural Network for Event-Driven Networking
Spiking neural networks offer event-driven computation suited to time-critical networking tasks such as anomaly detection, local routing control, and congestion management at the edge. Classical units, including Hodgkin-Huxley, Izhikevich, and the Random Neural Network, map poorly to these needs. We introduce Network-Optimised Spiking (NOS), a compact two-variable unit whose state encodes normalised queue occupancy and a recovery resource. The model uses a saturating nonlinearity to enforce fin…

Weekend Reads
* How AI can help cybersecurity
https://www.foreignaffairs.com/guest-pass/redeem/Jh1vJ6PqTwc
* Notes on active queue management

The End of Cybersecurity
America’s digital defenses are failing—but AI can save them.

Nvidia and Google launch the GeForce Now Fast Pass to let Chromebook owners stream over 2,000 games directly from an existing PC game library without ads (Dominic Preston/The Verge)
https://www.theverge.com/news/824940/chromebooks-nvidia-geforce-now-fa…

New Chromebooks will come with a year of Nvidia’s cloud gaming ‘fast pass’
Nvidia GeForce Now Fast Pass is an ad-free queue-jump for GeForce Now’s free tier, and it’s exclusive to Chromebook owners.

A Predictive and Synergistic Two-Layer Scheduling Framework for LLM Serving
Yue Zhang, Yuansheng Chen, Xuan Mo, Alex Xi, Jialun Li, WeiGang Wu
https://arxiv.org/abs/2509.23384 h…

A Predictive and Synergistic Two-Layer Scheduling Framework for LLM Serving
LLM inference serving typically scales out with a two-tier architecture: a cluster router distributes requests to multiple inference engines, each of which then in turn performs its own internal scheduling. However, this commonly used paradigm suffers from critical, systemic inefficiency caused by the information gaps across two layers. At the cluster-layer, the router mainly relies on lagging, coarse-grained metrics, such as average latency and queue length to make decisions, resulting in "dec…

On the overlap times in queues with dependence under a Farlie-Gumbel-Morgenstern copula
Ioannis Dimitriou
https://arxiv.org/abs/2509.14100 https://arxiv.or…

On the overlap times in queues with dependence under a Farlie-Gumbel-Morgenstern copula
In this work, we analyze the steady-state maximum overlap time distribution in a single-server queue by introducing a dependence structure between service and interarrival times under the Farlie-Gumber-Morgenstern copula. We provide explicit expressions by indicating the effect of dependence. We also focus on the steady-state distribution of the minimum overlap time of a customer with its two adjacent customers. A more general dependence structure is also investigated. A numerical example illus…

Heavy Traffic Diffusion Limit for a Closed Queueing Network with Single-Server and Infinite-Server Stations
Amir A. Alwan, Bar{\i}\c{s} Ata
https://arxiv.org/abs/2509.13748 http…

Heavy Traffic Diffusion Limit for a Closed Queueing Network with Single-Server and Infinite-Server Stations
This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime -- where the number of jobs and single-server service rates grow large while infinite-server rates remain fixed -- we prove a weak convergence result for the queue length and idleness process vector, providing an approximation for the original system.