Browse > Article
http://dx.doi.org/10.5573/JSTS.2017.17.1.162

Earliest Virtual Deadline Zero Laxity Scheduling for Improved Responsiveness of Mobile GPUs  

Choi, Seongrim (Department of Computer Science and Engineering, Chungnam National University)
Cho, Suhwan (Department of Computer Science and Engineering, Chungnam National University)
Park, Jonghyun (Department of Computer Science and Engineering, Chungnam National University)
Nam, Byeong-Gyu (Department of Computer Science and Engineering, Chungnam National University)
Publication Information
JSTS:Journal of Semiconductor Technology and Science / v.17, no.1, 2017 , pp. 162-166 More about this Journal
Abstract
Earliest virtual deadline zero laxity (EVDZL) algorithm is proposed for mobile GPU schedulers for its improved responsiveness. Responsiveness of user interface (UI) is one of the key factors in evaluating smart devices because of its significant impacts on user experiences. However, conventional GPU schedulers based on completely fair scheduling (CFS) shows a poor responsiveness due to its algorithmic complexity. In this letter, we present the EVDZL scheduler based on the conventional earliest deadline zero laxity (EDZL) algorithm by accommodating the virtual laxity concept into the scheduling. Experimental results show that the EVDZL scheduler improves the response time of the Android UI by 9.6% compared with the traditional CFS scheduler.
Keywords
GPU scheduler; responsiveness; BFS; EDZL; mobile GPU; smart devices;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Ng et al., "Design for Low-Latency Direct-Touch Input," In Proc. of ACM UIST'12, pp. 453-464, Oct., 2012.
2 T. Li et al., "Efficient and Scalable Multiprocessor Fair Scheduling Using Distributed Weighted Round-Robin," in Proc. of the ACM Symp. on Principles and Practice of Parallel Programming (PPoPP), pp. 65-74, Feb. 2009.
3 T. Groves et al. (2009). "BFS vs. CFS - Scheduler Comparison," The University of New Maxico, http://cs.unm.edu/-eschulte/classes/cs587/data/bfsv-cfs_groves-knockel-schulte.pdf (accessed Jan. 5, 2017).
4 Y. J. Choi and H.-M. Kim, "A New Scheduling Scheme for High-Speed Packet Networks: Eaeliest Virtual Deadline First," Comput. Commun. Elsevier J., Vol. 30, No. 10, pp. 2291-2300, July, 2007.   DOI
5 C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, Vol. 20, No. 1, pp. 46-61, Jan. 1973.   DOI
6 M. L. Dertouzos and A. K. Mok, "Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks," IEEE Trans. Software Engineering, Vol. 15, No. 12, pp. 1497-1506, Dec., 1989.   DOI
7 S. K. Lee, "On-Line Multiprocessor Scheduling Algorithms for Real-Time Tasks," in Proc. of the IEEE Region 10's Ninth Ann. Int'l Conf., pp. 607-611, Aug. 1994.