RUN enhancement through Bayesian networks

References

• Garey MR, Johnson DS. Computers and intractability: a guide to the theory of np-completeness (series of books in the mathematical sciences). New York (NY): W. H. Freeman; 1979.
   Google Scholar
• Lehoczky JP. Real-time queueing theory. Washington (DC): RTSS; 1996.
   Google Scholar
• Iverson MA, Ozguner F, Potter LC. Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment. Heterogeneous Computing Workshop, 1999. (HCW '99) Proceedings. Eighth; 1999. p. 99–111
   Google Scholar
• Doytchinov B, Lehoczky J, Shreve S. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann Appl Probab. 2001;11(2):332–378. Available from: https://doi.org/10.1214/aoap/1015345295.
   Google Scholar
• Kruk L, Lehoczky J, Shreve S, et al. Earliest-deadline-first service in heavy-traffic acyclic networks. Ann Appl Probab. 2004;14(3):1306–1352. Available from: https://doi.org/10.1214/105051604000000314.
   Google Scholar
• Li K, Tang X, Veeravalli B, et al. Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans Comput. 2015;64(1):191–204.
   Google Scholar
• Stankovic JA, Ramamritham K. What is predictability for real-time systems? Real Time Syst. 1990;2(4):247–254. Available from: https://doi.org/10.1007/BF01995673.
   Google Scholar
• Liu CL, Layland JW. Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM. 1973;20(1):46–61. Available from: http://doi.acm.org/10.1145/321738.321743.
   Google Scholar
• Baruah SK, Cohen NK, Plaxton CG, et al. Proportionate progress: a notion of fairness in resource allocation. Algorithmica. 1996;15(6):600–625. Available from: https://doi.org/10.1007/BF01940883.
   Google Scholar
• Andersson B, Jonsson J. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.; July; 2003. p. 33–40.
   Google Scholar
• Albers S, Antoniadis A, Greiner G. On multi-processor speed scaling with migration. J Comput Syst Sci. 2015;81(7):1194–1209. Available from: http://www.sciencedirect.com/science/article/pii/S0022000015000239.
   Google Scholar
• Andersson B, Jonsson J. Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition. Proceedings Seventh International Conference on Real-Time Computing Systems and Applications; Dec; 2000. p. 337–346
   Google Scholar
• Méndez-Díaz I, Orozco J, Santos R, et al. Energy-aware scheduling mandatory/optional tasks in multicore real-time systems. Int Trans Oper Res. 2016;24(1–2):173–198. Available from: https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12328.
   Google Scholar
• Baruah S, Carpenter J. Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. Proceedings - 15th Euromicro Conference on Real-Time Systems, ECRTS; 2003; Porto, Portugal. p. 195–202.
   Google Scholar
• Dertouzos ML, Mok AK. Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans. Softw Eng. 1989;15(12):1497–1506.
   Google Scholar
• Lam TW, Lee LK, To IKK, et al. Improved multi-processor scheduling for flow time and energy. J Scheduling. 2012;15(1):105–116. Available from: https://doi.org/10.1007/s10951-009-0145-5.
   Google Scholar
• DazRamrez A, MejaAlvarez P, LeyvaDelFoyo L. Comprehensive comparison of schedulability tests for uniprocessor rate-monotonic scheduling. J Appl Res Technol. 2013;11(3):408–436. Cited By 5.
   Google Scholar
• Regnier P, Lima G, Massa E, et al. Multiprocessor scheduling by reduction to uniprocessor: An original optimal approach. Real Time Syst. 2013;49(4):436–474. Cited By 8.
   Google Scholar
• Stone LD, Keller CM, Kratzke TM, et al. Search for the wreckage of air france flight af 447. Statist Sci. 2014;29(1):69–80. Available from: http://dx.doi.org/10.1214/13-STS420.
   Google Scholar
• Sha L, Abdelzaher T, Årzén KE. Real time scheduling theory: a historical perspective, et al. Real Time Syst. 2004;28(2):101–155. Available from: https://doi.org/10.1023/B:TIME.0000045315.61234.1e.
   Google Scholar
• Kim JH, Pearl J. A computational model for causal and diagnostic reasoning in inference systems. IJCAI 1983;83:190–193.
   Google Scholar
• Pearl J. Fusion, propagation, and structuring in belief networks. Artif Intell. 1986;29(3):241–288.
   Google Scholar
• Pearl J. Probabilistic reasoning in intelligent systems: networks of plausible inference. San Francisco (CA): Morgan Kaufmann; 1988.
   Google Scholar