Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhiqiang Ma 0002

dblp:62/3653-2 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2016
0000-0001-7568-3588ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 82% Memory systems · 14% Distributed systems · 4%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.212016
Towards Comprehensive Traffic Forecasting in Cloud Computing: Design and Application · IEEE/ACM Trans. Netw. 2016
Cloud and datacenter computing › datacenter network
datacenter traffic management
0.212016
Towards Comprehensive Traffic Forecasting in Cloud Computing: Design and Application · IEEE/ACM Trans. Netw. 2016
Cloud and datacenter computing › job scheduling › network-aware scheduling
network-aware job scheduling
0.212016
Towards Comprehensive Traffic Forecasting in Cloud Computing: Design and Application · IEEE/ACM Trans. Netw. 2016
Cloud and datacenter computing › datacenter network
datacenter traffic
0.212014
HadoopWatch: A first step towards comprehensive traffic forecasting in cloud computing · INFOCOM 2014
Memory systems › shared memory
distributed shared memory
0.212014
DVM: A Big Virtual Machine for Cloud Computing · IEEE Trans. Computers 2014
Operating systems › virtualization
hypervisor
0.112014
DVM: A Big Virtual Machine for Cloud Computing · IEEE Trans. Computers 2014

Methods — techniques the papers use, named apart from their topics

file system monitoring · 0.4instruction set architecture design · 0.4distributed shared memory · 0.4machine learning prediction · 0.2log analysis · 0.2
YearPublicationVenuePosition
2016 Towards Comprehensive Traffic Forecasting in Cloud Computing: Design and Application
abstract
In this paper, we present our effort towards comprehensive traffic forecasting for big data applications using external, light-weighted file system monitoring. Our idea is motivated by the key observations that rich traffic demand information already exists in the log and meta-data files of many big data applications, and that such information can be readily extracted through run-time file system monitoring. As the first step, we use Hadoop as a concrete example to explore our methodology and develop a system called HadoopWatch to predict traffic demands of Hadoop applications. We further implement HadoopWatch in a small-scale testbed with 10 physical servers and 30 virtual machines. Our experiments over a series of MapReduce applications demonstrate that HadoopWatch can forecast the traffic demand with almost 100% accuracy and time advance. Furthermore, it makes no modification on the Hadoop framework, and introduces little overhead to the application performance. Finally, to showcase the utility of accurate traffic prediction made by HadoopWatch, we design and implement a simple HadoopWatch-enabled network optimization module into the HadoopWatch controller, and with realistic Hadoop job benchmarks we find that even a simple algorithm can leverage the forecasting results provided by HadoopWatch to significantly improve the Hadoop job completion time by up to 14.72%.
Kai Chen 0005, Wei Bai 0001, Yangming Zhao, Hao Wang 0022, Yanhui Geng, Zhiqiang Ma 0002, Lin Gu 0001
IEEE/ACM Trans. Netw.8
2014 HadoopWatch: A first step towards comprehensive traffic forecasting in cloud computing
abstract
This paper presents our effort towards comprehensive traffic forecasting for big data applications using external, light-weighted file system monitoring. Our idea is motivated by the key observations that rich traffic demand information already exists in the log and meta-data files of many big data applications, and that such information can be readily extracted through run-time file system monitoring. As the first step, we use Hadoop1 as a concrete example to explore our methodology and develop a system called HadoopWatch to predict traffic demand of Hadoop applications. We further implement HadoopWatch in our real small-scale testbed with 10 physical servers and 30 virtual machines. Our experiments over a series of MapReduce applications demonstrate that HadoopWatch can forecast the traffic demand with almost 100% accuracy and time advance. Furthermore, it makes no modification of the Hadoop framework, and introduces little overhead to the application performance.
Kai Chen 0005, Wei Bai 0001, Zhiqiang Ma 0002, Lin Gu 0001
INFOCOM5
2014 DVM: A Big Virtual Machine for Cloud Computing
abstract
As cloud-based computation grows to be an increasingly important paradigm, providing a general computational interface to support datacenter-scale programming has become an imperative research agenda. Many cloud systems use existing virtual machine monitor (VMM) technologies, such as Xen, VMware, and Windows Hypervisor, to multiplex a physical host into multiple virtual hosts and isolate computation on the shared cluster platform. However, traditional multiplexing VMMs do not scale beyond one single physical host, and it alone cannot provide the programming interface and cluster-wide computation that a datacenter system requires. We design a new instruction set architecture, DISA, to unify myriads of compute nodes to form a big virtual machine called DVM and present programmers the view of a single computer, where thousands of tasks run concurrently in a large, unified, and snapshotted memory space. The DVM provides a simple yet scalable programming model and mitigates the scalability bottleneck of traditional distributed shared memory systems. Along with an efficient execution engine, the capacity of a DVM can scale up to support large clusters. We have implemented and tested DVM on four platforms, and our evaluation shows that DVM has excellent performance and scalability. On one physical host, the system overhead of DVM is comparable to that of traditional VMMs. On 16 physical hosts, the DVM runs 10 times faster than MapReduce/Hadoop and X10. On 160 compute nodes in the TH-1/GZ supercomputer, the DVM delivers a$\bf{12.99\times}$speedup over the computation on 10 compute nodes. The implementation of DVM also allows it to run above traditional VMMs, and we verify that DVM shows linear speedup on a parallelizable workload on 256 large EC2 instances.
Zhiqiang Ma 0002, Zhonghua Sheng, Lin Gu 0001
IEEE Trans. Computers1
2013 VOLUME: Enable Large-Scale In-Memory Computation on Commodity Clusters
abstract
Traditional cloud computing technologies, such as MapReduce, use file systems as the system-wide substrate for data storage and sharing. A distributed file system provides a global name space and stores data persistently, but it also introduces significant overhead. Several recent systems use DRAM to store data and tremendously improve the performance of cloud computing systems. However, both our own experience and related work indicate that a simple substitution of distributed DRAM for the file system does not provide a solid and viable foundation for data storage and processing in the data center environment, and the capacity of such systems is limited by the amount of physical memory in the cluster. To overcome the challenge, we construct VOLUME (Virtual On-Line Unified Memory Environment), a distributed virtual memory to unify the physical memory and disk resources on many compute nodes, to form a system-wide data substrate. The new substrate provides a general memory based abstraction, takes advantage of DRAM in the system to accelerate computation, and, transparent to programmers, scales the system to handle large datasets by swapping data to disks and remote servers. The evaluation results show that VOLUME is much faster than Hadoop/HDFS, and delivers 6-11x speedups on the adjacency list workload. VOLUME is faster than both Hadoop/HDFS and Spark/RDD for in-memory sorting. For kmeans clustering, VOLUME scales linearly to 160 compute nodes on the TH-1/GZ supercomputer.
Zhiqiang Ma 0002, Ke Hong, Lin Gu 0001
CloudCom (1)1
2013 A Synergy of the Wireless Sensor Network and the Data Center System
abstract
In recent years, data centers have emerged to be an increasingly important computing infrastructure. It is shown that wireless sensor networks (sensor nets) can provide fine-grained measurements in data centers, and achieve better control of the data center platform for energy efficiency. However, the usage of sensor nets has so far been limited to auxiliary functions, such as sensory data collection across a data center. We argue that the combined computational and networking capability of a sensor network enables it to interact with the clusters in a much more sophisticated way and enhance essential functions in a data center. We have designed a Cluster-Area Sensor Network (CASN) to improve the cluster management and operational security in the system. Implemented with TelosB motes, CASN can be easily deployed in a cluster, with sensor nodes attached in an ad hoc manner to servers, and provides key system functions including cluster-wide command dissemination and verification of physical presence. Experimental results show that CASN has 85% success rate in verifying physical locations of servers with coarse-grained localization when the threshold is 3 meters, and incurs small latency in cluster-wide command dissemination.
Ke Hong, Zhiqiang Ma 0002, Lin Gu 0001
MASS3
2012 DVM: towards a datacenter-scale virtual machine
abstract
As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenter-scale programming has become an imperative research agenda. Many cloud systems use existing virtual machine monitor (VMM) technologies, such as Xen, VMware, and Windows Hypervisor, to multiplex a physical host into multiple virtual hosts and isolate computation on the shared cluster platform. However, traditional multiplexing VMMs do not scale beyond one single physical host, and it alone cannot provide the programming interface and cluster-wide computation that a datacenter system requires. We design a new instruction set architecture, DISA, to unify myriads of compute nodes to form a big virtual machine called DVM, and present programmers the view of a single computer where thousands of tasks run concurrently in a large, unified, and snapshotted memory space. The DVM provides a simple yet scalable programming model and mitigates the scalability bottleneck of traditional distributed shared memory systems. Along with an efficient execution engine, the capacity of a DVM can scale up to support large clusters. We have implemented and tested DVM on three platforms, and our evaluation shows that DVM has excellent performance in terms of execution time and speedup. On one physical host, the system overhead of DVM is comparable to that of traditional VMMs. On 16 physical hosts, the DVM runs 10 times faster than MapReduce/Hadoop and X10. On 256 EC2 instances, DVM shows linear speedup on a parallelizable workload.
Zhiqiang Ma 0002, Zhonghua Sheng, Lin Gu 0001, Liufei Wen
VEE1