Synchronous Task Systems / Merrill / ACM Inc. / Arbitrary Periodic Task Systems / /
Country
Germany / Italy / United States / /
Currency
USD / / /
Event
Force Majeure / /
Facility
Penn Plaza / University of Hong Kong ALBERTO MARCHETTI-SPACCAMELA / University of Hong Kong / Sapienza University of Rome / Sapienza University of Rome NICOLE MEGOW / Campus E1.4 / Max Planck Institute / / /
IndustryTerm
constant-approximation algorithm / speed-σ processors / multiprocessor task systems / real-time scheduling / unit speed processors / constant-approximate polynomial-time algorithm / approximation algorithm / feasible solution / periodic task systems / task systems / approximate solution / constant approximation algorithms / pseudopolynomial time algorithm / polynomial-time algorithm / congruence systems / feasible schedule on m processors / simultaneous solution / to multiprocessor systems / nondeterministic polynomial space algorithm / exhaustive search / periodic real-time scheduling / approximate solutions / pseudopolynomial-time algorithm / integral solution / sporadic task systems / bipartite network / /
Organization
University of Rome / Max Planck Institute for Informatics We / Max Planck Institute for Informatics / University of Hong Kong / European Union / Max Planck Institute for Informatics HO-LEUNG CHAN / /