Examples of using Scheduling algorithm in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
A real-time scheduling algorithm can be classified as static or dynamic.
However, it requires the use of dynamic scheduling algorithms, such as work stealing.
In this scheduling algorithm, once assigned to a queue, the process will not move to any other queues.
The performance of router depends of the scheduling algorithm, considering its throughput and complexity.
In computational grids is possible to maintain computational efficiency and reduce energy consumption,through practices of green computing in the development of scheduling algorithms and resource assignments.
Study and simulation of scheduling algorithms for mobile grids focused on connectivity….
Each queue will be assigned a priority andwill have its own scheduling algorithm like Round-robin scheduling or FCFS.
In a multi-level queue scheduling algorithm, there will be'n' number of queues, where'n' is the number of groups the processes are classified into.
In computer networks,especially wireless networks, scheduling algorithms may suffer from scheduling starvation.
Modern scheduling algorithms normally contain code to guarantee that all processes will receive a minimum amount of each important resource(most often CPU time) in order to prevent any process from being subjected to starvation.
On the design and solution of an online refinery scheduling algorithm for Open-loop and Closed-loop strategies, BE.EP. DD.
The development of the scheduling algorithm is based on a modified version of the proportional fairness, using analytic hierarchy process(ahp) which allows to aggregate performance criteria to improve resource allocation for users based on the general traffic.
In this work we survey the most relevant theoretical scheduling algorithms and propose a scheduling approach using genetic algorithms. .
Multi-level queue scheduling algorithm is used in scenarios where the processes can be classified into groups based on property like process type, CPU time, IO access, memory size, etc. One general classification of the processes is foreground processes and background processes.
Therefore, this dissertation proposes a methodology for the study of the impact of radio resource scheduling algorithms for vehicular networks using lte as the access technology. this study uses a discrete simulation approach, carried out with ns-3 and sumo tools.
The main scheduling algorithms found in the literature use a matrix constructed in the time domain based on two paradigms, channel dependent(cd) and proportional fairness(pf), for the filtering of users that will be scheduled later. but, both do not consider the quality of service(qos) requirements in their approaches. in view of this.
The investigated system employed a scheduling algorithm for the treatment of competing voip and data services.
This thesis deals with scheduling algorithms aiming at the maximization and adaptive control of the satisfaction index in the downlink of an orthogonal frequency division multiple access(ofdma) network, considering different types of traffic models of non-real time(nrt) and real time(rt) services; and more realistic channel conditions, e.g., imperfect channel state information csi.
Using a newly developed alternative grade scheduling algorithm, Solutions produces the best, most cost efficient trimming solutions available.
This work presents a new scheduling algorithm aiming to optimize the use of downlink resources in the long term evolution(lte) and lte advanced(lte-a) networks.
Therefore, this study aimed to develop a scheduling algorithm for cloud efficiently determine the distribution of resources within the architecture.
The performances of the proposed scheduling algorithms were evaluated by an extensive set of experiments, which demonstrated the feasibility of the adopted approach regarding energy consumption minimization.
In this work, we propose the use of energy-aware scheduling algorithms to efficiently manage the energy consumption in computational grids trying to avoid excessive performance losses.
Using this programming method, a process scheduling algorithm increases the priority of a process(A) to the maximum priority of any other process waiting for any resource on which A has a resource lock if it is higher than the original priority of A.
Considering the context of energy management in mobile grids,this work proposes two scheduling algorithms(maximum regret and greedy) that aim not only to reduce the energy consumption of the mobile devices, but also to ensure the qos(quality of service) requirements of the running applications.
The results show that the use of a scheduling algorithm allows the priority assignment to meet the voip calls, resulting in an acceptable quality of service, even in the presence of data traffic competitor.
More information about the scheduling algorithms and example rulesets are available at the OpenBSD's web archive.
The main feature, the time quantum,shared in scheduling algorithms, such as: priority scheduling, round-robin scheduling, multilevel queue scheduling, weighted fair queuing and weighted round-robin, allows lower priority requests have higher opportunity to be managed.
It's saying that the registration manager depends upon the Schedule Algorithm to do something.
The Schedule Algorithm is either a parameter to one of the methods or is declared locally by one of the Methods of the Registration Manager.