Atnaujinkite slapukų nuostatas

El. knyga: Real-time Systems Scheduling Volume 2: Focuses, Volume 2 [Wiley Online]

Edited by
  • Formatas: 282 pages
  • Serija: ISTE
  • Išleidimo metai: 04-Nov-2014
  • Leidėjas: ISTE Ltd and John Wiley & Sons Inc
  • ISBN-10: 1119042976
  • ISBN-13: 9781119042976
Kitos knygos pagal šią temą:
  • Wiley Online
  • Kaina: 174,45 €*
  • * this price gives unlimited concurrent access for unlimited time
Real-time Systems Scheduling Volume 2: Focuses, Volume 2Didesnis paveikslėlis
  • Formatas: 282 pages
  • Serija: ISTE
  • Išleidimo metai: 04-Nov-2014
  • Leidėjas: ISTE Ltd and John Wiley & Sons Inc
  • ISBN-10: 1119042976
  • ISBN-13: 9781119042976
Kitos knygos pagal šią temą:
Wiley Online E-booksMore info about Wiley Online
Partnerių interneto svetainė: https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042976
Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc. Scheduling is a central problem for these computing/communication systems since it is responsible for software execution in a timely manner. This book, the second of two volumes on the subject, brings together knowledge on specific topics and discusses the recent advances for some of them.

It addresses foundations as well as the latest advances and findings in real-time scheduling, giving comprehensive references to important papers, but the chapters are short and not overloaded with confusing details. Coverage includes scheduling approaches for networks and for energy autonomous systems. Other sophisticated issues, such as feedback control scheduling and probabilistic scheduling, are also addressed.

This book can serve as a textbook for courses on the topic in bachelor's degrees and in more advanced master's degree programs. It also provides a reference for computer scientists and engineers involved in the design or the development of Cyber-Physical Systems which require up-to-date real-time scheduling solutions.
Preface xi
List Of Figures xv
List Of Tables xix
Chapter 1 Scheduling In Energy Autonomous Objects 1(28)
Maryline Chetto
1.1 Introduction
2(3)
1.2 Modeling and terminology
5(4)
1.2.1 System model
5(2)
1.2.2 Types of starvation
7(1)
1.2.3 Terminology
8(1)
1.3 Weaknesses of classical schedulers
9(4)
1.3.1 Scheduling by EDF
9(2)
1.3.2 ASAP strategy
11(1)
1.3.3 ALAP strategy
11(2)
1.4 Fundamental properties
13(2)
1.5 Concepts related to energy
15(3)
1.5.1 Processor demand
15(1)
1.5.2 Energy demand
16(2)
1.6 ED-H scheduling
18(6)
1.6.1 Informal description
18(1)
1.6.2 Rules of ED-H
19(2)
1.6.3 Optimality analysis
21(2)
1.6.4 Clairvoyance analysis
23(1)
1.6.5 Schedulability test
23(1)
1.7 Conclusion
24(1)
1.8 Bibliography
25(4)
Chapter 2 Probabilistic Scheduling 29(24)
Liliana Cucu-Grosjean
Adriana Gogonel
Dorin Maxim
2.1 Introduction
30(3)
2.2 Notations and definitions
33(1)
2.3 Modeling a probabilistic real-time system
34(2)
2.4 Imposed properties
36(1)
2.5 Worst-case probabilistic models
37(3)
2.5.1 Real-time systems with probabilistic arrivals
38(1)
2.5.2 Comparison of the two models
38(2)
2.6 Probabilistic real-time scheduling
40(3)
2.7 Probabilistic schedulability analysis
43(2)
2.8 Classification of the main existing results
45(2)
2.9 Bibliography
47(6)
Chapter 3 Control And Scheduling Joint Design 53(44)
Daniel Simon
Ye-Qiong Song
Olivier Sename
3.1 Control objectives and models
54(7)
3.1.1 Closed loop control
55(2)
3.1.2 Control and temporal parameters
57(4)
3.2 Scheduling of control loops
61(7)
3.2.1 Robustness and relaxation of hard real-time constraints
64(4)
3.3 Continuous approach: regulated scheduling
68(7)
3.3.1 Architecture, sensors and actuators
68(2)
3.3.2 Sensors
70(1)
3.3.3 Actuators
71(2)
3.3.4 Control laws
73(2)
3.4 Discrete approach: scheduling under the (m,k)-firm constraint
75(8)
3.4.1 (m,k)-firm model
76(2)
3.4.2 Scheduling under the (m,k)-firm constraint
78(2)
3.4.3 Regulated (m,k)-firm scheduling
80(3)
3.5 Case study: regulated scheduling of a video decoder
83(7)
3.6 Conclusion
90(1)
3.7 Bibliography
91(6)
Chapter 4 Synchronous Approach And Scheduling 97(54)
Yves Sorel
Dumitru Potop-Butucaru
4.1 Introduction
97(6)
4.2 Classification
103(7)
4.2.1 Synchronous languages
103(6)
4.2.2 Related languages
109(1)
4.3 Synchronous languages
110(17)
4.3.1 SIGNAL
110(11)
4.3.2 LUSTRE
121(4)
4.3.3 ESTEREL
125(2)
4.4 Scheduling with synchronous languages
127(5)
4.5 Synchronous languages extended to perform scheduling
132(13)
4.5.1 LUSTRE
132(1)
4.5.2 PRELUDE
133(3)
4.5.3 SYNDEX
136(6)
4.5.4 TAXYS
142(1)
4.5.5 PSIC, Embedded Code and Network Code
143(2)
4.6 Conclusion
145(1)
4.7 Bibliography
145(6)
Chapter 5 Inductive Approaches For Packet Scheduling In Communication Networks 151(44)
Malika Bourenane
Abdelhamid Mellouk
5.1 Introduction
151(5)
5.2 Scheduling problem
156(2)
5.3 Approaches for real-time scheduling
158(7)
5.3.1 The strict priority
158(1)
5.3.2 The Generalized processor sharing paradigm
159(1)
5.3.3 The packet-by-packet generalized processor sharing (PGPS) scheduler
160(1)
5.3.4 Earliest deadline first
160(1)
5.3.5 Adaptive scheduling
161(4)
5.4 Basic concepts
165(10)
5.4.1 Monoagent learning
165(6)
5.4.2 Multi-agent reinforcement learning
171(4)
5.5 Proposed model
175(4)
5.6 Q-learning with approximation
179(9)
5.7 Conclusion
188(1)
5.8 Acknowledgment
189(1)
5.9 Bibliography
189(6)
Chapter 6 Scheduling In Networks 195(22)
Ye-Qiong Song
6.1 Introduction
195(4)
6.2 The CAN protocol
199(5)
6.3 Example of an automotive embedded application distributed around a CAN network
204(2)
6.4 Response time analysis of CAN messages
206(7)
6.4.1 Worst-case response time analysis method
207(3)
6.4.2 Method of computing the response time bounds
210(2)
6.4.3 Application to CAN messaging
212(1)
6.5 Conclusion and discussion
213(2)
6.6 Bibliography
215(2)
Chapter 7 Focus On Avionics Networks 217(30)
Jean-Luc Scharbarg
Christian Fraboul
7.1 Introduction
217(2)
7.2 Avionics network architectures
219(3)
7.2.1 Historical evolution
219(2)
7.2.2 The AFDX network
221(1)
7.3 Temporal analysis of an AFDX network
222(1)
7.4 Properties of a worst-case scenario
223(7)
7.5 Calculating an upper bound of the delay
230(9)
7.5.1 An upper bound on the delay by network calculus
230(5)
7.5.2 An upper bound on the delay by the trajectory method
235(4)
7.6 Results on an embedded avionic configuration
239(3)
7.7 Conclusion
242(2)
7.8 Bibliography
244(3)
List Of Authors 247(2)
Index 249(2)
Summary Of Volume 1 251
Maryline CHETTO is Full Professor at the University of Nantes, France and teaches at the Institut Universitaire de Technologie de Nantes. She is also a researcher in IRCCyN (Institut de Recherche en Communications et Cybernétique de Nantes) where she works on real-time scheduling, energy harvesting, and dynamic power management.
Pastovi nuoroda: https://www.kriso.lt/db/9781119042976_pe.html
Raktažodžiai: