Sökning: "scheduling"

Visar resultat 6 - 10 av 544 avhandlingar innehållade ordet scheduling.

1. 6. Short-term Underground Mine Scheduling : An Industrial Application of Constraint Programming

   Författare :Max Åstrand; Mikael Johansson; Mats Carlsson; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; underground mines; constraint programming; large neighborhood search; korttidsplanering; gruvdrift; underjordsgruvor; villkorsprogrammering; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : The mining industry is facing a surge in automation in the pursuit of safe and profitable operations. As the excavation process is increasingly automated, today's mining companies seek to optimize the coordination of the now automated mining activities. LÄS MER

3. 7. Short-term Underground Mine Scheduling : Constraint Programming in an Industrial Application

   Författare :Max Åstrand; Mikael Johansson; Christian Schulte; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; mine; underground; constraint programming; cp; large neighborhood search; lns; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : The operational performance of an underground mine depends critically on how the production is scheduled. Increasingly advanced methods are used to create optimized long-term plans, and simultaneously the actual excavation is getting more and more automated. LÄS MER

4. 8. Dynamic Cloud Resource Management : Scheduling, Migration and Server Disaggregation

   Författare :Petter Svärd; Erik Elmroth; Odej Kao; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Cloud computing; virtualization; distributed infrastructure; live migration; scheduling;

   Sammanfattning : A key aspect of cloud computing is the promise of infinite, scalable resources, and that cloud services should scale up and down on demand. This thesis investigates methods for dynamic resource allocation and management of services in cloud datacenters, introducing new approaches as well as improvements to established technologies. LÄS MER

5. 9. Understanding Task Parallelism : Providing insight into scheduling, memory, and performance for CPUs and Graphics

   Författare :Germán Ceballos; David Black-Schaffer; Erik Hagersten; Samuel Thibault; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Task-based programming; Task Scheduling; Analytical Cache Model; Scheduling; Runtime Systems; Computer Graphics rendering ; Computer Science; Datavetenskap;

   Sammanfattning : Maximizing the performance of computer systems while making them more energy efficient is vital for future developments in engineering, medicine, entertainment, etc. However, the increasing complexity of software, hardware, and their interactions makes this task difficult. LÄS MER

7. 10. 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