Name
Abstract | ||
|---|---|---|
Real-time systems seek to guarantee predictable run-time be-ha viour to ensure that tasks will meet their deadlines. Optimal scheduling decisions, however, easily impose unacceptable run-time costs for many but the most basic scheduling problems, specifically in the context of multiprocessors and distributed systems. Deriving suitable heuristics then usually requires extensive simulations to gain confidence in the chosen approach. In this paper we therefore present Fortissimo, an open framework that facilitates the development of taylor-made real-time scheduling simulators for multiprocessor systems. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-45591-4_105 | IPDPS Workshops |
Keywords | Field | DocType |
real-time scheduling simulation,predictable run-time be-ha viour,optimal scheduling decision,multiprocessor system,taylor-made real-time scheduling simulator,open framework,extensive simulation,basic scheduling problem,unacceptable run-time cost,chosen approach,real-time system,real time systems,distributed system,scheduling problem | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing | Conference |
Volume | ISSN | ISBN |
1800 | 0302-9743 | 3-540-67442-X |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thorsten Kramp | 1 | 137 | 13.18 |
| Matthias Adrian | 2 | 0 | 0.34 |
| Rainer Koster | 3 | 0 | 0.68 |