Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Real-time systems scheduling 1 : fundamentals / / edited by Maryline Chetto
| Real-time systems scheduling 1 : fundamentals / / edited by Maryline Chetto |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
| Descrizione fisica | 1 online resource (310 p.) |
| Disciplina | 001.64404 |
| Collana | Networks and Telecommunications Series |
| Soggetto topico |
Real-time control
Computer scheduling Real-time data processing |
| ISBN |
1-118-98438-2
1-118-98441-2 1-118-98440-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover page; Half-Title page; Title page; Copyright page; Contents; Preface; List of Figures; List of Tables; 1: Introduction to Real-time Scheduling; 1.1. Real-time systems; 1.2. Material architectures; 1.2.1. CPUs; 1.2.2. Communication networks; 1.2.3. Sensors and actuators; 1.3. Operating systems; 1.3.1. Generalities; 1.3.2. Real-time operating systems; 1.3.3. Primitives provided by the kernel; 1.4. Scheduling; 1.4.1. Online and offline scheduling; 1.4.2. Task characterization; 1.4.3. Criticality; 1.4.4. Metrics related to scheduling; 1.4.5. Practical factors
1.4.5.1. Preemptibility and mutual exclusion1.4.5.2. Precedence constraints; 1.4.5.3. Activation jitter; 1.4.5.4. Suspensions; 1.4.6. Multi-core scheduling; 1.5. Real-time application modeling and analysis; 1.5.1. Modeling; 1.5.2. Analysis; 1.6. System architecture and schedulability; 2: Uniprocessor Architecture Solutions; 2.1. Introduction; 2.2. Characterization of a scheduling problem; 2.2.1. Task model; 2.2.2. Temporal constraint models; 2.2.3. Scheduling model; 2.2.4. Concepts and notations; 2.3. Scheduling algorithms/optimality; 2.3.1. FP fixed-job priority algorithms 2.3.2. JFP algorithms2.3.2.1. EDF Scheduling: [LIU 73]; 2.3.2.2. FIFO scheduling:; 2.3.3. Dynamic priority algorithms; 2.4. Busy periods and worst-case scenarios; 2.4.1. Busy periods; 2.4.2. Worst-case scenarios; 2.5. Feasibility conditions; 2.5.1. FP feasibility conditions; 2.5.2. JFP feasibility conditions; 2.5.2.1. Feasibility conditions for EDF; 2.5.2.2. FIFO feasibility conditions; 2.6. Sensitivity analysis; 2.6.1. Sensitivity of WCETs; 2.6.1.1. Sensitivity of WCETs with FP; 2.6.1.1.1. Determination of the C-space with FP scheduling; 2.6.1.1.2. Margin on the WCETs with FP scheduling 2.6.1.2. Sensitivity of WCETs with EDF2.6.1.2.1. Determination of the C-space with EDF scheduling; 2.6.1.2.2. Margin on the WCETs with EDF scheduling; 2.6.2. Sensitivity of periods; 2.6.3. Sensitivity of deadlines; 2.6.3.1. Determination of the D-space with EDF; 2.6.3.2. Deadline modification with EDF; 2.7. Conclusion; 2.8. Bibliography; 3: Multiprocessor Architecture Solutions; 3.1. Introduction; 3.1.1. Application modeling; 3.1.2. Platform modeling; 3.2. Scheduler classification; 3.2.1. Online and offline schedulers; 3.2.2. Task preemption and migration; 3.2.3. Priorities of tasks 3.2.4. Classification3.2.4.1. Definition; 3.3. Properties of schedulers; 3.3.1. Qualitative properties; 3.3.1.1. Comparability of algorithms; 3.3.1.2. Optimality and existence of online algorithms; 3.3.1.3. Predictability, sustainability and scheduling anomalies; 3.3.2. Quantitative properties; 3.3.2.1. Utilization bounds; 3.3.2.2. Resource augmentation ratio; 3.4. Partitioned scheduling; 3.4.1. Partitioning algorithms; 3.4.2. Evaluation of partitioning algorithms; 3.4.2.1. Asymptotic ratio of the number of processor; 3.4.2.2. Utilization bounds; 3.4.2.3. Resource augmentation ratio 3.5. Global scheduling |
| Record Nr. | UNINA-9910132163803321 |
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Real-time systems scheduling 1 : fundamentals / / edited by Maryline Chetto
| Real-time systems scheduling 1 : fundamentals / / edited by Maryline Chetto |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
| Descrizione fisica | 1 online resource (310 p.) |
| Disciplina | 001.64404 |
| Collana | Networks and Telecommunications Series |
| Soggetto topico |
Real-time control
Computer scheduling Real-time data processing |
| ISBN |
1-118-98438-2
1-118-98441-2 1-118-98440-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover page; Half-Title page; Title page; Copyright page; Contents; Preface; List of Figures; List of Tables; 1: Introduction to Real-time Scheduling; 1.1. Real-time systems; 1.2. Material architectures; 1.2.1. CPUs; 1.2.2. Communication networks; 1.2.3. Sensors and actuators; 1.3. Operating systems; 1.3.1. Generalities; 1.3.2. Real-time operating systems; 1.3.3. Primitives provided by the kernel; 1.4. Scheduling; 1.4.1. Online and offline scheduling; 1.4.2. Task characterization; 1.4.3. Criticality; 1.4.4. Metrics related to scheduling; 1.4.5. Practical factors
1.4.5.1. Preemptibility and mutual exclusion1.4.5.2. Precedence constraints; 1.4.5.3. Activation jitter; 1.4.5.4. Suspensions; 1.4.6. Multi-core scheduling; 1.5. Real-time application modeling and analysis; 1.5.1. Modeling; 1.5.2. Analysis; 1.6. System architecture and schedulability; 2: Uniprocessor Architecture Solutions; 2.1. Introduction; 2.2. Characterization of a scheduling problem; 2.2.1. Task model; 2.2.2. Temporal constraint models; 2.2.3. Scheduling model; 2.2.4. Concepts and notations; 2.3. Scheduling algorithms/optimality; 2.3.1. FP fixed-job priority algorithms 2.3.2. JFP algorithms2.3.2.1. EDF Scheduling: [LIU 73]; 2.3.2.2. FIFO scheduling:; 2.3.3. Dynamic priority algorithms; 2.4. Busy periods and worst-case scenarios; 2.4.1. Busy periods; 2.4.2. Worst-case scenarios; 2.5. Feasibility conditions; 2.5.1. FP feasibility conditions; 2.5.2. JFP feasibility conditions; 2.5.2.1. Feasibility conditions for EDF; 2.5.2.2. FIFO feasibility conditions; 2.6. Sensitivity analysis; 2.6.1. Sensitivity of WCETs; 2.6.1.1. Sensitivity of WCETs with FP; 2.6.1.1.1. Determination of the C-space with FP scheduling; 2.6.1.1.2. Margin on the WCETs with FP scheduling 2.6.1.2. Sensitivity of WCETs with EDF2.6.1.2.1. Determination of the C-space with EDF scheduling; 2.6.1.2.2. Margin on the WCETs with EDF scheduling; 2.6.2. Sensitivity of periods; 2.6.3. Sensitivity of deadlines; 2.6.3.1. Determination of the D-space with EDF; 2.6.3.2. Deadline modification with EDF; 2.7. Conclusion; 2.8. Bibliography; 3: Multiprocessor Architecture Solutions; 3.1. Introduction; 3.1.1. Application modeling; 3.1.2. Platform modeling; 3.2. Scheduler classification; 3.2.1. Online and offline schedulers; 3.2.2. Task preemption and migration; 3.2.3. Priorities of tasks 3.2.4. Classification3.2.4.1. Definition; 3.3. Properties of schedulers; 3.3.1. Qualitative properties; 3.3.1.1. Comparability of algorithms; 3.3.1.2. Optimality and existence of online algorithms; 3.3.1.3. Predictability, sustainability and scheduling anomalies; 3.3.2. Quantitative properties; 3.3.2.1. Utilization bounds; 3.3.2.2. Resource augmentation ratio; 3.4. Partitioned scheduling; 3.4.1. Partitioning algorithms; 3.4.2. Evaluation of partitioning algorithms; 3.4.2.1. Asymptotic ratio of the number of processor; 3.4.2.2. Utilization bounds; 3.4.2.3. Resource augmentation ratio 3.5. Global scheduling |
| Record Nr. | UNINA-9910823748803321 |
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto
| Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 |
| Descrizione fisica | 1 online resource (284 p.) |
| Disciplina | 004.33 |
| Collana | Networks and Telecommunication Series |
| Soggetto topico | Real-time data processing |
| ISBN |
1-119-04296-8
1-119-04297-6 1-119-04299-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover page; Half-Title page; Title page; Copyright page; Contents; Preface; List of Figures; List of Tables; 1: Scheduling in Energy Autonomous Objects; 1.1. Introduction; 1.2. Modeling and terminology; 1.2.1. System model; 1.2.1.1. Job model; 1.2.1.2. Energy production model; 1.2.1.3. Energy storage model; 1.2.2. Types of starvation; 1.2.3. Terminology; 1.3. Weaknesses of classical schedulers; 1.3.1. Scheduling by EDF; 1.3.2. ASAP strategy; 1.3.3. ALAP strategy; 1.4. Fundamental properties; 1.5. Concepts related to energy; 1.5.1. Processor demand; 1.5.2. Energy demand; 1.6. ED-H scheduling
1.6.1. Informal description1.6.2. Rules of ED-H; 1.6.3. Optimality analysis; 1.6.4. Clairvoyance analysis; 1.6.5. Schedulability test; 1.7. Conclusion; 1.8. Bibliography; 2: Probabilistic Scheduling; 2.1. Introduction; 2.2. Notations and definitions; 2.3. Modeling a probabilistic real-time system; 2.4. Imposed properties; 2.5. Worst-case probabilistic models; 2.5.1. Real-time systems with probabilistic arrivals; 2.5.2. Comparison of the two models; 2.6. Probabilistic real-time scheduling; 2.7. Probabilistic schedulability analysis; 2.8. Classification of the main existing results 2.9. Bibliography3: Control and Scheduling Joint Design; 3.1. Control objectives and models; 3.1.1. Closed loop control; 3.1.2. Control and temporal parameters; 3.2. Scheduling of control loops; 3.2.1. Robustness and relaxation of hard real-time constraints; 3.3. Continuous approach: regulated scheduling; 3.3.1. Architecture, sensors and actuators; 3.3.2. Sensors; 3.3.3. Actuators; 3.3.4. Control laws; 3.4. Discrete approach: scheduling under the (m,k)-firm constraint; 3.4.1. (m,k)-firm model; 3.4.2. Scheduling under the (m,k)-firm constraint; 3.4.3. Regulated (m,k)-firm scheduling 3.5. Case study: regulated scheduling of a video decoder3.6. Conclusion; 3.7. Bibliography; 4: Synchronous Approach and Scheduling; 4.1. Introduction; 4.2. Classification; 4.2.1. Synchronous languages; 4.2.2. Related languages; 4.3. Synchronous languages; 4.3.1. SIGNAL; 4.3.2. LUSTRE; 4.3.3. ESTEREL; 4.4. Scheduling with synchronous languages; 4.5. Synchronous languages extended to perform scheduling; 4.5.1. LUSTRE; 4.5.2. PRELUDE; 4.5.3. SYNDEX; 4.5.4. TAXYS; 4.5.5. PSIC, Embedded Code and Network Code; 4.6. Conclusion; 4.7. Bibliography 5: Inductive Approaches for Packet Scheduling in Communication Networks5.1. Introduction; 5.2. Scheduling problem; 5.3. Approaches for real-time scheduling; 5.3.1. The strict priority; 5.3.2. The Generalized processor sharing paradigm; 5.3.3. The packet-by-packet generalized processor sharing (PGPS) scheduler; 5.3.4. Earliest deadline first; 5.3.5. Adaptive scheduling; 5.4. Basic concepts; 5.4.1. Monoagent learning; 5.4.2. Multi-agent reinforcement learning; 5.5. Proposed model; 5.6. Q-learning with approximation; 5.7. Conclusion; 5.8. Acknowledgment; 5.9. Bibliography 6: Scheduling in Networks |
| Record Nr. | UNINA-9910132336403321 |
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto
| Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 |
| Descrizione fisica | 1 online resource (284 p.) |
| Disciplina | 004.33 |
| Collana | Networks and Telecommunication Series |
| Soggetto topico | Real-time data processing |
| ISBN |
1-119-04296-8
1-119-04297-6 1-119-04299-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover page; Half-Title page; Title page; Copyright page; Contents; Preface; List of Figures; List of Tables; 1: Scheduling in Energy Autonomous Objects; 1.1. Introduction; 1.2. Modeling and terminology; 1.2.1. System model; 1.2.1.1. Job model; 1.2.1.2. Energy production model; 1.2.1.3. Energy storage model; 1.2.2. Types of starvation; 1.2.3. Terminology; 1.3. Weaknesses of classical schedulers; 1.3.1. Scheduling by EDF; 1.3.2. ASAP strategy; 1.3.3. ALAP strategy; 1.4. Fundamental properties; 1.5. Concepts related to energy; 1.5.1. Processor demand; 1.5.2. Energy demand; 1.6. ED-H scheduling
1.6.1. Informal description1.6.2. Rules of ED-H; 1.6.3. Optimality analysis; 1.6.4. Clairvoyance analysis; 1.6.5. Schedulability test; 1.7. Conclusion; 1.8. Bibliography; 2: Probabilistic Scheduling; 2.1. Introduction; 2.2. Notations and definitions; 2.3. Modeling a probabilistic real-time system; 2.4. Imposed properties; 2.5. Worst-case probabilistic models; 2.5.1. Real-time systems with probabilistic arrivals; 2.5.2. Comparison of the two models; 2.6. Probabilistic real-time scheduling; 2.7. Probabilistic schedulability analysis; 2.8. Classification of the main existing results 2.9. Bibliography3: Control and Scheduling Joint Design; 3.1. Control objectives and models; 3.1.1. Closed loop control; 3.1.2. Control and temporal parameters; 3.2. Scheduling of control loops; 3.2.1. Robustness and relaxation of hard real-time constraints; 3.3. Continuous approach: regulated scheduling; 3.3.1. Architecture, sensors and actuators; 3.3.2. Sensors; 3.3.3. Actuators; 3.3.4. Control laws; 3.4. Discrete approach: scheduling under the (m,k)-firm constraint; 3.4.1. (m,k)-firm model; 3.4.2. Scheduling under the (m,k)-firm constraint; 3.4.3. Regulated (m,k)-firm scheduling 3.5. Case study: regulated scheduling of a video decoder3.6. Conclusion; 3.7. Bibliography; 4: Synchronous Approach and Scheduling; 4.1. Introduction; 4.2. Classification; 4.2.1. Synchronous languages; 4.2.2. Related languages; 4.3. Synchronous languages; 4.3.1. SIGNAL; 4.3.2. LUSTRE; 4.3.3. ESTEREL; 4.4. Scheduling with synchronous languages; 4.5. Synchronous languages extended to perform scheduling; 4.5.1. LUSTRE; 4.5.2. PRELUDE; 4.5.3. SYNDEX; 4.5.4. TAXYS; 4.5.5. PSIC, Embedded Code and Network Code; 4.6. Conclusion; 4.7. Bibliography 5: Inductive Approaches for Packet Scheduling in Communication Networks5.1. Introduction; 5.2. Scheduling problem; 5.3. Approaches for real-time scheduling; 5.3.1. The strict priority; 5.3.2. The Generalized processor sharing paradigm; 5.3.3. The packet-by-packet generalized processor sharing (PGPS) scheduler; 5.3.4. Earliest deadline first; 5.3.5. Adaptive scheduling; 5.4. Basic concepts; 5.4.1. Monoagent learning; 5.4.2. Multi-agent reinforcement learning; 5.5. Proposed model; 5.6. Q-learning with approximation; 5.7. Conclusion; 5.8. Acknowledgment; 5.9. Bibliography 6: Scheduling in Networks |
| Record Nr. | UNISA-996215325503316 |
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto
| Real-time systems scheduling 2 : focuses / / edited by Maryline Chetto |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 |
| Descrizione fisica | 1 online resource (284 p.) |
| Disciplina | 004.33 |
| Collana | Networks and Telecommunication Series |
| Soggetto topico | Real-time data processing |
| ISBN |
1-119-04296-8
1-119-04297-6 1-119-04299-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover page; Half-Title page; Title page; Copyright page; Contents; Preface; List of Figures; List of Tables; 1: Scheduling in Energy Autonomous Objects; 1.1. Introduction; 1.2. Modeling and terminology; 1.2.1. System model; 1.2.1.1. Job model; 1.2.1.2. Energy production model; 1.2.1.3. Energy storage model; 1.2.2. Types of starvation; 1.2.3. Terminology; 1.3. Weaknesses of classical schedulers; 1.3.1. Scheduling by EDF; 1.3.2. ASAP strategy; 1.3.3. ALAP strategy; 1.4. Fundamental properties; 1.5. Concepts related to energy; 1.5.1. Processor demand; 1.5.2. Energy demand; 1.6. ED-H scheduling
1.6.1. Informal description1.6.2. Rules of ED-H; 1.6.3. Optimality analysis; 1.6.4. Clairvoyance analysis; 1.6.5. Schedulability test; 1.7. Conclusion; 1.8. Bibliography; 2: Probabilistic Scheduling; 2.1. Introduction; 2.2. Notations and definitions; 2.3. Modeling a probabilistic real-time system; 2.4. Imposed properties; 2.5. Worst-case probabilistic models; 2.5.1. Real-time systems with probabilistic arrivals; 2.5.2. Comparison of the two models; 2.6. Probabilistic real-time scheduling; 2.7. Probabilistic schedulability analysis; 2.8. Classification of the main existing results 2.9. Bibliography3: Control and Scheduling Joint Design; 3.1. Control objectives and models; 3.1.1. Closed loop control; 3.1.2. Control and temporal parameters; 3.2. Scheduling of control loops; 3.2.1. Robustness and relaxation of hard real-time constraints; 3.3. Continuous approach: regulated scheduling; 3.3.1. Architecture, sensors and actuators; 3.3.2. Sensors; 3.3.3. Actuators; 3.3.4. Control laws; 3.4. Discrete approach: scheduling under the (m,k)-firm constraint; 3.4.1. (m,k)-firm model; 3.4.2. Scheduling under the (m,k)-firm constraint; 3.4.3. Regulated (m,k)-firm scheduling 3.5. Case study: regulated scheduling of a video decoder3.6. Conclusion; 3.7. Bibliography; 4: Synchronous Approach and Scheduling; 4.1. Introduction; 4.2. Classification; 4.2.1. Synchronous languages; 4.2.2. Related languages; 4.3. Synchronous languages; 4.3.1. SIGNAL; 4.3.2. LUSTRE; 4.3.3. ESTEREL; 4.4. Scheduling with synchronous languages; 4.5. Synchronous languages extended to perform scheduling; 4.5.1. LUSTRE; 4.5.2. PRELUDE; 4.5.3. SYNDEX; 4.5.4. TAXYS; 4.5.5. PSIC, Embedded Code and Network Code; 4.6. Conclusion; 4.7. Bibliography 5: Inductive Approaches for Packet Scheduling in Communication Networks5.1. Introduction; 5.2. Scheduling problem; 5.3. Approaches for real-time scheduling; 5.3.1. The strict priority; 5.3.2. The Generalized processor sharing paradigm; 5.3.3. The packet-by-packet generalized processor sharing (PGPS) scheduler; 5.3.4. Earliest deadline first; 5.3.5. Adaptive scheduling; 5.4. Basic concepts; 5.4.1. Monoagent learning; 5.4.2. Multi-agent reinforcement learning; 5.5. Proposed model; 5.6. Q-learning with approximation; 5.7. Conclusion; 5.8. Acknowledgment; 5.9. Bibliography 6: Scheduling in Networks |
| Record Nr. | UNINA-9910823750003321 |
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wile, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||