|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | DMM:A dynamic memory mapping model for virtual machines显示文摘Memory virtualization is an important part in the design of virtual machine monitors(VMM).In this paper,we proposed dynamic memory mapping(DMM) model,a mechanism that allows the VMM to change the mapping between a virtual machine's physical memory and the underlying hardware resource while the virtual machine is running.By utilizing DMM,the VMM can implement many novel memory management policies,such as Demand Paging,Swapping,Ballooning,Memory Sharing and Copy-On-Write,while preserving compatibility with various architectures.The modular and hierarchical property of the DMM model efficiently incorporates the high-level policies and the low-level implementations,leading to a feature-adjustable VMM design.We presented the principle of the DMM model,and explained the procedures of various memory management policies under this model.Also,we implement the DMM model in KVM,an open source VMM.Our evaluation shows that the DMM model is efficient enough to provide the benefits of dynamic memory resource management with little performance impact. | CHEN HaoGang WANG XiaoLin WANG ZhenLin ZHANG BinBin LUO YingWei LI XiaoMing | 2010 | Science China(Information Sciences)2010，53，6： | 11 |
| 2 | A model for predicting bubble rise velocity in a pulsed gas solid fluidized bed显示文摘Bed stability, and especially the bed density distribution, is affected by the behavior of bubbles in a gas solid fluidized bed. Bubble rise velocity in a pulsed gas-solid fluidized bed was studied using photographic and computational fluid dynamics methods. The variation in bubble rise velocity was investigated as a function of the periodic pulsed air flow. A predictive model of bubble rise velocity was derived: ub=ψ(Ut+Up-Umf)+kp(gdb)(1/2). The software of Origin was used to fit the empirical coefficients to give ψ = 0.4807 and kp = 0.1305. Experimental verification of the simulations shows that the regular change in bubble rise velocity is accurately described by the model. The correlation coefficient was 0.9905 for the simulations and 0.9706 for the experiments. | Dong Liang Zhao Yuemin Luo Zhenfu Duan Chenlong Wang Yingwei Yang Xuliang Zhang Bo | 2013 | International Journal of Mining Science and Technology2013，23，2： | 4 |
| 3 | Dynamic memory paravirtualization transparent to guest OS显示文摘This paper introduces dynamic paravirtualization, which imitates paravirtualization and aims at reducing VM exits of full virtualization with hardware support. In dynamic paravirtualization, VMM (virtual machine monitor) dynamically monitors and replaces the hot instructions, which cause most VM exits. It is transparent to the guest OS such that the legacy OSes can benefit from this optimization. Our study focuses on reducing the overhead of memory virtualization-dynamic memory paravirtualization (DMP). We implant a new memory management mechanism in VMM such that all user-mode page faults can be handled by the guest OS directly without VM exits. We implement a prototype of dynamic memory paravirtulization based on a version of KVM using Intel VT. Our experimental results show that our technique essentially eliminates the overhead of VM exits caused by page faults. Dynamic memory paravirtualization can achieve the effectiveness of paravirtualization without changing the source code of guest OS. | WANG XiaoLin SUN YiFeng LUO YingWei WANG ZhenLin LI Yu ZHANG BinBin CHEN HaoGang LI XiaoMing | 2010 | Science China(Information Sciences)2010，53，1： | 4 |
| 4 | Dynamic cache partitioning based on hot page migration显示文摘静态的缓存划分能减少内部申请的缓存干扰并且当他们在在一样的多核心处理器分享最后水平缓存的核心上运行时,改进一个弄脏缓存的应用程序和一个缓存敏感的应用程序的合成性能。在一个虚拟化的系统,自从不同应用程序可能在不同时间在不同虚拟机(VM ) 上运行,预先静态地划分缓存是不适用的。这份报纸建议划分使用热页察觉和页移植根据缓存敏感的应用程序的优先的知识动态地改进共同招待的虚拟机的合成表演的计划的动态缓存。,试验性的结果在大多数情况中证明我们的页移植计划的开销是低的,合成性能是在免费作文上的改进。 | Xiaolin WANG Xiang WEN Yechen LI Zhenlin WANG Yingwei LUO Xiaoming LI | 2012 | Frontiers of Computer Science2012，6，4： | 2 |
| 5 | A study on GML-based ubiquitous WebGIS 显示文摘 | Luo Yingwei Wang Xiaolin Xu Zhuoqun | 2001 | Journal of South China Normal University ( Natural Science Edition)2001，，： | 1 |
| 6 | QoS Analysis on Web Service Based Spatial Integration显示文摘 | Yingwei Luo Xinpeng Liu Wenjun Wang Xiaolin Wang Zhuoqun Xu | 2005 | 通讯和计算机(中英文版)2005，2，7： | 1 |
| 7 | Mapping business workflows onto network services environments显示文摘 | WANG Wenjun LIU Xinpeng LUO Yingwei | 2004 | Lecture Notes in Computer Science2004，，3251： | 1 |
| 8 | Mapping Business Workflows onto Network Services Environment显示文摘 | WANG Wenjun LUO Yingwei LIU Xinpeng WANG Xiaolin XU Zhuoqun | 2005 | 通讯和计算机(中英文版)2005，2，1： | 0 |
| 9 | Evaluating the impacts of hugepage on virtual machines显示文摘Modern applications often require a large amount of memory. Conventional 4KB pages lead to large page tables and thus exert high pressure on TLB address translations. This pressure is more prominent in a virtualized system, which adds an additional layer of address translation. Page walks due to TLB misses can result in a significant performance overhead. One effort in reducing this overhead is to use hugepage. Linux kernel has supported transparent hugepage since 2.6.38, which provides an alternate large page size. Generally,hugepage demonstrates better performance on address translations and page table modifications. This paper first analyzes the impact of hugepage on native system, and then, compares the impact of hugepage on different memory virtualization approaches: hardware-assisted paging(HAP), shadow paging, and para-virtualization.We observe that the current implementation of transparent hugepage is inefficient. It cannot exploit the full performance advantage of hugepages. Worse yet, the conservative strategy of transparent hugepage may conflict with existing OS functions, which can lead to performance degradation. So, we propose a new memory allocation strategy, alignment-based hugepage(ABH) that promotes hugepage allocations. We apply ABH to different paging modes in virtualized systems. The results show that the new allocation strategy can significantly reduce TLB misses and up to 90% page walk cycles due to TLB misses and thus improve the performance in real world applications. | Xiaolin WANG Taowei LUO Jingyuan HU Zhenlin WANG Yingwei LUO | 2017 | Science China(Information Sciences)2017，60，1： | 0 |
| 10 | Learning to Combine Answer Boundary Detection and Answer Re-ranking for Phrase-Indexed Question Answering显示文摘Phrase-indexed question answering(PIQA)seeks to improve the inference speed of question answering(QA)models by enforcing complete independence of the document encoder from the question encoder,and it shows that the constrained model can achieve significant efficiency at the cost of its accuracy.In this paper,we aim to build a model under the PIQA constraint while reducing its accuracy gap with the unconstrained QA models.We propose a novel framework-AnsDR,which consists of an answer boundary detector(AnsD)and an answer candidate ranker(AnsR).More specifically,AnsD is a QA model under the PIQA architecture and it is designed to identify the rough answer boundaries;and AnsR is a lightweight ranking model to finely rerank the potential candidates without losing the efficiency.We perform the extensive experiments on public datasets.The experimental results show that the proposed method achieves the state of the art on the PIQA task. | WEN Liang SHI Haibo ZHANG Xiaodong SUN Xin WEI Xiaochi WANG Junfeng CHENG Zhicong YIN Dawei WANG Xiaolin LUO Yingwei WANG Houfeng | 2022 | Chinese Journal of Electronics2022，31，5： | 0 |
| 11 | Dynamic memory mapping delivers additional flexibility to virtual resource management显示文摘The Department of Computer Science and Technology, Peking University, Beijing, China, has shown that a novel Dynamic Memory Map-ping (DMM) model brings about additional flexibility to virtual resource management, leading to the feature-adjustable design of a virtual machine monitor (VMM). The study is reported in Issue 53 (June, 2010) of SCIENCE CHINA Information Sciences because of its signifi-cant research value. | WANG XiaoLin LUO YingWei | 2010 | Chinese Science Bulletin2010，55，26： | 0 |
| 12 | Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores显示文摘Graph databases have gained widespread adoption in various industries and have been utilized in a range of applications,including financial risk assessment,commodity recommendation,and data lineage tracking.While the principles and design of these databases have been the subject of some investigation,there remains a lack of comprehensive examination of aspects such as storage layout,query language,and deployment.The present study focuses on the design and implementation of graph storage layout,with a particular emphasis on tree-structured key-value stores.We also examine different design choices in the graph storage layer and present our findings through the development of TuGraph,a highly efficient single-machine graph database that significantly outperforms well-known Graph DataBase Management System(GDBMS).Additionally,TuGraph demonstrates superior performance in the Linked Data Benchmark Council(LDBC)Social Network Benchmark(SNB)interactive benchmark. | Heng Lin Zhiyong Wang Shipeng Qi Xiaowei Zhu Chuntao Hong Wenguang Chen Yingwei Luo | 2024 | Big Data Mining and Analytics2024，7，1： | 0 |
| 13 | Investigation of a special neutralizing epitope of HEV E2s显示文摘亲爱的编辑 | Min You Lu Xin Yi Yang Xiao Zhang Yingwei Chen Hai Yu Shaowei Li Jun Zhang Zhiqiang An Wenxin Luo Ningshao Xia | 2014 | Protein & Cell2014，5，12： | 0 |
| 14 | A survey of cloud resource management for complex engineering applications显示文摘 | Haibao CHEN Song WU Hai JIN Wenguang CHEN Jidong ZHAI Yingwei LUO Xiaolin WANG | 2016 | Frontiers of Computer Science2016，10，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员