Preemptable ticket spinlocks: improving consolidated performance in the cloud
暂无分享,去创建一个
[1] Paul E. McKenney,et al. READ-COPY UPDATE: USING EXECUTION HISTORY TO SOLVE CONCURRENCY PROBLEMS , 2002 .
[2] Brian D. Noble,et al. When Virtual Is Better Than Real , 2001 .
[3] Minglu Li,et al. Dynamic adaptive scheduling for virtual machines , 2011, HPDC '11.
[4] John K. Ousterhout. Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.
[5] Michael L. Scott,et al. Synchronization without contention , 1991, ASPLOS IV.
[6] William N. Scherer,et al. Preemption Adaptivity in Time-Published Queue-Based Spin Locks , 2005, HiPC.
[7] Thomas Friebel,et al. How to Deal with Lock Holder Preemption , 2008 .
[8] Michael L. Scott,et al. Algorithms for scalable synchronization on shared-memory multiprocessors , 1991, TOCS.
[9] Hyong S. Kim,et al. Is co-scheduling too expensive for SMP VMs? , 2011, EuroSys '11.
[10] Chao Liu,et al. Lock-Visor: An Efficient Transitory Co-scheduling for MP Guest , 2012, 2012 41st International Conference on Parallel Processing.
[11] Koushik Chakraborty,et al. Hardware support for spin management in overcommitted virtual machines , 2006, 2006 International Conference on Parallel Architectures and Compilation Techniques (PACT).
[12] Joshua LeVasseur,et al. Towards Scalable Multiprocessor Virtual Machines , 2004, Virtual Machine Research and Technology Symposium.
[13] John K. Ousterhout,et al. Scheduling Techniques for Concurrent Systems , 1982, ICDCS.