1. B. Andersson, J. Jonsson, Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling, in Proceedings of the IEEE Real-Time Systems Symposium, Work-in-Progress Session (2000)
2. B. Andersson, J. Jonsson, The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%, in Real-Time Systems, 2003. Proceedings. 15th Euromicro Conference on, (IEEE, 2003), pp. 33–40
3. P. Altenbernd, Deadline-monotonic software scheduling for the co-synthesis of parallel hard real-time systems, in Proceedings of the 1995 European conference on Design and Test (IEEE Computer Society, 1995), p. 190
4. J.H. Anderson, A. Srinivasan, Early-release fair scheduling, in Real-Time Systems, 2000. Euromicro RTS 2000. 12th Euromicro Conference on (2000), pp. 35–43
5. B. Andersson, E. Tovar, Multiprocessor scheduling with few preemptions, in Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on (IEEE, 2006), pp. 322–334