| Document Date: 2013-10-10 18:26:14
Open Document File Size: 399,32 KBShare Result on Facebook
City Saarbr¨ucken / New York / Berlin / Rome / / Company Distributed Computing Systems / CRC Press / Real-Time Systems / / Country Germany / Italy / / / Event Layoffs / / Facility Sapienza University of Rome / Massachusetts Institute of Technology / / IndustryTerm binary search type procedure / fixed priority algorithms / polynomial time algorithms / realtime systems / approximate algorithms / constrained-deadline task systems / fixed-priority scheduling algorithm / harmonic task systems / dual approximation algorithms / task systems / binary search procedure / search procedure / polynomial-time algorithm / fixed priority preemptive algorithms / suitable scheduling algorithm / static-priority systems / multicore systems / implicit-deadline uniprocessor task systems / dynamic scheduling algorithms / monotonic scheduling algorithm / constraineddeadline task systems / fixed priority systems / predictable scheduling algorithms / binary search / polynomial time algorithm / individual processor / realistic systems / constrained-deadline1 task systems / implicit-deadline task systems / nonidentical processors / synchronous periodic task systems / / Organization University of Rome / Max-Planck-Institut f¨ / Laboratory for Computer Science / Massachusetts Institute of Technology / Congress / / Person Nicole Megow / Antonio Ruberti / Alberto Marchetti-Spaccamela / Andreas Wiese / / Position editor / system designer / / Product Lemma 5 / Algorithm 3 / / ProvinceOrState New York / Massachusetts / / PublishedMedium The Computer Journal / / Technology fixed priority algorithms / predictable scheduling algorithms / polynomial time algorithm / Information Technology / fixed priority preemptive algorithms / ESA / individual processor / fixed-priority scheduling algorithm / dynamic scheduling algorithms / Scheduling algorithms / then present Algorithm / one processor / polynomial-time algorithm / 8 Algorithm / monotonic scheduling algorithm / EDF algorithm / polynomial time algorithms / dual approximation algorithms / suitable scheduling algorithm / /
SocialTag |
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks Vincenzo Bonifaci∗ , Alberto Marchetti-Spaccamela† , Nicole Megow‡ , Andreas Wiese§ ∗ Istituto di Analisi dei Sistemi ed Informatica “An