Tootfinder

The Peculiarities of Extending Queue Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin N\"ollenburg
https://arxiv.org/abs/2506.05156 https:/…

The Peculiarities of Extending Queue Layouts
We consider the problem of computing $\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\ell$ that avoid the nesting of edges on any of the pages. Inspired by previous work in the extension of stack layouts, here we consider the setting of extending a partial $\ell$-page queue layout into a complete one and primarily analyze the problem through the refined lens of parameterized complexity. We obtain novel algori…

This is a nice write-up of some complex and careful decisions and collaboration to navigate hard tradeoffs that in the end got the job done
I wish we also had more open discussions about the opposite scenario: "when the right tool is the wrong choice"
https://tern.sh/blog/pagerduty-cassadr

When the Wrong Tool is the Right Choice: PagerDuty's Cassandra Queue | Tern Blog
In 2011, PagerDuty was using MySQL as a queue. If you just winced, you understand the problem.

My morning so far:
- Essential system is not working, opened support ticket.
- Two hours later still no change.
- Called service desk: "Yes we assigned the ticket to the 2nd level"
- Checked ticket queue: "Priority 4: Low"
- Called service desk "Tell the 2nd level guys if they don't make this work before lunch we're coming over and confiscate every Switch 2 we find!"

Nintendo launches the Switch 2 globally, with long queues outside stores and midnight openings; analysts expect Nintendo to sell 15M to 20M Switch 2 units (David Keohane/Financial Times)
https://www.ft.com/content/f63cfbcc-9d0e-440e-ad9a-02d01d328f93

Nintendo sells out Switch 2 console at global launch
Mario fans queue at midnight store openings after games company apologises for failing to meet pre-order demand

I'm afraid this is true. I already struggle to raise enough money to keep the very talented young scientists I have working with me (from many different countries already), finding funding for more will be difficult, and why should US scientists essentially queue jump just because of their nationality ? I know that sounds harsh, I have very good US colleagues, but I have to be fair to all, regardless of where they come from. OTOH, if you are a US scientist and you are interested in exploring possibilities in Denmark, give me a shout and we'll see what we can do.
https://mastodon.world/@davidho/114620044303457868
davidho@mastodon.world - Unless you’re a Nobel laureate, the brain drain will be away from science and not to other countries.
https://www.nytimes.com/2025/06/03/us/trump-federal-spending-grants-scientists-leaving.html?unlocked_article_code=1.ME8.sh9q.qy7jX0S1ZrBa&smid=url-share

Backpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
Salah Eddine Choutri, Boualem Djehiche, Prajwal Chauhan, Saif Eddin Jabari
https://arxiv.org/abs/2506.03059

Backpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
We propose a Mean-Field Type Game (MFTG) framework for effective scheduling in multi-hop wireless sensor networks (WSNs) using backpressure as a performance criterion. Traditional backpressure algorithms leverage queue differentials to regulate data flow and maintain network stability. In this work, we extend the backpressure framework by incorporating a mean-field term into the cost functional, capturing the global behavior of the system alongside local dynamics. The resulting model utilizes t…

This https://arxiv.org/abs/2503.11463 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Sorting permutations with pile shuffle on queue-like and stack-like piles
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three variations: (1) using queue-like piles, (2) using stack-like piles, and (3) using a heterogeneous mixture of those two pile types, either given or decided during the shuffle by the dealer herself. We first characterize the sortable permutations of one or more sequ…

This https://arxiv.org/abs/2501.08775 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Adaptive Approximation Schemes for Matching Queues
We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate. Previous literature on dynamic matching focuses on "static" policies, where the matching decisions do not depend explicitly…

Heavy-tail asymptotics for the length of a busy period in a Generalised Jackson Network
Sergey Foss, Masakiyo Miyazawa, Linglong Yuan
https://arxiv.org/abs/2506.23310

Heavy-tail asymptotics for the length of a busy period in a Generalised Jackson Network
We consider a Generalised Jackson Network with finitely many servers, a renewal input and $i.i.d.$ service times at each queue. We assume the network to be stable and, in addition, the distribution of the inter-arrival times to have unbounded support. This implies that the length of a typical busy period $B$, which is the time between two successive idle periods, is finite a.s. and has a finite mean. We assume that the distributions of the service times with the heaviest tails belong to the c…

Linear Layouts of Graphs with Priority Queues
Emilio Di Giacomo, Walter Didimo, Henry F\"orster, Torsten Ueckerdt, Johannes Zink
https://arxiv.org/abs/2506.23943

Linear Layouts of Graphs with Priority Queues
A linear layout of a graph consists of a linear ordering of its vertices and a partition of its edges into pages such that the edges assigned to the same page obey some constraint. The two most prominent and widely studied types of linear layouts are stack and queue layouts, in which any two edges assigned to the same page are forbidden to cross and nest, respectively. The names of these two layouts derive from the fact that, when parsing the graph according to the linear vertex ordering, the e…

Rewatching #HappyGilmore last night, so that we could watch the sequel reminded me of a scene from my youth:
In my family’s home town of Świnoujście there’s a river. Until very recently, the only way to get across was a municipal ferry service.
Back in the 90’s and early 2000’s, it would be quite common for men with windshield wipers to walk down the queue of cars an…

Multi-dimensional queue-reactive model and signal-driven models: a unified framework
Emmanouil Sfendourakis
https://arxiv.org/abs/2506.11843 https://

Multi-dimensional queue-reactive model and signal-driven models: a unified framework
We present a Markovian market model driven by a hidden Brownian efficient price. In particular, we extend the queue-reactive model, making its dynamics dependent on the efficient price. Our study focuses on two sub-models: a signal-driven price model where the mid-price jump rates depend on the efficient price and an observable signal, and the usual queue-reactive model dependent on the efficient price via the intensities of the order arrivals. This way, we are able to correlate the evolution o…

Taiichi Ohno: I wrote about how items waiting in a queue are a form of waste, as a cautionary tale
Scrum guys coming up with the backlog: we have created the work queue from the classic manual "Don't Create A Work Queue"

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization
Connor Scully-Allison, Kevin Menear, Kristin Potter, Andrew McNutt, Katherine E. Isaacs, Dmitry Duplyakin
https://arxiv.org/abs/2507.17898

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization
Domain-specific visualizations sometimes focus on narrow, albeit important, tasks for one group of users. This focus limits the utility of a visualization to other groups working with the same data. While tasks elicited from other groups can present a design pitfall if not disambiguated, they also present a design opportunity -- development of visualizations that support multiple groups. This development choice presents a trade off of broadening the scope but limiting support for the more narro…

This https://arxiv.org/abs/2503.02982 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPF_…

Heavy-traffic Optimality of Skip-the-Longest-Queues in Heterogeneous Service Systems
We consider a discrete-time parallel service system consisting of $n$ heterogeneous single server queues with infinite capacity. Jobs arrive to the system as an i.i.d. process with rate proportional to $n$, and must be immediately dispatched in the time slot that they arrive. The dispatcher is assumed to be able to exchange messages with the servers to obtain their queue lengths and make dispatching decisions, introducing an undesirable communication overhead. In this setting, we propose a ultr…

First real test of the new cluster: encoding AV1 video. I created three Sisyphus encoding workers and decided to run some Blurays across all the servers. Wrote some Ansible to build the encoding workers because it's a pain in the ass, but right now I'm working through the first 3 videos in a queue of 12. Also, these are so much more efficient...
#homelab

This https://arxiv.org/abs/2305.13054 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Fluid limits for interacting queues in sparse dynamic graphs
Consider a network of $n$ single-server queues where tasks arrive independently at each server at rate $λ_n$. The servers are connected by a graph that is resampled at rate $μ_n$ in a way that is symmetric with respect to the servers, and each task is dispatched to the shortest queue in the graph neighborhood where it appears. We aim to gain insight in the impact of the dynamic network structure on the load balancing dynamics in terms of the occupancy process which describes the empirical dis…

I'm very busy at the moment with work and life stuff, so if I am taking a while to reply, you are in my reply queue.
Have an awesome day!

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
Stefan Koch, Peter Sanders, Marvin Williams
https://arxiv.org/abs/2507.22764 https://arxiv.org/pdf/2507.…

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maintaining strict FIFO semantics in concurrent queues leads to low throughput due to high contention at the head and tail of the queue. By relaxing the FIFO semantics to allow some reordering of elements, it becomes possible to achieve much higher scalability. This work presents two orthogonal designs for relaxed concurre…

Performance Evaluation and Threat Mitigation in Large-scale 5G Core Deployment
Rodrigo Moreira, Larissa F. Rodrigues Moreira, Fl\'avio de Oliveira Silva
https://arxiv.org/abs/2507.17850

Performance Evaluation and Threat Mitigation in Large-scale 5G Core Deployment
The deployment of large-scale software-based 5G core functions presents significant challenges due to their reliance on optimized and intelligent resource provisioning for their services. Many studies have focused on analyzing the impact of resource allocation for complex deployments using mathematical models, queue theories, or even Artificial Intelligence (AI). This paper elucidates the effects of chaotic workloads, generated by Distributed Denial of Service (DDoS) on different Network Functi…

This https://arxiv.org/abs/2505.22862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Allocation of goods and services often involves both stochastic supply and stochastic demand. Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study the design of optimal selling mechanisms in an environment where buyers with private valuations arrive stochastically and are assigned goods that also arrive stochastically, and either buyers or goods can be held in a queue at costs until allocation. The optimal mechanism dynamically leverages competitiv…

Did #MS365 just start doing greylisting? Suddenly today I have an outbound queue with everything showing “451 4.7.500 Server busy. Please try again later from [$OUTBOUNDIP]" from one of the bazillion mail.protection.outlook.com machines. Did I somehow offend the MS gods?
#Email

Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm
Yong Qi Foo, Brian Sze-Kai Cheong, Michael D. Adams
https://arxiv.org/abs/2507.21439 https://

Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm
Fixed-Point-Oriented Programming (FPOP) is an emerging paradigm designed to streamline the implementation of problems involving self-referential computations. These include graph algorithms, static analysis, parsing, and distributed computing-domains that traditionally require complex and tricky-to-implement work-queue algorithms. Existing programming paradigms lack direct support for these inherently fixed-point computations, leading to inefficient and error-prone implementations. This white…

Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks
Qiong Wu, Yu Xie, Pingyi Fan, Dong Qin, Kezhi Wang, Nan Cheng, Khaled B. Letaief
https://arxiv.org/abs/2507.19050

Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks
In this paper, we propose a general digital twin edge computing network comprising multiple vehicles and a server. Each vehicle generates multiple computing tasks within a time slot, leading to queuing challenges when offloading tasks to the server. The study investigates task offloading strategies, queue stability, and resource allocation. Lyapunov optimization is employed to transform long-term constraints into tractable short-term decisions. To solve the resulting problem, an in-context lear…

Dispatching and Pricing in Two-Sided Spatial Queues
Ang Xu, Chiwei Yan
https://arxiv.org/abs/2507.17983 https://arxiv.org/pdf/2507.17983

Dispatching and Pricing in Two-Sided Spatial Queues
We study a dispatching and pricing problem in two-sided spatial queues with fixed supply, motivated by ride-hailing and robotaxi platforms. Idle drivers queue on one side, waiting to pick up riders, while riders queue on the other, waiting to be matched with available drivers. The platform seeks to maximize net profit, penalized by rider waiting penalties, by jointly optimizing state-dependent dispatching and pricing decisions. We formulate this problem as a Markov decision process with state-d…

Sorting by pile shuffles on queue-like and stack-like piles can be hard
Kyle B. Treleaven
https://arxiv.org/abs/2506.05518 https://ar…

Sorting by pile shuffles on queue-like and stack-like piles can be hard
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of general interest concerning pile shuffle, first introduced in the prequel. These problems are characterized by: (1) bounds on the number of sequential rounds of shuffle, and piles created in each round; (2) the use of a heterogeneous mixture of queue-like and stac…

Third attempt, it calls this round replacing #ubuntu and the manual partition page seemed to have things right, but I'm surprised an installer that takes so long has so little to say. /var/log/installer peeps a DEBUG now and then, but betrays no secrets. 52 minutes and counting, just passed probert.network and another flurry of udevadm empty queue successes.

I went to my first karaoke ever today. It was in VR, but that didn't make it any less scary :neofox_nervous:
I was very hesitant to sing, but I eventually put a song in the queue. When it was my turn I was TERRIFIED, but I went and did it. I stumbled a lot with my words and froze a couple times, but even then people were really nice and even complimented me! I gave it a second go, and it was so much better :neofox_snug:
I have to repeat this next month, I feel like this is what…

A Stochastic Differential Equation Framework for Modeling Queue Length Dynamics Inspired by Self-Similarity
Shakib Mustavee, Shaurya Agarwal, Arvind Singh
https://arxiv.org/abs/2506.14059

A Stochastic Differential Equation Framework for Modeling Queue Length Dynamics Inspired by Self-Similarity
This article develops a stochastic differential equation (SDE) for modeling the temporal evolution of queue length dynamics at signalized intersections. Inspired by the observed quasiperiodic and self-similar characteristics of the queue length dynamics, the proposed model incorporates three properties into the SDE: (i) mean reversion with periodic mean, (ii) multiplicative noise, and (iii) fractional Brownian motion. It replicates key statistical features observed in real data, including the p…

Yep. A lot of very wet, very dedicated car people here today. I'm already completely soaked to the skin, but hoping it clears up later.

People in #Finland will queue for anything. Even to take a quiz about the #EU!
#WorldVillageFestival #MaailmaKylässäFestivaali

Trilobite tridents: hydrodynamic lift and stability mechanisms for queue formation
Hugh A. Trenchard, Carlton E. Brett, Matjaz Perc
https://arxiv.org/abs/2506.15922

Trilobite tridents: hydrodynamic lift and stability mechanisms for queue formation
The bizarre trident-like cephalic projections of Walliserops trifurcatus have previously been interpreted as sexually selected weapons for intraspecific combat. We propose an alternative hypothesis grounded in biomechanics and collective behavior, that tridents evolved as adaptations for hydrodynamic lift and queue stability, conferring energetic advantages during group locomotion. Under this hypothesis, lift could offset gravitational forces, enabling greater locomotor efficiency, while mechan…

Strategic Customer Behavior in an M/M/1 Feedback Queue with General Payoffs
Peter Taylor, Jiesen Wang
https://arxiv.org/abs/2507.11263 https://

Strategic Customer Behavior in an M/M/1 Feedback Queue with General Payoffs
We consider an M/M/1 feedback queue in which service attempts may fail, requiring the customer to rejoin the queue. Arriving customers act strategically, deciding whether to join the queue based on a threshold strategy that depends on the number of customers present. Their decisions balance the expected service reward against the costs associated with waiting, while accounting for the behavior of others. This model was first analyzed by Fackrell, Taylor and Wang (2021), who assumed that waiti…

Finite-Time Information-Theoretic Bounds in Queueing Control
Yujie Liu, Vincent Y. F. Tan, Yunbei Xu
https://arxiv.org/abs/2506.18278 https://

Finite-Time Information-Theoretic Bounds in Queueing Control
We establish the first finite-time information-theoretic lower bounds-and derive new policies that achieve them-for the total queue length in scheduling problems over stochastic processing networks with both adversarial and stochastic arrivals. Prior analyses of MaxWeight guarantee only stability and asymptotic optimality in heavy traffic; we prove that, at finite horizons, MaxWeight can incur strictly larger backlog by problem-dependent factors which we identify. Our main innovations are 1) a …

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Yeon-Koo Che, Andrew B. Choi
https://arxiv.org/abs/2505.22862 https://

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor
Allocation of goods and services often involves both stochastic supply and stochastic demand. Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study the design of optimal selling mechanisms in an environment where buyers with private valuations arrive stochastically and are assigned goods that also arrive stochastically, and either buyers or goods can be held in a queue at costs until allocation. The optimal mechanism dynamically leverages competitiv…

This https://arxiv.org/abs/2505.06780 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csOS_…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Autoware is an autonomous driving system implemented on Robot Operation System (ROS) 2, where an end-to-end timing guarantee is crucial to ensure safety. However, existing ROS 2 cause-effect chain models for analyzing end-to-end latency struggle to accurately represent the complexities of Autoware, particularly regarding sync callbacks, queue consumption patterns, and feedback loops. To address these problems, we propose a new scheduling model that decomposes the end-to-end timing constraints o…

Age of Information in Unreliable Tandem Queues
Muthukrishnan Senthilkumar, Aresh Dadlani, Hina Tabassum
https://arxiv.org/abs/2506.09245 https://

Age of Information in Unreliable Tandem Queues
Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness. Existing AoI models often assume multi-hop communication networks with fully reliable nodes, which may not accurately capture scenarios involving node transmission failures. This paper presents an analytical framework for two configurations of tandem queue syst…

Multi-Queue SSD I/O Modeling & Its Implications for Data Structure Design
Erin Ransom, Andrew Lim, Michael Mitzenmacher
https://arxiv.org/abs/2507.06349

Multi-Queue SSD I/O Modeling & Its Implications for Data Structure Design
Understanding the performance profiles of storage devices and how best to utilize them has always been non-trivial due to factors such as seek times, caching, scheduling, concurrent access, flash wear-out, and garbage collection. However, analytical frameworks that provide simplified abstractions of storage performance can still be accurate enough to evaluate external memory algorithms and data structures at the design stage. For example, the Disk Access Machine (DAM) model assumes that a stora…

The Supermarket Model on a Dynamic Regular Hypergraph
John Fernley, Bal\'azs Gerencs\'er
https://arxiv.org/abs/2507.03931 https://

The Supermarket Model on a Dynamic Regular Hypergraph
The supermarket model is a system of $n$ queues each with serving rates $1$ and arrival rates $λ$ per vertex, where tasks will move on arrival to the shortest adjacent queue. We consider the supermarket model in the small $λ$ regime on a large dynamic configuration hypergraph with stubs swapping their hyperedge membership at rate $κ$. This interpolates previous investigations of the supermarket model on static graphs of bounded degree (where an exponential tail produces a logarithmic queue…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Atsushi Yano, Takuya Azumi
https://arxiv.org/abs/2505.06780 https://…

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
Autoware is an autonomous driving system implemented on Robot Operation System (ROS) 2, where an end-to-end timing guarantee is crucial to ensure safety. However, existing ROS 2 cause-effect chain models for analyzing end-to-end latency struggle to accurately represent the complexities of Autoware, particularly regarding sync callbacks, queue consumption patterns, and feedback loops. To address these problems, we propose a new scheduling model that decomposes the end-to-end timing constraints o…

June 7: Describe some facet—hidden or overt—which can be found in each and every one of your works.
June 8: Talk about something you wrote and later removed, and why.
I have a tendency to hoard quotes, one-liners and other emotional shortcuts to use later as homages for the reader to catch.
While I very much like them, I also often feel them to be my "guilty pleasure", so they are also at the beginning of the queue when I need to cut — for example, for Mastodon it…

This https://arxiv.org/abs/2504.02207 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Finite-Time Behavior of Erlang-C Model: Mixing Time, Mean Queue Length and Tail Bounds
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in real life do not operate in a steady state, so there is a clear discrepancy in translating theoretical queueing results to practical applications. To this end, we provide a finite-time convergence for Erlang-C systems (also known as $M/M/n$ queues), providin…