160 citations · 175 across the 11 of their papers we have counts for
12 papers
FastCap: An Efficient and Fair Algorithm for Power Capping in Many-Core Systems
Yanpei Liu, Guilherme Cox, Qingyuan Deng +2
Future servers will incorporate many active lowpower modes for different system components, such as cores and memory. Though these modes provide flexibility for power management vi…
SleepScale: Runtime Joint Speed Scaling and Sleep States Management for Power Efficient Data Centers
Yanpei Liu, Stark C. Draper, Nam Sung Kim
Power consumption in data centers has been growing significantly in recent years. To reduce power, servers are being equipped with increasingly sophisticated power management mecha…
On the Delay-Storage Trade-off in Content Download from Coded Distributed Storage Systems
Gauri Joshi, Yanpei Liu, Emina Soljanin
In this paper we study how coding in distributed storage reduces expected download time, in addition to providing reliability against disk failures. The expected download time is r…
Queuing Theoretic Analysis of Power-performance Tradeoff in Power-efficient Computing
Yanpei Liu, Stark C. Draper, Nam Sung Kim
In this paper we study the power-performance relationship of power-efficient computing from a queuing theoretic perspective. We investigate the interplay of several system operatio…
Coding for Fast Content Download
Gauri Joshi, Yanpei Liu, Emina Soljanin
We study the fundamental trade-off between storage and content download time. We show that the download time can be significantly reduced by dividing the content into chunks, encod…
Joint-tree model and the maximum genus of graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +1
The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and °M(G - v) =…
Vertex Splitting and Upper Embeddable Graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +2
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of up…
Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation
Jing Yang, Yanpei Liu, Stark C. Draper
In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at th…
Cooperative Packet Routing using Mutual Information Accumulation
Yanpei Liu, Jing Yang, Stark. C. Draper
We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arri…
Exploiting Channel Diversity in Secret Key Generation from Multipath Fading Randomness
Yanpei Liu, Stark C. Draper, Akbar M. Sayeed
We design and analyze a method to extract secret keys from the randomness inherent to wireless channels. We study a channel model for multipath wireless channel and exploit the cha…
Automorphisms and Enumeration of Maps of Cayley Graph of a Finite Group
Linfan Mao, Yanpei Liu
A map is a connected topological graph cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivale…
The Number of Complete Maps on Surfaces
Linfan Mao, Yanpei Liu, Feng Tian
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of…