Abstract
Avionics is confronted with transitioning from a federated avionics architecture to an Integrated Modular Avionics (IMA) architecture. IMA architectures utilize shared, configurable computing, communication, and I/O resources to increase system scalability. Therefore, resources scheduling becomes a critical issue for IMA. This paper focuses on the process scheduling. We use preemption threshold scheduling strategy to improve process scheduling performance, and propose a two-stage tabu algorithm to optimize the preemption threshold and the priority respectively. Firstly, we investigate a convergence criterion to stop iteration of level-i busy period which is used to calculate the worse-case response time. Secondly, we propose the difference analysis method based on weight to evaluate the optimal schedule. Finally, we propose TS-preemption threshold and priority optimization algorithm to obtain the near-optimal assignment of the priority and the preemption threshold. The experiment results of different sizes of process scheduling problems illustrate the validity and effectivity of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Miller, S.P., Cofer, D.D., Sha, L., Meseguer, J., Al-Nayeem, A.: Implementing logical synchrony in integrated modular avionics. In: 2009 IEEE/AIAA 28th Digital Avionics Systems Conference, Orlando, FL, pp. 1.A.3-1–1.A.3-12 (2009)
Ju, H., Wang, S., Zhao, T.: A modeling method of IMA dynamic reconfiguration based on AADL. In: 2015 First International Conference on Reliability Systems Engineering (ICRSE), Beijing, pp. 1–5 (2015)
Aeronautical Radio, Inc.: ARINC653 P1-2, Avionics application software standard interface part 1-required services, pp. 2–45 (2006)
Pan, L.Q., He, C., Tian, Y., Su, Y.S., Zhang, X.Y.: A region division based diversity main-taining approach for many-objective optimization. Integr. Comput. Aided Eng. 24(3), 1–18 (2017)
George, L., Rivierre, N., Spuri, M.: Preemptive and non-preemptive real-time uni-processor scheduling. Technical report N2966, INRIA, pp. 1–55 (1996)
Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real Time Syst. 2, 301–324 (1990)
Marouf, M., Sorel, Y.: Scheduling non-preemptive hard real-time tasks with strict periods. In: ETFA 2011, Toulouse, pp. 1–8 (2011)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. Assoc. Comput. Mach. 20, 40–61 (1973)
Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of Real-Time Systems Symposium, Santa Monica, CA, pp. 166–171 (1989)
Bertossi, A.A., Fusiello, A., Mancini, L.V.: Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks. In: Proceedings of the 11th International Parallel Processing Symposium, Geneva, pp. 133–138 (1997)
Wang, Y., Saksena, M.: Scheduling fixed-priority tasks with preemption threshold. In: Sixth International Conference on Real-Time Computing Systems and Applications, RTCSA 1999, Hong Kong, pp. 328–335 (1999)
Lehoczky, J.P.: Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11th Real-Time Systems Symposium, Lake Buena Vista, FL, pp. 201–209 (1990)
Bril, R.J., Lukkien, J.J., Verhaegh, W.F.J.: Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited. In: 19th Euromicro Conference on Real-Time Systems (ECRTS 2007), Pisa, pp. 269–279 (2007)
Joseph, M., Pandya, P.: Finding response times in a real-time system. Comput. J. 29, 390–395 (1986)
Redell, O., Torngren, M.: Calculating exact worst case response times for static priority scheduled tasks with offsets and jitter. In: Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 164–172 (2002)
Keskin, U., Bril, R.J., Lukkien, J.J.: Exact response-time analysis for fixed-priority preemption-threshold scheduling. In: 2010 IEEE 15th Conference on Emerging Technologies and Factory Automation (ETFA 2010), Bilbao, pp. 1–4 (2010)
Buttazzo, G.C., Bertogna, M., Yao, G.: Limited preemptive scheduling for real-time systems. A survey. IEEE Trans. Industr. Inf. 9(1), 3–15 (2013)
He, L., Yabo, L., Hong, L.: Schedule optimization for NC resource sharing based-on greed algorithm and Tabu search. In: 2009 Second International Conference on Intelligent Computation Technology and Automation, Changsha, Hunan, pp. 282–285 (2009)
Darmawan, I., Kuspriyanto, Priyana, Y., Joseph, M.I.: Grid computing process improvement through computing resource scheduling using genetic algorithm and Tabu Search integration. In: 2012 7th International Conference on Telecommunication Systems, Services, and Applications (TSSA), Bali, pp. 330–334 (2012)
Lee, J., Shin, K.G.: Preempt a job or not in EDF scheduling of uniprocessor systems. IEEE Trans. Comput. 63(5), 1197–1206 (2014)
Acknowledgments
This research is supported by the National Natural Science Foundation of China under Grant No. 61671041.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhou, Q., Lu, H., Qin, H., Shi, J., Zhou, R. (2017). TS-Preemption Threshold and Priority Optimization for the Process Scheduling in Integrated Modular Avionics. In: He, C., Mo, H., Pan, L., Zhao, Y. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2017. Communications in Computer and Information Science, vol 791. Springer, Singapore. https://doi.org/10.1007/978-981-10-7179-9_2
Download citation
DOI: https://doi.org/10.1007/978-981-10-7179-9_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7178-2
Online ISBN: 978-981-10-7179-9
eBook Packages: Computer ScienceComputer Science (R0)