uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Longest Executable Path Search for Programs with Complex Flows and Pipeline Effects.
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. DEPARTMENT OF COMPUTER SYSTEMS.
2001 (English)In: Proceedings of the 4th International Conference on Compilers, Architectures, and Synthesis for Embedded Systems (CASES 2001), ACM Press , 2001Conference paper (Refereed)
Abstract [en]

Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is the Worst-Case Execution Time (WCET) of a program. This paper present

Place, publisher, year, edition, pages
ACM Press , 2001.
National Category
Computer Engineering Computer Science
URN: urn:nbn:se:uu:diva-40390ISBN: 1-58113-39-5OAI: oai:DiVA.org:uu-40390DiVA: diva2:68291
Available from: 2008-10-17 Created: 2008-10-17

Open Access in DiVA

No full text

Other links

By organisation
Department of Information Technology
Computer EngineeringComputer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 113 hits
ReferencesLink to record
Permanent link

Direct link