4 citations · 5 across the 10 of their papers we have counts for
10 papers
Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
Chi-Yeh Chen
This paper addresses the scheduling problem for unrelated crowd workers in mobile social networks, where the required service time for each task varies among the assigned crowd wor…
Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
Chi-Yeh Chen
This paper addresses the scheduling problem in mobile social networks. We begin by proving that the approximation ratio analysis presented in the paper by Zhang \textit{et al.} (IE…
Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
Chi-Yeh Chen
As a prominent network abstraction, coflow models efficiently capture communication patterns in data centers. Since coflow scheduling in large-scale data centers is -…
Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks
Chi-Yeh Chen
Coflow is a network abstraction used to represent communication patterns in data centers. The coflow scheduling problem encountered in large data centers is a challenging $\mathcal…
Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows
Chi-Yeh Chen
This paper addresses the challenging scheduling problem of coflows with release times, with the objective of minimizing the total weighted completion time. Previous literature has…
Generalize Synchronization Mechanism: Specification, Properties, Limits
Chih-Wei Chien, Chi-Yeh Chen
Shared resources synchronization is a well studied problem, in both shared memory environment or distributed memory environment. Many synchronization mechanisms are proposed, with…
Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks
Chi-Yeh Chen, Jun Chen
With the rapid advancement of technology, parallel computing applications have become increasingly popular and are commonly executed in large data centers. These applications invol…
Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks
Chi-Yeh Chen
Coflow is a recently proposed network abstraction for data-parallel computing applications. This paper considers scheduling coflows with precedence constraints in identical paralle…
Scheduling Coflows for Minimizing the Total Weighted Completion Time in Heterogeneous Parallel Networks
Chi-Yeh Chen
Coflow is a network abstraction used to represent communication patterns in data centers. The coflow scheduling problem in large data centers is one of the most important -hard…
Scheduling Coflows for Minimizing the Total Weighted Completion Time in Identical Parallel Networks
Chi-Yeh Chen
Coflow is a recently proposed network abstraction to capture communication patterns in data centers. The coflow scheduling problem in large data centers is one of the most importan…