Sold Out
Book Categories |
List of Figures | ||
List of Tables | ||
Preface | ||
1 | Introduction | 1 |
2 | Terminology and Assumptions | 13 |
3 | Fundamentals of EDF Scheduling | 27 |
4 | Response Times under EDF Scheduling | 67 |
5 | Planning-Based Scheduling | 87 |
6 | EDF Scheduling for Shared Resources | 121 |
7 | Precedence Constraints and Shared Resources | ä |
8 | Aperiodic Task Scheduling | ä |
9 | Distributed Scheduling - Part I | ä |
10 | Distributed Scheduling - Part II | ä |
11 | Summary and Open Questions | 263 |
References | 267 | |
Index | 269 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionDeadline Scheduling For Real-Time Systems
X
This Item is in Your InventoryDeadline Scheduling For Real-Time Systems
X
You must be logged in to review the productsX
X
X
Add Deadline Scheduling For Real-Time Systems, Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. H, Deadline Scheduling For Real-Time Systems to the inventory that you are selling on WonderClubX
X
Add Deadline Scheduling For Real-Time Systems, Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. H, Deadline Scheduling For Real-Time Systems to your collection on WonderClub |