Blog

🌱 生于忧患,死于安乐 —— 我在ACM班的这(3)+1年

“人恒过,然后能改。困于心,衡于虑,而后作;征于色,发于声,而后喻。”小时候背古文只是咿咿呀呀地读,如今倒是能咂摸出些意味了。

🌱 问心 —— 我在ACM班的这四年

听父亲说,祖谱上我是“心”字辈。回望在ACM班度过的四年,以“问心”为题,自问自省。

📝 Online Scheduling: Dynamic Memory Allocation

Course project for Online Algorithm (CS1962).
We study online algorithms for dynamic memory allocation, including First Fit, the Coloring Algorithm, and the Buddy System, and conduct competitive analysis of these algorithms. We also implemente these algorithms and do simulation experiment to evaluate their efficiency.

📝 Online Scheduling: Identical Machine Makespan Minimization

Lecture notes for Online Algorithm (CS1962).
We study the online makespan minimization problem on identical machines, where jobs arrive sequentially and must be assigned immediately without knowledge of future arrivals.