Runtian Ren

According to our database, Runtian Ren authored at least 14 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Modeling Online Paging in Multi-Core Systems.

Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski

CoRR, 2024

Online Multi-Level Aggregation with Delays and Stochastic Arrivals.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Multi-level Aggregation with Delays and Stochastic Arrivals.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Online Matching with Delays and Stochastic Arrival Times.

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2021

The Min-Cost Matching with Concave Delays Problem.

Yossi Azar, Runtian Ren, Danny Vainstein

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems.

Runtian Ren, Xueyan Tang

Proceedings of the ICPP 2021: 50th International Conference on Parallel Processing, Lemont, IL, USA, August 9, 2021

2020

Interval Job Scheduling With Machine Launch Cost.

Runtian Ren, Yuqing Zhu, Chuanyou Li, Xueyan Tang

IEEE Trans. Parallel Distributed Syst., 2020

Busy-Time Scheduling on Heterogeneous Machines.

Runtian Ren, Xueyan Tang

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019

Cloud Scheduling with Discrete Charging Units.

Ming Ming Tan, Runtian Ren, Xueyan Tang

IEEE Trans. Parallel Distributed Syst., 2019

2018

Combinatorial algorithms for scheduling jobs to minimize server usage time

Runtian Ren

PhD thesis, 2018

2017

Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation.

Runtian Ren, Xueyan Tang, Yusen Li, Wentong Cai

IEEE/ACM Trans. Netw., 2017

Online Flexible Job Scheduling for Minimum Span.

Runtian Ren, Xueyan Tang

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time.

Runtian Ren, Xueyan Tang

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

On First Fit Bin Packing for Online Cloud Server Allocation.

Xueyan Tang, Yusen Li, Runtian Ren, Wentong Cai

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016