A study on video browsing strategies
A study on video browsing strategies
Proceedings of the seventeenth ACM symposium on Operating systems principles
The cubic mouse: a new device for three-dimensional input
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Scalable Parallel Programming with CUDA
Queue - GPU Computing
Distributed Resource Kernels: OS Support for End-To-End Resource Isolation
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
GViM: GPU-accelerated virtual machines
Proceedings of the 3rd ACM Workshop on System-level Virtualization for High Performance Computing
vCUDA: GPU accelerated high performance computing in virtual machines
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hi-index | 0.00 |
Heterogeneous multi-core processors are now widely deployed to meet computation requirements for multimedia applications on embedded mobile devices. However, due to the difference on computation capability of heterogeneous multi-cores, it is challenging to share the load among cores and to better utilize the cores on the processor. In this work, we develop a fairness scheduler to share the load among cores to meet the above challenge. The developed framework ensures that each virtual machine receives its proportional share of computation time over different processing elements. To fairly schedule the tasks on the platform, VM-aware fair scheduler (VMAFS) takes into account the preemptibility of processes on co-processors. A family of algorithms is designed to schedule tasks on preemptive and non-preemptive processing elements. We define fairness on such architectures and use this metric to efficiently drive VMAFS algorithm so as to fairly manage non-preemptive computing resources. Performance evaluations result show that when VMAFS algorithm is used, scheduling fairness is not sensitive to the amount of computation time of non-preemptive tasks. In addition, VMAFS algorithm greatly outperforms credit-based scheduling algorithm, which is deployed in existing virtualization environment.