Admission Control and Scheduling Algorithms Based on ACO and PSO Heuristic for Optimizing Cost in Cloud Computing
HN Hoang, S Le Van, HN Maue, CPN Bien - Recent Developments in Intelligent …, 2016
Abstract Scheduling problem for user requests in cloud computing environment is NP-
complete. This problem is usually solved by using heuristic methods in order to reduce to
polynomial complexity. In this paper, heuristic ACO (Ant Colony Optimization) and PSO ( ...
complete. This problem is usually solved by using heuristic methods in order to reduce to
polynomial complexity. In this paper, heuristic ACO (Ant Colony Optimization) and PSO ( ...
[PDF] A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective
M Skutella - arXiv preprint arXiv:1603.04690, 2016
... [5] C. Chekuri and S. Khanna. Approximation algorithms for minimizing average weighted
completion time. In J. Leung, editor, Handbook of Scheduling: Algorithms, Models, and
Performance Analysis. CRC Press, 2004. [6] CS Chekuri, R. Motwani, B. Natarajan, and C. Stein. ...
completion time. In J. Leung, editor, Handbook of Scheduling: Algorithms, Models, and
Performance Analysis. CRC Press, 2004. [6] CS Chekuri, R. Motwani, B. Natarajan, and C. Stein. ...
[PDF] Real-Time System based on a Neural Network and PID Flight Control
V Artale, M Collotta, C Milazzo, G Pau, A Ricciardello - Appl. Math, 2016
... Automation, pp. 1252-1257, 2008. [23] GC Buttazzo, Hard Real-Time Computing
Systems - Predictable Scheduling Algorithms and Applications, Springer, ISBN
978-1-4614-0675-4, Third edition, 2011. [24] ERIKA Enterprise ...
Systems - Predictable Scheduling Algorithms and Applications, Springer, ISBN
978-1-4614-0675-4, Third edition, 2011. [24] ERIKA Enterprise ...
[PDF] Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time
A Muraleedharan, N Antony, R Nandakumar - Indian Journal of Science and …, 2016
... Different scheduling algorithms occur and have various benefits and drawbacks. ... 1.1
Scheduling Criteria The properties of the scheduling algorithms are very important. The
selection of the algorithm is done on the basis of the following properties. ...
Scheduling Criteria The properties of the scheduling algorithms are very important. The
selection of the algorithm is done on the basis of the following properties. ...
[PDF] Linear Programming Approaches for Power Savings in Software-defined Networks (The Extended Version)
FA Moghaddam, P Grosso - arXiv preprint arXiv:1603.04307, 2016
... Still the question remains on which scheduling algorithms are most suited to achieve this goal. ...
We derive four different flow scheduling algorithms that take into account a number of constraints
to provide either highest throughput or highest power efficiency. ...
We derive four different flow scheduling algorithms that take into account a number of constraints
to provide either highest throughput or highest power efficiency. ...
[PDF] Automated Queue Management System
N Uddin, MM Rashid, MG Mostafa - Global Journal of Management And Business …, 2016
... time. This queuing architecture model can switch between different scheduling
algorithms according to the testing result ie the average waiting time by using two
different queue control systems, which have developed. There ...
algorithms according to the testing result ie the average waiting time by using two
different queue control systems, which have developed. There ...
Parallel metaheuristics for the cyclic flow shop scheduling problem
W Bożejko, M Uchroński, M Wodecki - Computers & Industrial Engineering, 2016
In the paper there was proposed a new method of detection of block properties for cyclic flow
shop problem with machine setups that uses patterns designated for.
shop problem with machine setups that uses patterns designated for.
[PDF] Integrated scheduling of production and distribution with release dates and capacitated deliveries
X Zhong, D Jiang - 2016
... delivery times, Operations Research, 28(6), 1436–1441. [26] Pruhs, K., Sgall, J., Torng, E.
(2004) On-line scheduling, in: JY-T. Leung (Ed.), Handbook of Scheduling: Algorithms, Models,
and Performance Analysis, CRC Press. [27] Seiden, S. (1999). ...
(2004) On-line scheduling, in: JY-T. Leung (Ed.), Handbook of Scheduling: Algorithms, Models,
and Performance Analysis, CRC Press. [27] Seiden, S. (1999). ...
ADAPTIVE SCHEDULING FOR TASK ASSIGNMENT AMONG HETEROGENEOUS PROCESSOR CORES
R Barik, T Shpeisman, BT Lewis, R Kaleem - US Patent 20,160,055,612, 2016
... Although this asymmetric profiling approach substantially reduces overhead in the profiling phase,
compared to existing profiling based scheduling algorithms, there may still be some overhead
incurred during the execution phase if the iterations that were executed in the ...
compared to existing profiling based scheduling algorithms, there may still be some overhead
incurred during the execution phase if the iterations that were executed in the ...
A scheduling model for astronomy
M Solar, P Michelon, J Avarias, M Garces - Astronomy and Computing, 2016
... Problems such as the “Job Shop Scheduling Problem”(JSSP) [17] are relevant in the field
of dynamic scheduling because in most cases it is used as a base for constructing new
scheduling algorithms. JSSP is considered to be a NP-Complete problem. ...
of dynamic scheduling because in most cases it is used as a base for constructing new
scheduling algorithms. JSSP is considered to be a NP-Complete problem. ...
No comments:
Post a Comment