Campus Event Calendar
Event Entry
New for: D1, D2
What and Who
Efficient Scheduling of Strict Multithreaded Computations
Panagiota Fatourou
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Saturday, 22 January 2000
13:30
45 Minutes
46
024
Saarbrücken
Abstract
The presentation concentrates on the problem of efficiently
scheduling a wide class of multithreaded computations, called
strict. A distributed, randomized, work-stealing scheduling
algorithm which applies to any strict multithreaded computation
and is provably good in terms of space complexity, execution
time and communication cost, will be presented.
Contact
Panagiota Fatourou
117
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
multithreaded computations, scheduling algorithms, randomized work stealing, strict execution