BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20100314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20101107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20110313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20111106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20120311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20121104T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20110210T150000
DTEND;TZID=America/Los_Angeles:20110210T160000
DTSTAMP:20231011T182452Z
CREATED:20231011T182452Z
LAST-MODIFIED:20231011T182452Z
UID:14266-1297350000-1297353600@www.cecs.uci.edu
SUMMARY:Worst Case Execution Time Estimation
DESCRIPTION:Worst Case Execution Time Estimation\n\n\n\n\nSpeaker\n\n\nDr. Y.N. Srikant\,\nDepartment of Computer Science and Automation\nIndian Institute of Science\nBangalore\, India\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nNikil Dutt\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nDonald Bren Hall (DBH) 4011\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nFebruary 10\, 2011\nRefreshments at 1:30 pm\, Lecture begins at 2:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nEstimation of worst case execution time of programs is extremely important in the context of real time systems where the correctness of the system depends not only on the computations performed\, but also on the timing of such computations. For task scheduling on such systems\, it is necessary to know whether the task can execute to completion within a predetermined time interval. Thus\, given a program and a target architecture\, the WCET problem is to estimate a bound on the maximum execution time taken by the program for any input data set.  \nWCET estimation is usually required to be safe and tight. Static analysis based techniques for WCET estimation use micro-architectural models for the target architecture and abstract interpretation for program analysis. Their results are safe but are not very tight. Measurement based techniques estimate the execution time for basic blocks by actual execution\, and then combine the results using integer linear programming. These results are tighter but not safe. \nIn this talk\, an overview of a probabilistic scheme for WCET estimation\, which is a hybrid of static and measurement based methods is presented. Preliminary results on a novel measurement based technique using program phases will also be presented.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n\n \nY.N. Srikant received his B.E in Electronics from Bangalore University\, and M.E and Ph.D in Computer Science from the Computer Science and Automation department of the Indian Institute of Science. He was the recipient of Young Scientist medal of the Indian National Science Academy in 1988. Srikant is currently a Professor in the Department of Computer Science and Automation at the Indian Institute of Science in Bangalore. He was the chair of the CSA department from 2000-05. \nHis area of interest is compiler design. He is the editor of a handbook on advanced compiler design published by CRC Press in 2002 and 2008 (2nd ed.). His most recent research includes compiler and runtime optimizations for reducing energy consumption in embedded systems and performance estimation of programs through program analysis.
URL:https://www.cecs.uci.edu/event/worst-case-execution-time-estimation/
LOCATION:CA
CATEGORIES:Seminars at CECS
END:VEVENT
END:VCALENDAR