Scheduling parallel applications on heterogeneous distributed systems. ([2019])

• Record Type: Book
• Further Information: Note: Guoqi Xie, Ganf Zeng, Renfa Li, Keqin Li.
• Authors: Xie, Guoqi; Zeng, Gang; Li, Renfa; Li, Keqin
• Contents: Intro; Foreword; Preface; Motivation of the Book; Summary of Contents; Audience and Readership; Acknowledgments; Contents; 1 Introduction; 1.1 Heterogeneous Distributed Systems; 1.1.1 Heterogeneous Distributed Embedded Systems; 1.1.2 Heterogeneous Distributed Cloud Systems; 1.2 Cyber-Physical Systems; 1.2.1 Automotive Cyber-Physical Systems; 1.2.2 Cyber-Physical Cloud Systems; 1.3 Parallel Applications; 1.3.1 Parallel Automotive Applications; 1.3.2 Parallel Workflow Applications; 1.4 Scheduling; 1.4.1 Energy-Efficient Scheduling; 1.4.2 Reliability-Aware Scheduling 1.4.3 High Performance Real-Time Scheduling1.4.4 Scheduling on ACPS; 1.4.5 Scheduling on CPCS; 1.5 Outline of the Book; 1.6 Concluding Remarks; 2 Energy-Efficient Real-Time Scheduling; 2.1 Introduction; 2.1.1 Scheduling in Embedded Systems; 2.1.2 Scheduling in Cloud Systems; 2.2 Related Work; 2.3 Models and Preliminaries; 2.3.1 System Architecture; 2.3.2 Parallel Application Model; 2.3.3 Power and Energy Models; 2.3.4 Problem Statement; 2.4 Non-DVFS Energy-Efficient Scheduling; 2.4.1 Lower Bound; 2.4.2 Deadline Slack; 2.4.3 Variable Deadline Slack; 2.4.4 The NDES Algorithm 2.5 Global DVFS-Enabled Energy-Efficient Scheduling2.5.1 Existing EES Algorithm; 2.5.2 Revision of Time Calculations; 2.5.3 Energy-Efficient Dynamic Energy Consumption; 2.5.4 The GDES Algorithm; 2.6 Energy-Efficient Processor Merging; 2.6.1 A New Example for Processor Merging; 2.6.2 Processor Merging; 2.6.3 Energy-Efficient Processor Merging; 2.6.4 Quick Energy-Efficient Processor Merging; 2.7 Experiments for Energy-Efficiency Algorithm NDES 2.7.1 Experimental Metrics; 2.7.2 Fast Fourier Transform Application; 2.7.3 Gaussian Elimination Application 2.7.4 Randomly Generated Parallel Applications2.7.5 Real Platform Verification; 2.8 Experiments for Energy-Aware Algorithms EPM and QEPM; 2.8.1 Performance Evaluation Metrics; 2.8.2 Fast Fourier Transform Application; 2.8.3 Diamond Graph Application; 2.8.4 Gaussian Elimination Application; 2.8.5 Randomly Generated Parallel Application; 2.8.6 Summary of Experiments; 2.9 Concluding Remarks; 3 Reliability-Aware Fault-Tolerant Scheduling; 3.1 Introduction; 3.1.1 Redundancy Optimization; 3.1.2 Schedule Length and Cost Optimizations; 3.2 Related Work; 3.2.1 Reliability-Aware Scheduling 3.2.2 Response Time Aware Scheduling3.3 Models and Problem Statement; 3.3.1 Reliability Model; 3.3.2 Cost Model; 3.3.3 Fault-Tolerant Scheduling; 3.4 Enough Replication for Redundancy Minimization; 3.4.1 Problem Statement; 3.4.2 Lower Bound on Redundancy; 3.4.3 The LBR Algorithm; 3.4.4 Time Complexity of the LBR Algorithm; 3.4.5 An Example of The LBR Algorithm; 3.4.6 Enough Replication; 3.4.7 The ERRM Algorithm; 3.4.8 Time Complexity of the ERRM Algorithm; 3.4.9 An Example of The ERRM Algorithm; 3.5 Heuristic Replication for Redundancy Minimization
• Publisher Details: Singapore : Springer
• Publication Date: 2019
• Extent: 1 online resource (257 pages)
• Subjects: 004.35; Parallel processing (Electronic computers); Electronic data processing -- Distributed processing; Computer capacity -- Management; Electronic books
• Languages: English
• ISBNs: 9789811365577; 9811365571
• Related ISBNs: 9789811365560
• Notes: Note: Includes bibliographical references.; Note: Description based on online resource; title from digital title page (viewed on August 29, 2019).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.