A scheduling solution of class priority multiple queue(CPMQ)is proposed to solve the problem that the response time to graphic tasks is not ensured by existing task scheduling systems of GPU under multitask conditions
and the schedule is implemented on an embedded system. Multiple tasks on GPU are firstly classified into three classes of tasks
that is
graphic tasks
real-time graphic tasks and general purpose computing tasks. These three classes of tasks then queued respectively with different queuing policy. Graphic tasks and general purpose computing tasks are queued by their priorities
while real-time graphic tasks are queued by their deadlines. When the multi-class tasks are scheduled
real-time graphic tasks are selected at first
and then graphic tasks and general purpose computing tasks are selected out using a weighted fair queuing algorithm. Experimental results and comparisons with the original scheduling system of ARM's GPU show that CPMQ increases the frame rate of reel time graphic tasks by 5%-20% without significant increase in execution time of general purpose computing tasks and scheduling expense.
关键词
Keywords
references
JOG A, KAYIRAN O, NACHIAPPAN N C, et al. OWL: cooperative thread array aware scheduling techniques for improving GPGPU performance[C]∥ Proceedings of the 18th International Conference on Architectural Support for Programming Languages and Operating Systems. New York, NY, USA: ACM, 2013: 395-406.
PAUL B. Introduction to the direct rendering infrastructure[EB/OL].(2000-08-10)[2014-03-23]. http:∥dri.sourceforge.net/doc/DRIintro.html.
KATO S, LAKSHMANAN K, RAJKUMAR R, et al. TimeGraph: GPU scheduling for real-time multi-tasking environments[C]∥ Proceedings of the 2011 USENIX Conference on USENIX Annual Technical Conference. Berkeley, CA, USA: USENIX Association, 2011: 17-30.
MARROQUIM R, MAXIMO A. Introduction to GPU programming with GLSL[C]∥ Proceedings of the 2009 Tutorials of the 22nd Brazilian Symposium on Computer Graphics and Image Processing. Washington, DC, USA: IEEE Computer Society, 2009: 3-16.[5] BAUTIN M, DWARAKINATH A, CHIUEH T. Graphic engine resource management[C]∥Proceedings of the International Society for Optics and Photonics. Bellingham, WA, USA: SPIE, 2008: 68180O.
PRONOVOST S. Windows display driver model(WDDM)v2 and beyond[C/OL]∥ Proceedings of the Windows Hardware Engineering Conference.[2014-03-23].http:∥ci.nii.ac.jp/naid/10018383501/.
WONG C S, TAN I, KUMARI R D, et al. Towards achieving fairness in the Linux scheduler[J]. Operating Systems Review, 2008, 42(5): 34-43.
BENNETT J C, ZHANG Hui. WF2Q: worst-case fair weighted fair queuing[C]∥ Proceedings of the 15th Annual Joint Conference of the IEEE Computer Societies on Networking the next Generation. Piscataway, NJ, USA: IEEE, 1996: 120-128.
WONG H T. Packet scheduling using dual weight single priority queue: USA, 6570883[P]. 2003-05-27.
DOYTCHINOV B, LEHOCZKY J, SHREVE S. Real-time queues in heavy traffic with earliest-deadline-first queue discipline[J]. The Annals of Applied Probability, 2001, 11(2): 332-378.