Memory-processor co-scheduling in fixed priority systems

ACM International Conference Proceeding Series

Volumn 04-06-November-2015, Issue , 2015, Pages 87-96

  Melani, Alessandra ^a   Bertogna, Marko ^b   Bonifaci, Vincenzo ^c   Marchetti Spaccamela, Alberto ^d   Buttazzo, Giorgio ^a  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^c CNR   (Italy)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTER ARCHITECTURE; INTEGRATED CIRCUIT DESIGN; INTERACTIVE COMPUTER SYSTEMS; SCHEDULING ALGORITHMS;

COMMUNICATION RESOURCES; MEMORY COMPUTATIONS; MULTI-CORE PLATFORMS; POLYNOMIAL COMPLEXITY; RESPONSE-TIME ANALYSIS; SCHEDULABILITY ANALYSIS; SPORADIC REAL-TIME TASKS; THEORETICAL FRAMEWORK;

REAL TIME SYSTEMS;

EID: 84959502239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2834848.2834854     Document Type: Conference Paper

References (43)

1. Texas Instruments. The 66AK2H12 Keystone II Processor. http://www.ti.com/product/66AK2H12.
2. A MATLAB® implementation of schedulability tests for memory-processor co-scheduling in fixed priority systems. http://retis.sssup.it/~al.melani/downloads/MC.zip, 2015.
3. A. Alhammad and R. Pellizzoni. Schedulability analysis of global memory-predictable scheduling. In International Conference on Embedded Software (EMSOFT 2014), New Delhi, India, October 12-17, 2014.
4. A. Alhammad, S. Wasly, and R. Pellizzoni. Memory efficient global scheduling of real-time tasks. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2015), Seattle, WA, USA, April 13-16, 2015.
5. S. Altmeyer, R. Douma, W. Lunniss, and R. Davis. Evaluation of cache partitioning for hard real-time systems. In 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), Madrid, Spain, July 8-11, 2014.
6. N. Audsley. On priority assignment in fixed priority scheduling. Information Processing Letters, 79(1):39-44, 2001.
7. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284-292, September 1993.
8. S. Bak, G. Yao, R. Pellizzoni, and M. Caccamo. Memory-aware scheduling of multicore task sets for real-time systems. In 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2012), Seoul, Korea, August 19-22, 2012.
9. A. Bastoni, B. Brandenburg, and J. Anderson. Cache-related preemption and migration delays: empirical approximation and impact on schedulability. In 6th International Workshop on Operating Systems for Embedded Real-Time Applications (OSPERT 2010), Brussels, Belgium, July 6, 2010.
10. E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129-154, 2005.
11. A. Burns and S. K. Baruah. Sustainability in real-time scheduling. Journal of Computing Science and Engineering, 2(1):74-97, 2008.
12. G. Buttazzo, M. Bertogna, and G. Yao. Limited preemptive scheduling for real-time systems: a survey. IEEE Transactions on Industrial Informatics, 9(1):3-15, 2013.
13. B. Chen. Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. journal of the Operational Research Society, 46(2):234-244, 1995.
14. R. I. Davis and A. Burns. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Springer Real-Time Systems Journal, 47(1):1-40, 2010.
15. M. Dertouzos. Control robotics: the procedural control of physical processes. Information Processing, 74, 1974.
16. J. Deverge and I. Puaut. Wcet-directed dynamic scratchpad memory allocation of data. In 19th Euromicro Conference on Real-Time Systems (ECRTS 2007), Pisa, Italy, July 4-6, 2007.
17. A. Hamann, M. Jersak, K. Richter, and R. Ernst. A framework for modular analysis and exploration of heterogeneous embedded systems. Springer Real-Time Systems Journal, 33(1-3):101-137, July 2006.
18. J. Hoogeveen, J. Lenstra, and B. Veltman. Preemptive scheduling in a two-stage multiprocessor shop is NP-hard. European J. Oper. Res., 89:172-175, 1996.
19. P. Jayachandran and T. Abdelzaher. Reduction-based schedulability analysis of distributed systems with cycles in the task graph. Springer Real-Time Systems Journal, 46(1):121-151, September 2010.
20. P. Jayachandran and T. Abdelzaher. A delay composition theorem for real-time pipelines. In 19th Euromicro Conference on Real-Time Systems (ECRTS 2007), Pisa, Italy, July 4-6, 2007.
21. S. Johnson. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q., 1:61-68, 1954.
22. M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, 1986.
23. J. Krakora, L. Waszniowski, P. Pisa, and Z. Hanzalek. Timed automata model for component-based real-time systems. In 5th IEEE International Workshop on Factory Communication Systems (WFCS 2004), Vienna, Austria, September 22-24, 2004.
24. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1):46-61, January 1973.
25. J. Lu, H. Chen, R. Fu, W.-C. Hsu, B. Othmer, P. Yew, and D. Chen. The performance of runtime data cache prefetching in a dynamic optimization system. In 36th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2003), San Diego, CA, USA, December 3-5, 2003.
26. R. Mancuso, R. Dudko, and M. Caccamo. Light-prem: Automated software refactoring for predictable execution on cots embedded system. In 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2014), Chongqing, China, August 20-22, 2014.
27. A. Marongiu and L. Benini. An openmp compiler for efficient use of distributed scratchpad memory in mpsocs. IEEE Transactions on Computers, 61(2):222-236, February 2012.
28. M. D. Natale and J. A. Stankovic. Dynamic end-to-end guarantees in distributed real time systems. In 15th IEEE Real-Time Systems Symposium (RTSS 1994), San Juan, Puerto Rico, December 7-9, 1994.
29. J. C. Palencia and M. G. Harbour. Exploiting precedence relations in the schedulability analysis of distributed real-time systems. In 20th IEEE Real-Time Systems Symposium (RTSS 1999), Phoenix, AZ, USA, December 1-3, 1999.
30. J. C. Palencia and M. G. Harbour. Schedulability analysis for tasks with static and dynamic offsets. In 19th IEEE Real-Time Systems Symposium (RTSS 1), Madrid, Spain, December 2-4, 1998.
31. J. C. Palencia and M. G. Harbour. Offset-based response time analysis of distributed systems scheduled under EDF. In 15th Euromicro Conference on Real-Time Systems (ECRTS 2003), Porto, Portugal, July 2-4, 2003.
32. R. Pellizzoni, E. Betti, S. Bak, J. Criswell, M. Caccamo, and R. Kegley. A predictable execution model for COTS-based embedded systems. In 17th IEEE Real-Time and Embedded Applications Symposium (RTAS 2011), Chicago, IL, USA, April 11-14, 2011.
33. R. Pellizzoni and G. Lipari. Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling. Journal of Computer and System Sciences, 73(2):186-206, March 2007.
34. I. Puaut and C. Pais. Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison. In Design, Automation and Test in Europe Conference and Exhibition (DATE 2007), Nice, France, April 16-20, 2007.
35. P. Schuurman and G. J. Woeginger. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci., 237(1-2):105-122, 2000.
36. M. Spuri. Holistic analysis for deadline scheduled real-time distributed systems. Technical report rr-2873, INRIA, France, April 1996.
37. L. Thiele, S. Chakraborty, and M. Naedele. Real-time calculus for scheduling hard real-time systems. In IEEE International Symposium on Circuits and Systems (ISCAS 2000), Geneva, Switzerland, May 28-31, 2000.
38. K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming, 40(2):117-134, April 1994.
39. B. C. Ward, J. L. Herman, C. J. Kenna, and J. H. Anderson. Making shared caches more predictable on multicore platforms. In 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), Paris, France, July 9-12, 2013.
40. S. Wasly and R. Pellizzoni. Hiding memory latency using fixed priority scheduling. In 20th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2014), Berlin, Germany, April 15-17, 2014.
41. S. Wasly and R. Pellizzoni. A dynamic scratchpad memory unit for predictable real-time embedded systems. In 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), Paris, France, July 9-12, 2013.
42. J. Whitham and N. C. Audsley. Explicit reservation of local memory in a predictable, preemptive multitasking real-time system. In 18th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2012), Bejing, China, April 17-19, 2012.
43. G. Yao, R. Pellizzoni, S. Bak, E. Betti, and M. Caccamo. Memory-centric scheduling for multicore hard real-time systems. Real-Time Systems Journal, 48(6):681-715, November 2012.