نتایج جستجو برای: job scheduling
تعداد نتایج: 131965 فیلتر نتایج به سال:
Background: Flexible work schedules give nurses the freedom and control to manage demands of work and life, while allowing the organisation to meet their staffing needs. Aim: To explore nurses’ perceptions of their job satisfaction and its relationship to selfscheduling. Significant to Nursing Practice and Leadership: Nurses and nurse leaders have the potential to change the way scheduling of t...
Some CPU scheduling algorithms such as First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (R-R), Multilevel Queue(MQ) and Multilevel Feedback Queue (MFQ has been elaborated and assessed on the basic CPU scheduling objectives i.e.; average waiting(AWT), average turnaround (ATT)and average response time(ART), average CPU utilization (AU)and average throughput(AT). Thes...
Scheduling involves the allocation of resources over a period of time to perform a collection of tasks (Baker, 1974). It is a decision-making process that plays an important role in most manufacturing and service industries (Pinedo, 2005). Scheduling in the context of manufacturing systems refers to the determination of the sequence in which jobs are to be processed over the production stages, ...
Parallel job scheduling is an important problem whose solution may lead to better utilization of modern parallel computers. It is de ned as : Given the aggregate of all tasks of multiple jobs in a parallel system, nd a spatial and temporal allocation to execute all tasks e ciently . For the purposes of scheduling, we view a computer as a queueing system. An arriving job may wait for some time, ...
A grid is an infrastructure for resource sharing. At present, many scientific applications require high computing power in processing, which can only be achieved by using the computational grid. For the selection and allocation of grid resources to current and future applications, grid job scheduling is playing a very vital role for computational grids. They constitute the building blocks for m...
In this study, based on the consideration of energy consumption, we take to improve the strategy of the MapReduce job scheduling algorithm, in order to reduce the average response time for task scheduling of interactive jobs in the network. In accordance with the job priority grouping to adjust the scheduling task response time which can reduce the impact of network congestion, with good result...
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. Minimizing WTV is a well known scheduling problem, important in providing Quality of Service (QoS) in many industries. Minimizing the variance of job waiting times on computer networks can...
Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In th...
Job scheduling plays a critical role in the utilisation of grid resources by mapping a number of jobs to grid resources. However, the heterogeneity of grid resources adds some challenges to the work of job scheduling, especially when jobs have dependencies which can be represented as Direct Acyclic Graphs (DAGs). It is widely recognised that scheduling m jobs to n resources with an objective to...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید