3934 search results - page 320 / 787 » Approximate Schedulability Analysis |
215
Voted
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughpu...
238
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
176
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
178
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
—SystemC is a system-level modeling language that offers a wide range of features to describe concurrent systems rent levels of abstraction. The SystemC standard permits simulato...