Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"State space collapse"”.

  1. State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems and Applications

    … is a general framework for establishing state space collapse results in the Halfin and Whitt many-server asymptotic regime for parallel server systems having multiple customer classes. In our work, state space collapse refers to a decrease in the dimension of the processes tracking the …

    gatech Repository record for State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems and Applications (opens in a new tab)

  2. Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-02-28 without embargo terms

    uiuc Repository record for Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails (opens in a new tab)

  3. LOAD BALANCING FOR REMOTE QUEUES

    … policy. This policy is proven to achieve state-space-collapse, where queue lengths asymptotically equalize. On top of that, the proposed policy is proved to be asymptotically optimal for minimizing a customer's time to service (i.e., the sum of the traveling delay and the waiting time). We …

    nus Repository record for LOAD BALANCING FOR REMOTE QUEUES (opens in a new tab) Download file for LOAD BALANCING FOR REMOTE QUEUES (opens in a new tab)

  4. WWTA load-balancing for parallel-server systems with heterogeneous servers and multi-scale heavy traffic limits for generalized Jackson networks

    … The first part of the thesis concerns the steady-state performance approximation of WWTA policy in heavy traffic. Instead of proving a stochastic process limit followed by a limit interchange -- a method that dominates the literature, our method works directly with pre-limit BAR that characterizes …

    cornell Repository record for WWTA load-balancing for parallel-server systems with heterogeneous servers and multi-scale heavy traffic limits for generalized Jackson networks (opens in a new tab)

  5. Dynamic Control in Stochastic Processing Networks

    … in that their implementation uses minimal state information of the network. The deployment of a resource (server) is decided based on the queue lengths in its serviceable buffers and the queue lengths in their immediate downstream buffers. In particular, the decision does not use arrival …

    gatech Repository record for Dynamic Control in Stochastic Processing Networks (opens in a new tab)

  6. THREE ESSAYS ON DISCRETE CHOICE LATENT CLASS MODEL, ONLINE REUSABLE RESOURCE ALLOCATION AND TRANSFORMER MODEL FOR OFFLINE REINFORCEMENT LEARNING

    … establishing similar exponential convergence and state-space collapse results in more complex control settings. The third part proposes the Re-evaluated Transformer model for model-free offline reinforcement learning tasks to both better learn state values and to address data coverage issues. The …

    cornell Repository record for THREE ESSAYS ON DISCRETE CHOICE LATENT CLASS MODEL, ONLINE REUSABLE RESOURCE ALLOCATION AND TRANSFORMER MODEL FOR OFFLINE REINFORCEMENT LEARNING (opens in a new tab)

  7. ASYMPTOTIC ANALYSIS OF SINGLE-HOP STOCHASTIC PROCESSING NETWORKS USING THE DRIFT METHOD

    … tight. In the first step, one shows state-space collapse, which, intuitively, means that one detects the bottleneck(s) of the system. In the second step, one sets to zero the drift of a carefully chosen test function. Then, using state-space collapse, one can obtain the desired …

    gatech Repository record for ASYMPTOTIC ANALYSIS OF SINGLE-HOP STOCHASTIC PROCESSING NETWORKS USING THE DRIFT METHOD (opens in a new tab)

  8. Policy robustness : robust stability of multiclass queueing networks

    … (stability under any QR policy) into (i) robust state-space collapse and (ii) robust stability of the Skorohod problem (SP) representing the fluid workload. Sufficient conditions for both are specified in terms of, and make new connections to, optimization problems. We use these optimization …

    texas Repository record for Policy robustness : robust stability of multiclass queueing networks (opens in a new tab)

  9. Limited processor sharing queues and multi-server queues

    We study two classes of stochastic systems, the limited processor sharing system and the multi-server system. They share the common feature that multiple jobs/customers are being processed simultaneously, which makes the study of them intrinsically difficult. In the limited processor sharing …

    gatech Repository record for Limited processor sharing queues and multi-server queues (opens in a new tab)