Çok İşlemcili Gerçek Zamanlı Sistemlerde Zamanlama Algoritmaları
Öz
Anahtar Kelimeler
Kaynakça
- Andersson, B. (2003). Static Priority Scheduling in Multiprocessors. In PhD Thesis, Department of Comp.Eng., Chalmers University, 2003.
- Andersson, B. ve Jonsson, J. (2000). Fixed-Priority Preemptive Multiprocessor Scheduling: To Partition or not to Partition. In IEEE Int’l Conference on Real Time Computing Systems and Applications, Dec. 2000.
- Baker, T. P. (2003). Multiprocessor EDF and Deadline Monotonic Schedulability Analysis. In IEEE Real-Time Systems Symposium, Dec, 2003.
- Beitollahi, H. ve Deconinck, G. (2006). Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems. In 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).
- Dhall, S. K. Ve Liu, C. L. (1978). On a Real-Time Scheduling Problem. In Operations Research, vol. 26, number 1, 127-140, 1978.
- Garey, M. R. ve Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. In W. H. Freeman, New York, 1979.
- Goossens, J., Funk, S., & Baruah, S. (2003). Priority-Driven Scheduling of Periodic Task Systems on Multiprocessor. In Real Time Systems, vol 25, 187-205, 2003.
- Guan, N. (2016). Techniques for Building Timing-Predictable Embedded Systems. In Springer International Publishing Switzerland, pp. 15, 2016.
- Guochuan, Z. ve Enyu, Y. (1998). The FFD Algorithm for the Bin Packing Problem with Kernel Items. In Applied Mathematics-A Journal of Chinese Universities, pp. 2, 1998.
- Ha, R. ve Liu, J. (1994). Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems. In Int’l Conf. on Distributed Computing Systems, pp. 162-171.