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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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
Identifiers
URN: urn:nbn:se:uu:diva-40390ISBN: 1-58113-39-5 (print)OAI: 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

http://www.docs.uu.se/~jakob/publications/stappert-cases2001.pdf
By organisation
Department of Information Technology
Computer EngineeringComputer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 311 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf