I am a PhD candidate in the Computer Science Department at Brown University,
under the supervision of Professor Maurice Herlihy.
I have a broad interest in distributed and parallel computing, especially on the theoretical side.
I have worked on the design and analysis of algorithms for work-stealing thread scheduling, radio networks, and reader-writer locks.
I received my M.S. in Computer Science from Dartmouth College,
where I was advised by Professor Prasad Jayanti.
I got my B.Eng. in Computer Science from Beijing University of Posts and Telecommunications.
During the summer of 2015, I worked on cloud task scheduling problems at Microsoft Research Asia in Beijing as a research intern, under the supervision of Thomas Moscibroda.
Publications
- Work Stealing for Linearizable Futures
Zhiyu Liu and Maurice Herlihy
In submission- Work Stealing for Linearizable Futures
- Approximate Local Sums and Their Applications in Radio Networks
Zhiyu Liu and Maurice Herlihy
International Symposium on DIStributed Computing (DISC) 2014- Approximate Local Sums and Their Applications in Radio Networks
- Well-Structured Futures and Cache Locality
Maurice Herlihy and Zhiyu Liu (alphabetical order)
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) 2014
(Best Paper Award) - Well-Structured Futures and Cache Locality
- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
Prasad Jayanti and Zhiyu Liu (alphabetical order)
International Symposium on DIStributed Computing (DISC) 2012- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks