Towards Efficient Task Scheduling on 2D Reconfigurable FPGAs

Abstract:

With the rapid development of dynamical partial reconfiguration technology, FPGA (Field Programmable Gate Array) is able to allow independent tasks to be executed concurrently without interfering with each other, which increases its flexibility and performance, but on the other hand leads to multi-task scheduling problem. The task scheduling in this paper is the problem of task sequencing, which adjusts the entering sequence of the incoming tasks with the consideration of the attributes of tasks and the utilization of FPGA. A conditional preemption based task sequencing method is proposed that allows tasks that arrive later to be executed in advance as long as the previous tasks can still be guaranteed to enter the FPGA on time. Simulations show that these methods can effectively decrease the waiting ratio of task sets, thus improving the flexibility and utilization of FPGA.

• Periodical: Advanced Materials Research (Volumes 850-851)
• Pages: 961-964
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.850-851.961
• Online since: December 2013
• Authors: Peng Wang, Jun Feng Zhang, Xue Chen*
• Keywords: FPGA, MER, Scheduling

References

[1] J. Cui, X. Chen, Y.M. Lei, W.M. Xu: 2010 IEEE 10th International Conference Computer and Information Technology (Bradford, England, June 29-July 1 2010), (2010), pp.99-106.

[2] E. Coffman, J. Csirik, G. Woeginge: Handbook of Applied Optimization (Oxford University Press, England 2002).

[3] Z.H. Gu, W.C. Liu, J. Xu, et al: Microprocessors and Microsystems, vol. 33 (2009), pp.374-387.

[4] L. Gu, G.L. Xu, Y.R. Wang: Computer Measurement and Control, vol. 15 (2007) no. 11, pp.1415-1418. (In Chinese).

[5] M. Handa and R. Vemuri: Proc. of Conf. on Design, automation and test in Europe (Europe, Feb. 16-20, 2004), vol. 1, pp.744-745.

[6] P. Li, J.L. Lan, Kun J: Journal of Information Engineering University, vol. 10 (2009) no. 1, pp.99-101. (In Chinese).

[7] Information on http: / www. xilinx. com/support/documentation/data_sheets.

[8] B. Michael: Multimedia System Design, vol. 26 (1998) no. 9, pp.44-47.

[9] P. Lysaght, J. Stockwood: IEEE Transactions on Very Large Scale Integration Systems, vol. 4 (1996) no. 3, pp.381-390.

DOI: 10.1109/92.532038

[10] M. R. Garey, D.S. Johnson: Computers and Intractability: a guide to the theory of NP-Completeness (W.H. Freeman&Co, USA 1990).

[11] S. Vassiliadis, S. Wong, G. Gaydadjiev, et al: IEEE Transactions on Computers, vol. 53 (2004) no. 11, pp.1363-1375.

[12] S. Fekete, E. Kohler, J. Teich: Proc. of Conf. on Design, Automation and Test in Europe (Munich, Mar 13-16, 2001), (2001), pp.658-665.

[13] H. Walder, C. Steiger, M. Platzner: Proc. of Parallel and Distributed Processing Symposium (Washington, USA, April 22-26, 2003), (2003), paper ID. 1213329.

[14] X.D. Xu, C. Xu, Y. Liu, R.F. Li: Computer Engineering, vol. 37 (2011) no. 6, pp.239-241. (In Chinese).

[15] J. F. Zhang, X. Chen: Applied Mechanics and Materials, vol. 80-81 (2011), pp.1226-1231.

[16] X. G. Zhou, L. Liang, X. Z. Huang, C. L. Peng: IEEE International Conference on Field Programmable Technology (Bangkok, Thailand, June 29-July 1, 2010), (2010), pp.99-106.