Sciweavers

10 search results - page 1 / 2
» Domination analysis for minimum multiprocessor scheduling
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 5 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
RTSS
2009
IEEE
13 years 12 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
ECRTS
2005
IEEE
13 years 10 months ago
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor...
Marko Bertogna, Michele Cirinei, Giuseppe Lipari
ICPPW
2009
IEEE
13 years 12 months ago
Evaluation of Existing Schedulability Tests for Global EDF
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...
Marko Bertogna
EMSOFT
2007
Springer
13 years 11 months ago
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own ...
Orlando Moreira, Frederico Valente, Marco Bekooij