Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Analysis of algorithms / Time complexity / NP / P versus NP problem / Algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics


Algorithms and Complexity for Periodic Real-Time Scheduling VINCENZO BONIFACI, Max Planck Institute for Informatics HO-LEUNG CHAN, University of Hong Kong ALBERTO MARCHETTI-SPACCAMELA, Sapienza University of Rome NICOLE
Add to Reading List

Document Date: 2013-01-02 06:56:04

Open Document

File Size: 275,39 KB

Share Result on Facebook

City

Rome / Saarbrucken / New York / /

Company

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 / /

Person

MAX SIMULTANEOUS CONGRUENCES / Gandhi / /

/

Position

General / corresponding author / /

ProvinceOrState

New York / /

Technology

pseudopolynomial-time algorithm / speed-1 processors / approximation algorithm / constant-approximate polynomial-time algorithm / polynomial-time algorithm / constant approximation algorithms / nondeterministic polynomial space algorithm / Approximation algorithms / unit speed processors / Operating Systems / pseudopolynomial time algorithm / speed-σ processors / constant-approximation algorithm / /

URL

http /

SocialTag