Stéphane Bressan

Stéphane Bressan

Auto-generated profile, based on publicly available information

Stéphane Bressan

National University of Singapore

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 January 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
DBDebabrota Basu
Debabrota Basu
XWXiayang Wang
Xiayang Wang
YHYang Hong
Yang Hong
HCHaibo Chen
Haibo Chen
SBStephane Bressan
Stephane Bressan
Cloud providers leverage live migration of virtual machines to reduce energy consumption and allocate resources efficiently in data centers. Each migration decision depends on three questions: when to move a virtual machine, which virtual machine to move and where to move it? Dynamic, uncertain, and heterogeneous workloads running on virtual machines make such decisions difficult. Knowledge-based and heuristics-based algorithms are commonly used to tackle this problem. Knowledge-based algorithms, such as MaxWeight scheduling algorithms, are dependent on the specifics and the dynamics of the targeted Cloud architectures and applications. Heuristics-based algorithms, such as MMT algorithms, suffer from high variance and poor convergence because of their greedy approach. We propose an online reinforcement learning algorithm called Megh. Megh does not require prior knowledge of the workload rather learns the dynamics of workloads as-it-goes. Megh models the problem of energy- and performance-efficient resource management during live migration as a Markov decision process and solves it using a functional approximation scheme. While several reinforcement learning algorithms are proposed to solve this problem, these algorithms remain confined to the academic realm as they face the curse of dimensionality. They are either not scalable in real-time, as it is the case of MadVM, or need an elaborate offline training, as it is the case of Q-learning. These algorithms often incur execution overheads which are comparable with the migration time of a VM. Megh overcomes these deficiencies. Megh uses a novel dimensionality reduction scheme to project the combinatorially explosive state-action space to a polynomial dimensional space with a sparse basis. Megh has the capacity to learn uncertain dynamics and the ability to work in real-time without incurring significant execution overhead. Megh is both scalable and robust. We implement Megh using the CloudSim toolkit and empirically evaluate its performance with the PlanetLab and the Google Cluster workloads. Experiments validate that Megh is more cost-effective, converges faster, incurs smaller execution overhead and is more scalable than MadVM and MMT. An empirical sensitivity analysis explicates the choice of parameters in experiments.

5 May 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
RZRemmy Zen
Remmy Zen
LMLong My
Long My
RTRyan Tan
Ryan Tan
FHFrédéric Hébert
Frédéric Hébert
MGMario Gattobigio
Mario Gattobigio
SBStéphane Bressan
Stéphane Bressan
Neural-network quantum states have shown great potential for the study of many-body quantum systems. In statistical machine learning, transfer learning designates protocols reusing features of a machine learning model trained for a problem to solve a possibly related but different problem. We propose to evaluate the potential of transfer learning to improve the scalability of neural-network quantum states. We devise and present physics-inspired transfer learning protocols, reusing the features of neural-network quantum states learned for the computation of the ground state of a small system for systems of larger sizes. We implement different protocols for restricted Boltzmann machines on general-purpose graphics processing units. This implementation alone yields a speedup over existing implementations on multicore and distributed central processing units in comparable settings. We empirically and comparatively evaluate the efficiency (time) and effectiveness (accuracy) of different transfer learning protocols as we scale the system size in different models and different quantum phases. Namely, we consider both the transverse field Ising and Heisenberg XXZ models in one dimension, as well as in two dimensions for the latter, with system sizes up to 128 and 8×8 spins. We empirically demonstrate that some of the transfer learning protocols that we have devised can be far more effective and efficient than starting from neural-network quantum states with randomly initialized parameters.

1 January 2000
Verified
Conference Paper
Open access
BOBeng Chin Ooi
Beng Chin Ooi
KTKian-Lee Tan
Kian-Lee Tan
CYCui Yu
Cui Yu
SBStephane Bressan
Stephane Bressan
In this paper, we propose a new tunable index scheme, called iMinMax(&Ogr;), that maps points in high dimensional spaces to single dimension values determined by their maximum or minimum values among all dimensions. By varying the tuning “knob” &Ogr;, we can obtain different family of iMinMax structures that are optimized for different distributions of data sets. For a d-dimensional space, a range query need to be transformed into d subqueries. However, some of these subqueries can be pruned away without evaluation, further enhancing the efficiency of the scheme. Experimental results show that iMinMax(&Ogr;) can outperform the more complex Pyramid technique by a wide margin.

1 February 2018 in Energy
Verified
Journal Article
Closed access
HCHongtao Chi
Hongtao Chi
GPGiulia Pedrielli
Giulia Pedrielli
SNSzu Hui Ng
Szu Hui Ng
TKThomas Kister
Thomas Kister
SBStéphane Bressan
Stéphane Bressan

6 November 2000
Verified
Conference Paper
Open access
PDF file
BLBin Lan
Bin Lan
SBStephane Bressan
Stephane Bressan
BOBeng Chin Ooi
Beng Chin Ooi
KTKian-Lee Tan
Kian-Lee Tan

25 March 2016
Verified
Book Chapter
Closed access
PDF file
QLQing Liu
Qing Liu
TATalel Abdessalem
Talel Abdessalem
HWHuayu Wu
Huayu Wu
ZYZihong Yuan
Zihong Yuan
SBStéphane Bressan
Stéphane Bressan