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 20 of 122 for “"Job Scheduling"”.

  1. Job Scheduling with Genetic Algorithm

    … (GA) approach for providing a solution to the Job Scheduling Problem (JSP) of placing 5000 jobs on 806 machines. The GA starts off with a randomly generated population of 100 chromosomes, each of which represents a random placement of jobs on machines. The population then goes through the …

    ndsu Repository record for Job Scheduling with Genetic Algorithm (opens in a new tab)

  2. Rapid Prototyping Job Scheduling Optimization

    … on human intervention to load and unload build jobs. Hence, jobs are processed subject to both the machine's and the operator's schedules. In particular, first-in-first-out (FIFO) queuing of such systems will result in machine idle time whenever a build job has been completed and an operator is …

    vt Repository record for Rapid Prototyping Job Scheduling Optimization (opens in a new tab)

  3. 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 …

    ucf Repository record for Objective-Driven Strategies for HPC Job Scheduling (opens in a new tab)

  4. Goal-Oriented Job Scheduling for Parallel Computer Systems

    … computers face many difficulties when managing job scheduling systems. First, current production job schedulers use many parameters, which seem flexible but it is highly challenging to configure and tune these parameters. Second, fair share is an important scheduling goal, but it is not clear …

    portland-state Repository record for Goal-Oriented Job Scheduling for Parallel Computer Systems (opens in a new tab)

  5. Job Scheduling Considering Both Mental Fatigue and Boredom

    Numerous aspects of job scheduling in manufacturing systems have been the focus of several studies in the past decades. However, human factors in manufacturing systems such as workers’ mental conditions are still neglected issues and have not received adequate attentions. Job boredom and mental …

    ottawa-retro Repository record for Job Scheduling Considering Both Mental Fatigue and Boredom (opens in a new tab)

  6. Space sharing job scheduling policies for parallel computers

    … 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 allocated to …

    iastate Repository record for Space sharing job scheduling policies for parallel computers (opens in a new tab)

  7. Optical Grid Network Dimensioning, Provisioning, and Job Scheduling

    … Another issue is the provisioning of the job requests (maximization of services) on the capacitated networks, also referred to as Grade of Service (GoS). Additionally, job scheduling on the servers has also an important impact on the utilization of computing and network resources. …

    concordia Download PDF for Optical Grid Network Dimensioning, Provisioning, and Job Scheduling (opens in a new tab)

  8. INNOVATIVE GENERIC JOB SCHEDULING FRAMEWORKS FOR CLOUD COMPUTING ENVIRONMENTS

    volving technology, has kept drawing a significant attention from both the computing industry and academia for nearly a decade.

    siu-theses Repository record for INNOVATIVE GENERIC JOB SCHEDULING FRAMEWORKS FOR CLOUD COMPUTING ENVIRONMENTS (opens in a new tab)

  9. A simulation model for the study of job scheduling policy.

    A job scheduling simulation model was produced for the purpose of developing an effective Initiator usage policy. While the first part of the study gives a detailed overview of the structure of the OS/MVT Job Management routines the parts thereafter are devoted to describing the simulation model …

    nps Repository record for A simulation model for the study of job scheduling policy. (opens in a new tab)

  10. Using swarm intelligence for distributed job scheduling on the grid

    … an ant is invoked in response to submitting a job to the Grid and this ant surfs the network to find the best resource to deliver the job to. In the ParticleZ algorithm, each node plays a role as a particle and moves toward other particles by sharing its workload among them. We will be …

    sask Repository record for Using swarm intelligence for distributed job scheduling on the grid (opens in a new tab)

  11. Dual-Agent Deep Reinforcement Learning Approach to GPU Job Scheduling

    … for distributed deep learning tasks, making the job scheduler critical for minimizing job waiting and completion times. However, scheduling is inherently complex and NP-hard. Current approaches typically address job scheduling and GPU allocation separately, leading to suboptimal performance. …

    york Repository record for Dual-Agent Deep Reinforcement Learning Approach to GPU Job Scheduling (opens in a new tab)

  12. JOB SCHEDULING FOR STREAMING APPLICATIONS IN HETEROGENEOUS DISTRIBUTED PROCESSING SYSTEMS

    … and data transmission, which make the optimal scheduling algorithms an NP-complete problem. Scheduling streaming applications plays a key role in optimizing system performance, particularly in maximizing the frame-rate, or how many instances of data sets can be processed per unit of time. The …

    siu-theses Repository record for JOB SCHEDULING FOR STREAMING APPLICATIONS IN HETEROGENEOUS DISTRIBUTED PROCESSING SYSTEMS (opens in a new tab)

  13. Job scheduling on high performance computer systems: Complexity and algorithms

    The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is …

    uiuc Repository record for Job scheduling on high performance computer systems: Complexity and algorithms (opens in a new tab)

  14. Performance Evaluation of Job Scheduling and Resource Allocation in Apache Spark

    … the right fit for their applications and how the scheduling behaviour and parameter settings of these cluster managers affect the performance of their applications in terms of resource utilization and response times. This thesis parallelized a set of heterogeneous image processing applications …

    sask Repository record for Performance Evaluation of Job Scheduling and Resource Allocation in Apache Spark (opens in a new tab)

  15. ENERGY-AWARE JOB SCHEDULING AND CONSOLIDATION APPROACHES FOR WORKFLOWS IN CLOUD

    … performance guaranteed and cost-effective job schedulers. Many researchers have been focusing on scheduling jobs with high performance, and their primary concern has been execution time considerations. As a result of this thinking, little attention was paid to energy consumption and energy …

    siu-theses Repository record for ENERGY-AWARE JOB SCHEDULING AND CONSOLIDATION APPROACHES FOR WORKFLOWS IN CLOUD (opens in a new tab)

  16. Models and Methods for Multiple Resource Constrained Job Scheduling under Uncertainty

    We consider a scheduling problem where each job requires multiple classes of resources, which we refer to as the multiple resource constrained scheduling problem(MRCSP). Potential applications include team scheduling problems that arise in service industries such as consulting and operating room …

    arizona-thes Repository record for Models and Methods for Multiple Resource Constrained Job Scheduling under Uncertainty (opens in a new tab)

Page 1 of 7