Daniar H. Kurniawan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Daniar H. Kurniawan has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Haryadi S. Gunawi
University of Chicago
2 shared publications - Aarti Gupta
Princeton University, Princeton, USA
1 shared publication - Achmad Imam Kistijantoro
Institut Teknologi Bandung, Bandung, Indonesia
1 shared publication - Cesar A. Stuardo
University of Chicago
1 shared publication - Chen Tian
Nanjing University, Nanjing, China
1 shared publication Dikaimin Simon
Surya University
1 shared publication
Latest Publications
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1109-1125
Heimdall: Optimizing Storage I/O Admission with Extensive Machine Learning Pipeline
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1109-1125
Open AccessHeimdall: Optimizing Storage I/O Admission with Extensive Machine Learning Pipeline
- Open Access
- 25 March 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-16
FlyMC
We present a fast and scalable testing approach for datacenter/cloud systems such as Cassandra, Hadoop, Spark, and ZooKeeper. The uniqueness of our approach is in its ability to overcome the path/state-space explosion problem in testing workloads with complex interleavings of messages and faults. We introduce three powerful algorithms: state symmetry, event independence, and parallel flips, which collectively makes our approach on average 16x (up to 78x) faster than other state-of-the-art solutions. We have integrated our techniques with 8 popular datacenter systems, successfully reproduced 12 old bugs, and found 10 new bugs --- all were done without random walks or manual checkpoints.
- 25 March 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-16
Open AccessFlyMC
We present a fast and scalable testing approach for datacenter/cloud systems such as Cassandra, Hadoop, Spark, and ZooKeeper. The uniqueness of our approach is in its ability to overcome the path/state-space explosion problem in testing workloads with complex interleavings of messages and faults. We introduce three powerful algorithms: state symmetry, event independence, and parallel flips, which collectively makes our approach on average 16x (up to 78x) faster than other state-of-the-art solutions. We have integrated our techniques with 8 popular datacenter systems, successfully reproduced 12 old bugs, and found 10 new bugs --- all were done without random walks or manual checkpoints.