Mingzhu Deng

  • Citations Per Year
Learn More
The non-volatile memory (NVM) has the illustrious merits of byte-addressability, fast speed, persistency and low power consumption, which make it attractive to be used as main memory. Commonly, user process dynamically acquires memory through memory allocators. However, traditional memory allocators designed with in-place data writes are not appropriate for(More)
The non-volatile memory (NVM) has the merits of byte-addressability, fast speed, persistency and low power consumption, which make it attractive to be used as main memory. Commonly, user process dynamically acquires memory through memory allocators. However, traditional memory allocators designed with in-place data writes are not appropriate for the(More)
Deduplication serves as a fundamental way to eliminate replicas and save space and network bandwidth in various storage systems. However, the performance of most existing deduplication systems can be further improved on normal reads, which carry crucial weight in currently popular WORM access model. Specifically, most existing deduplication systems achieve(More)
Data continues to explode exponentially in big data era, making the 3-replication scheme unaffordably expensive and space-consuming for a storage system. To this end, erasure code schemes prevail by offering the same or higher reliability at a relatively lower spatial cost. In this paper, an overview of up-to-date research work of erasure codes in big data(More)
In recent years, many efforts have been done in the quest of digital city construction. In this paper, we attempt to realize our thought of a digital city presentation system based on some city of China. In our system, where two-dimensional topic map services and three-dimensional scenes are provided through WMS (web map service) with the help of City Maker(More)
Modern storage systems call for higher reliability care beyond RAID-6 against ever-increasing data failures. And no code extension exist based on X-code, which is noted for vertical alignment and optimal update complexity. In order to construct flexible and practically reliable codes, we argue that failures happen successively and higher-level failures can(More)
Fast independent component analysis (Fast ICA) for hyper spectral image dimensionality reduction is computationally complex and time-consuming due to the high dimensionality of hyper spectral images. By analyzing the Fast ICA algorithm, we design parallel schemes for covariance matrix calculating, white processing and ICA iteration at three parallel levels:(More)