Events

SUTD Design Innovation Forum – Design Alliance Summit

Data placement is one of the fundamental allocation problems in storage-capable distributed systems, such as web caches and peer-to-peer networks. Motivated by such applications, we consider the non-metric data placement problem and develop distributed algorithms for computing or approximating its optimal solutions. In this problem, the goal is to store copies of the data points among cache-capacitated servers to minimize overall data storage and clients’ access costs. We first show that the non-metric data placement problem is inapproximable up to a logarithmic factor. We then provide a game-theoretic decomposition of the objective function and show that natural Glauber dynamics will converge to an optimal global solution with polynomial mixing time for a certain range of noise parameters. Moreover, we provide another auction-based distributed algorithm, which allows us to approximate the optimal solution with a theoretical performance guarantee. The proposed algorithms not only provide good performance guarantees but also will enable the system to operate in a distributed manner, hence reducing the computational load and improving the robustness to failures.

HASS Talk: Meat is Murder: Southeast Asia’s Oldest Ethical Code

DH Asia Webinar Series: “Du Fu in Paratexts: An Analytical Reading of Literary Intertextuality in Chosŏn Korea” by Jamie Jungmin Yoo

ARISE Program – Validate

50.047 Mobile Robotics Course – Autonomous Race Car Challenge

Festival of Ideas in the Humanities and Social Sciences: “Singapura before Raffles: early modern Asia in the Global Renaissance”

Tan Wee Siang & Yap Jian Beng (Singtel) – The Quantum Leap: Unleashing the Power of Cloud Networking

Sujoy Roy (AWS) – Building Machine Learning Solutions: A Working Backwards Approach

Adrian Tan (RSAF) – Digitalisation and You