Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Shaofeng H.-C. Jiang"'
Autor:
Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Guopeng Li, Xiang-Yang Li
Publikováno v:
IEEE/ACM Transactions on Networking. 31:352-365
Autor:
Haisheng Tan, Zhenhua Han, Xiaoming Fu, Francis C. M. Lau, Wanli Cao, Lan Zhang, Shaofeng H.-C. Jiang
Publikováno v:
IEEE/ACM Transactions on Networking. 29:2267-2280
The Bulk Synchronous Parallel (BSP) paradigm is gaining tremendous importance recently due to the popularity of computations as distributed machine learning and graph computation. In a typical BSP job, multiple workers concurrently conduct iterative
Publikováno v:
IEEE/ACM Transactions on Networking. 29:1841-1852
Motivated by practical scenarios in areas such as Mobile Edge Computing (MEC) and Content Delivery Networks (CDNs), we study online file caching on multiple caches, where a file request might be relayed to other caches or bypassed directly to the mem
Publikováno v:
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications.
Publikováno v:
ACM Transactions on Algorithms. 16:1-23
We present a unified polynomial-time approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a s
Publikováno v:
IEEE/ACM Transactions on Networking. 27:2472-2485
In edge-cloud computing, a set of servers (called edge servers) are deployed near the mobile devices to allow these devices to offload their jobs to and subsequently obtain their results from the edge servers with low latency. One fundamental problem
Autor:
Zhenhua Han, Chenzi Zhang, Yupeng Li, Shaofeng H.-C. Jiang, Xiang-Yang Li, Haisheng Tan, Francis C. M. Lau
Publikováno v:
IEEE/ACM Transactions on Networking. 27:1771-1786
A coflow is a collection of related parallel flows that occur typically between two stages of a multi-stage computing task in a network, such as shuffle flows in MapReduce. The coflow abstraction allows applications to convey their semantics to the n
Publikováno v:
INFOCOM
The Bulk Synchronous Parallel (BSP) paradigm is gaining tremendous importance recently because of the pop-ularity of computations such as distributed machine learning and graph computation. In a typical BSP job, multiple workers concurrently conduct
Publikováno v:
ACM Transactions on Algorithms. 14:1-18
We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find the shortest tour that visits each of a given collection of subsets (regions or neighborhoods) in the underlying metric space. We give a ran