1243 search results - page 129 / 249 » FPZL Schedulability Analysis |
118
Voted
ECRTS
2006
IEEE
15 years 6 months ago
2006
IEEE
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
132
click to vote
RTCSA
2003
IEEE
15 years 6 months ago
2003
IEEE
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
140
click to vote
ATAL
2008
Springer
15 years 2 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...
CORR
2008
Springer
15 years 24 days 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...
104
click to vote
ECRTS
2004
IEEE
15 years 4 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 ...