Campus Event Calendar
Event Entry
What and Who
New performance bounds for scheduling unrelated processors
Nodari Vakhania
Universidad Autonomal del Estado De Morelos
AG1 Seminar
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 30 June 99
13:30
45 Minutes
MPI
024
Saarbrücken
Abstract
In this talk we propose an improved performance ratio and absolut
error for scheduling independent tasks on unrelated processors.
In particular, we use linear programming approach and show that each feasible
solution of the linear program contains at most m preemptions, wherem is the number of unrelated machines.
Contact
Steven Seiden
--email hidden
passcode not visible
logged in users only