Sökning: "task scheduling"

Visar resultat 6 - 10 av 100 avhandlingar innehållade orden task scheduling.

1. 6. Improving Performance and Quality-of-Service through the Task-Parallel Model​ : Optimizations and Future Directions for OpenMP

   Författare :Artur Podobas; Mats Brorsson; Georgi Gaydadjiev; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Task Parallel; OpenMP; Scheduling; OmpSs; multicore; manycore; Datalogi; Computer Science;

   Sammanfattning : With the failure of Dennard's scaling, which stated that shrinking transistors will be more power-efficient, computer hardware has today become very divergent. Initially the change only concerned the number of processor on a chip (multicores), but has today further escalated into complex heterogeneous system with non-intuitive properties -- properties that can improve performance and power consumption but also strain the programmer expected to develop on them. LÄS MER

3. 7. Cooperative user- and system-level scheduling of task-centric parallel programs

   Författare :Georgios Varisteas; Mats Brorsson; Karl-Filip Faxén; Timothy Roscoe; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; parallel; workload; runtime; task; adaptive; resource management; load balancing; work-stealing; SRA - ICT; SRA - Informations- och kommunikationsteknik;

   Sammanfattning : Emerging architecture designs include tens of processing cores on a single chip die; it is believed that the number of cores will reach the hundreds in not so many years from now. However, most common workloads cannot expose fluctuating parallelism, insufficient to utilize such systems. LÄS MER

4. 8. Effective cooperative scheduling of task-parallel applications on multiprogrammed parallel architectures

   Författare :Georgios Varisteas; Mats Brorsson; Avi Mendelson; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; multicore; parallel; scheduler; workload; runtime; task; adaptive; resource management; load balancing; work-stealing; Computer Science; Datalogi;

   Sammanfattning : Emerging architecture designs include tens of processing cores on a single chip die; it is believed that the number of cores will reach the hundreds in not so many years from now. However, most common parallel workloads cannot fully utilize such systems. LÄS MER

5. 9. Preemption-Delay Aware Schedulability Analysis of Real-Time Systems

   Författare :Filip Marković; Jan Carlson; Radu Dobrin; Björn Lisper; Enrico Bini; Mälardalens högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Real-time systems; Scheduling; Schedulability analysis; Preemptions; Preemption delays; Embedded Systems; Preemptive scheduling; Response-time analysis; Cache-related preemption delay; Timing analysis; Worst-case execution time analysis; Limited-preemptive scheduling; Fixed preemption points; Computer Science; datavetenskap;

   Sammanfattning : Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-negative results, deeming a schedulable taskset being unschedulable. This is the case due to the inherent over-approximation of many time-related parameters such as task execution time, system delays, etc. LÄS MER

7. 10. Adaptive Task Scheduling and Resource Management Techniques for Improving Energy Efficiency on Multi-core Systems

   Författare :Jing Chen; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Dynamic Voltage and Frequency Scaling DVFS ; Performance Modeling; Energy Efficiency; Runtime System; Power Modeling; Task Scheduling;

   Sammanfattning : The growing impact of energy on operational cost and system robustness becomes a strong motivation for improving energy efficiency in parallel computing systems, in addition to performance. Hardware features such as core asymmetry and Dynamic Voltage and Frequency Scaling (DVFS) aim to provide opportunities for energy-efficient computing. LÄS MER