Related papers: Multi-dimensional state space collapse in non-comp…
We analyse time evolution of spread complexity (SC) in an isolated interacting quantum many-body system when it is subjected to a sudden quench. The differences in characteristics of the time evolution of the SC for different time scales is…
The probability distributions, as well as the mean values of stochastic currents and fluxes, associated with a driven Langevin process, provide a good and topologically protected measure of how far a stochastic system is driven out of…
Drone delivery systems violate a core assumption in classical queueing models: server capacity is not fixed. Drones (servers) periodically must recharge, creating random fluctuations in service availability. We introduce an Erlang--S$^{*}$…
The evolution of 5G and Beyond networks has enabled new applications with stringent end-to-end latency requirements, but providing reliable low-latency service with high throughput over public wireless networks is still a significant…
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay performance of systems with multiserver jobs. We consider queueing…
The fluid and solid equations of state for hard parallel squares and cubes are reinvestigated here over a wide range of densities. We use a novel single-speed version of molecular dynamics. Our results are compared with those from earlier…
Power management in multi-server data centers~especially at scale is a vital issue of increasing importance in cloud computing paradigm. Existing studies mostly consider thresholds on the number of idle servers to switch the servers on or…
We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…
In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with…
The rapid proliferation of omnichannel retail strategies has fundamentally transformed store replenishment operations in uncertain supply chain environments. With retail stores increasingly acting as hybrid fulfillment centers, pooled…
We study the accumulation of resources within a target due to the interplay between continual delivery, driven by 1D stochastic search processes, and sequential consumption. The assumption of sequential consumption is key because it changes…
This work develops tools to understand how quantum information spreads, scrambles, and is reshaped by measurements in many-body systems. First, I study scrambling and pseudorandomness in the Brownian Sachdev-Ye-Kitaev (SYK) model,…
Quantum superposition says that any physical system simultaneously exists in all of its possible states, the number of which is exponential in the number of entities composing the system. The strength of presence of each possible state in…
The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues.…
In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
We address a single server queue control problem (QCP) in heavy traffic originating from Lee and Weerasinghe (2011). The state process represents the offered waiting time, the customer arrival has a state-dependent intensity, and the…
We consider a model inspired by compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. The constraints are represented by a bipartite graph or network that…
Model predictive control has shown potential to enhance the robustness of quantum control systems. In this work, we propose a tractable Stochastic Model Predictive Control (SMPC) framework for finite-dimensional quantum systems under…
Motivated by medium access control for resource-challenged wireless Internet of Things (IoT), we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with…