Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Parallel job scheduling"”.
-
PARALLEL COMPUTING WITH P2P DESKTOP GRIDS
Tightly-coupled parallel computing is an important tool for problem solving. Structured peer-to-peer network overlays are failure-tolerant and have a low admin- istrative burden. This work seeks to unite the two. First, I present a completely decentralized algorithm for parallel job scheduling and …
-
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
… of this thesis are approximation algorithms for scheduling and packing, two classical geometrical problems in combinatorial optimization. It is divided into three parts. In the first part we consider a generalization of the strip packing problem or geometrical cutting stock problem. In strip …
-
Approximation algorithms for packing and scheduling problems
… is approximation algorithms for packing and scheduling problems: For the three-dimensional orthogonal knapsack problem (OKP-3) without rotations we present algorithms with approximation ratios arbitrarily close to 9, 8 and 7. For OKP-3 with 90 degree rotations around the z-axis or around all …
-
Space sharing job scheduling policies for parallel computers
… distinguishing characteristic of space sharing parallel job scheduling policies is that applications are allocated non-overlapping processor subsets. The interference among jobs is reduced, the synchronization delays and message latencies can be predictable, and distinct processors may be …
-
Αποτίμηση της απόδοσης πολιτικών χρονοδρομολόγησης παράλληλων εργασιών σε συστήματα πλέγματος με μοντέλα προσομοίωσης
… of service. The development of efficient scheduling algorithms is required in order to efficiently utilize grid systems. The main subject of this thesis is the performance evaluation of parallel job scheduling policies in grid systems by means of simulation models. The workload …
-
Objective-Driven Strategies for HPC Job Scheduling
… need for the development of more efficient job schedulers, which play a crucial role in the performance of HPC clusters. This dissertation manifests a comprehensive approach to this complex issue, contributing to three major components of the problem: (1) metrics of job packing efficiency …
-
Μοντελοποίηση, προσομοίωση και ανάλυση της απόδοσης και του κόστους υπολογιστικών νεφών
… arises, the need for better and more flexible scheduling of the cloud's resources, which are fluid and dynamic in nature. These resources, have levels of heterogeneity that are unheard of in classical distributed systems. In this thesis, our aim is, to explore how current scheduling methods can …