BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2010/newsitem/3432/1-J
 uly-2010-C-O-Seminar-Vincenzo-Bonifaci-MPI-Informa
 tics-Saarbrücken-Germany-
DTSTAMP:20100617T000000
SUMMARY:C&O Seminar, Vincenzo Bonifaci (MPI Inform
 atics, Saarbrücken, Germany)
ATTENDEE;ROLE=Speaker:Vincenzo Bonifaci (MPI Infor
 matics, Saarbrücken, Germany)
DTSTART;TZID=Europe/Amsterdam:20100701T150000
DTEND;TZID=Europe/Amsterdam:20100701T160000
LOCATION:room L017, CWI, Science Park 123, Amsterd
 am
DESCRIPTION:We survey some recent results concerni
 ng the design and analysis of algorithms that ensu
 re the schedulability of real-time tasks. We consi
 der the problem of analyzing and certifying the fe
 asibility of a system of periodically or sporadica
 lly recurring real-time tasks with hard deadlines,
  that have to be scheduled on a platform composed 
 of one or more identical processors. We provide lo
 wer and upper bounds on the complexity of exact fe
 asibility testing, as well as approximate feasibil
 ity tests for both the periodic and the sporadic v
 ariant.  For more information, see k.r.apt at uva.
 nl
X-ALT-DESC;FMTTYPE=text/html:\n        <p>We surve
 y some recent results concerning the design and an
 alysis of\n        algorithms that ensure the sche
 dulability of real-time tasks. We\n        conside
 r the problem of analyzing and certifying the feas
 ibility of a\n        system of periodically or sp
 oradically recurring real-time tasks with\n       
  hard deadlines, that have to be scheduled on a pl
 atform composed of\n        one or more identical 
 processors. We provide lower and upper bounds on\n
         the complexity of exact feasibility testin
 g, as well as approximate\n        feasibility tes
 ts for both the periodic and the sporadic variant.
 </p>\n\n    \n        <p>For more information, see
  <a class="email">k.r.apt <span class="at">at</spa
 n> uva.nl</a></p>\n    
URL:/NewsandEvents/Archives/2010/newsitem/3432/1-J
 uly-2010-C-O-Seminar-Vincenzo-Bonifaci-MPI-Informa
 tics-Saarbrücken-Germany-
END:VEVENT
END:VCALENDAR