Campus Event Calendar: Vincenzo Bonifaci (09/03/2010 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Blindfold games, Koenig's infinity lemma and real-time scheduling

Vincenzo Bonifaci

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Friday, 3 September 2010

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

In this talk I will describe an exact algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors. This solves an open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of Scheduling, 2009]. The algorithm relies on a characterization of feasibility as the outcome of a two-player game of infinite duration and imperfect information, played on a finite graph.

Contact

Vincenzo Bonifaci

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Vincenzo Bonifaci, 08/29/2010 18:59 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis