Code aware resource management

Proceedings of the 5th ACM International Conference on Embedded Software, EMSOFT 2005

Volumn , Issue , 2005, Pages 191-202

  De Alfaro, Luca ^a   Raman, Vsihwanath ^a   Faella, Marco ^a,b   Majumdar, Rupak ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Code analysis; Deadlock Avoidance; Scheduling

Indexed keywords

ALGORITHMS; CODES (STANDARDS); COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; MULTIPROCESSING PROGRAMS;

MULTITHREADED PROGRAMS; MUTEXES; RESOURCE MANAGEMENT; SEMAPHORES;

MULTITASKING;

EID: 29244466838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1086228.1086265     Document Type: Conference Paper

References (24)

1. Z.A. Banaszak and B.H. Krogh. Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Transactions on Robotics and Automation, 6(6):724-734, 1990.
2. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
3. G.C. Buttazzo. Hard Real-Time. Computing Systems. Kluwer, 1997.
4. K. Chatterjee, L. de Alfaro, and T.A. Henzinger. Trading memory for randomness. In QEST 04: Proceedings of the First International Conference on Quantitative Evaluation of Systems, pages 206-217. IEEE Computer Society Press, 2004.
5. K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of stochastic rabin and streett games. In ICALP 05: Automata, Languages, and Programming, Lect. Notes in Comp. Sci. Springer-Verlag, 2005.
6. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
7. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symposium on the Foundations of Computer Science, pages 564-575. IEEE Computer Society Press, 1998.
8. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
9. R. Devillers. Game interpretation of the deadlock avoidance problem. Communications of the ACM, 20(10):741-745, 1977.
10. ecos homepage. http://ecos.sourceware.org/.
11. D.R. Engler and K. Ashcraft. RacerX: effective, static detection of race conditions and deadlocks. In SOSP 03: Symposium on Operating Systems Principles, pages 237-252. ACM, 2003.
12. J. Ezpeleta, J.-M. Colom, and J. Martnez. A petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics, and Automation., N, 2, 11:173-184, 1995.
13. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer-Verlag, 1997.
14. F. S. Hsieh ahd S. C. Chang. Deadlock avoidance controller synthesis for flexible manufacturing systems. Proc. of 3rd Int. Conf. on Comp. Integrated Manufacturing, pages 252-261, 1992.
15. M.V. Iordache, J. Moody, and P.J. Antsaklis. Synthesis of deadlock prevention supervisors using petri nets. IEEE Transactions on Robotics and Automation, 18:59-68, 2002.
16. C. Kloukinas, C. Nakhli, and S. Yovine. A methodology and tool support for generating scheduled native code for real-time java applications. In EMSOFT 03: 3rd Intl. Workshop on Embedded Software, volume 2855 of Lect. Notes in Comp. Sci., pages 274-289. Springer-Verlag, 2003.
17. C. Kloukinas and S. Yovine. Synthesis of safe, qos extendible, application specific schedulers for heterogeneous real-time systems. In ECRTS 03: Euromicro Conference on Real-Time Systems, pages 287-294. IEEE Computer Society Press, 2003.
18. Toshimi Minoura. Deadlock avoidance revisited. Journal of the ACM, 29(4):1023-1048, 1982.
19. G.C. Necula, S. McPeak, S.P. Rahul, and W. Weimer. Intermediate language and tools for analysis and transformation of C programs. In Proc. Conference on Compiler Construction (CC), 2002.
20. J.L. Peterson and A. Silberschatz. Operating System Concepts. Addison-Wesley, 1985.
21. S. Savage, M. Burrows, C.G. Nelson, P. Sobalvarro, and T.A. An derson. Eraser: A dynamic data race detector for multithreaded programs. ACM Transactions on Computer Systems, 15(4):391-411, 1997.
22. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 135-191. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
23. W. Thomas. On the synthesis of strategies in infinite games. In Proc. of 12th Annual Symposium on Theoretical Aspects of Computer Science, Lect. Notes in Comp. Sci., pages 1-13. Springer-Verlag, 1995.
24. J.R. von Behren, J. Condit, F. Zhou, G.C. Necula, and E.A. Brewer. Capriccio: scalable threads for internet services. In SOSP 03: Symposium, on Operating Systems Principles, pages 268-281. ACM, 2003.