Multiobjective optimization using dynamic neighborhood particle swarm optimization

X Hu, R Eberhart - Proceedings of the 2002 Congress on …, 2002 - ieeexplore.ieee.org
This paper presents a particle swarm optimization (PSO) algorithm for multiobjective
optimization problems. PSO is modified by using a dynamic neighborhood strategy, new …

Backfilling using system-generated predictions rather than user runtime estimates

D Tsafrir, Y Etsion, DG Feitelson - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
The most commonly used scheduling algorithm for parallel supercomputers is FCFS with
backfilling, as originally introduced in the EASY scheduler. Backfilling means that short jobs …

Reducing electricity cost through virtual machine placement in high performance computing clouds

K Le, R Bianchini, J Zhang, Y Jaluria, J Meng… - Proceedings of 2011 …, 2011 - dl.acm.org
In this paper, we first study the impact of load placement policies on cooling and maximum
data center temperatures in cloud service providers that operate multiple geographically …

Spoton: a batch computing service for the spot market

S Subramanya, T Guo, P Sharma, D Irwin… - Proceedings of the sixth …, 2015 - dl.acm.org
Cloud spot markets enable users to bid for compute resources, such that the cloud platform
may revoke them if the market price rises too high. Due to their increased risk, revocable …

Improving backfilling by using machine learning to predict running times

E Gaussier, D Glesser, V Reis, D Trystram - Proceedings of the …, 2015 - dl.acm.org
The job management system is the HPC middleware responsible for distributing computing
power to applications. While such systems generate an ever increasing amount of data, they …

Market-oriented grids and utility computing: The state-of-the-art and future directions

J Broberg, S Venugopal, R Buyya - Journal of Grid Computing, 2008 - Springer
Traditional resource management techniques (resource allocation, admission control and
scheduling) have been found to be inadequate for many shared Grid and distributed …

Reliable provisioning of spot instances for compute-intensive applications

W Voorsluys, R Buyya - 2012 ieee 26th international …, 2012 - ieeexplore.ieee.org
Cloud computing providers are now offering their unused resources for leasing in the spot
market, which has been considered the first step towards a full-fledged market economy for …

Benefits and drawbacks of redundant batch requests

H Casanova - Journal of Grid Computing, 2007 - Springer
Most parallel computing platforms are controlled by batch schedulers that place requests for
computation in a queue until access to compute nodes is granted. Queue waiting times are …

A performance model to estimate execution time of scientific workflows on the cloud

I Pietri, G Juve, E Deelman… - 2014 9th workshop on …, 2014 - ieeexplore.ieee.org
Scientific workflows, which capture large computational problems, may be executed on large-
scale distributed systems such as Clouds. Determining the amount of resources to be …

Obtaining dynamic scheduling policies with simulation and machine learning

D Carastan-Santos, RY De Camargo - Proceedings of the International …, 2017 - dl.acm.org
Dynamic scheduling of tasks in large-scale HPC platforms is normally accomplished using
ad-hoc heuristics, based on task characteristics, combined with some backfilling strategy …