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 7 of 7 for “"CPU scheduling"”.

  1. CPU scheduling in robotics & AR/VR applications

    … constrained resources, this leads to a difficult scheduling problem. In practice – system designers manually tune params for their specific hardware and application, while real-time scheduling approaches assume static periodic schedules – both of which result in suboptimal application performance …

    uiuc Repository record for CPU scheduling in robotics & AR/VR applications (opens in a new tab)

  2. Estimating memory locality for virtual machines on NUMA systems

    … While VM memory demand is often satisfied by CPU caches, memory-intensive workloads may induce a higher rate of last-level cache misses, requiring more accesses to RAM. On today's typical NUMA systems, accessing local RAM is approximately 50% faster than remote RAM. We discovered that …

    mit Repository record for Estimating memory locality for virtual machines on NUMA systems (opens in a new tab)

  3. Achieving high CPU efficiency and low tail latency in datacenters

    … other hand, datacenter operators require high CPU efficiency in order to reduce operating costs. Unfortunately, today's systems do a poor job of providing low latency and high CPU efficiency simultaneously. This dissertation presents Shenango, a system that improves CPU efficiency while …

    mit Repository record for Achieving high CPU efficiency and low tail latency in datacenters (opens in a new tab)

  4. Contention-resilient overcommitment for serverless deployments

    … of overcommitment because it increases kernel scheduling overhead when managing large number of colocated containers. This dissertation proposes a host-focused approach to addressing the workload colocation problem in the context of serverless-style Linux container workloads and CPU resources. …

    cambridge Repository record for Contention-resilient overcommitment for serverless deployments (opens in a new tab)

  5. Aggregated service consolidation by multi-server virtualization

    … dealing with heterogeneous workloads such as CPU, memory and network intensive hosted applications which put a strain on different computing resources. By doing so, a service provider reaps maximum benefits from the live migration process. This study aims to optimize the live migration process …

    cape-town Repository record for Aggregated service consolidation by multi-server virtualization (opens in a new tab)

  6. Garbage Collection Scheduling for Utility Accrual Real-Time Systems

    Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU

    vt Repository record for Garbage Collection Scheduling for Utility Accrual Real-Time Systems (opens in a new tab)