检索结果-内蒙古大学图书馆

作者： Lu, Kai Zhou, Xu Bergan, Tom Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China University of Washington Computer Science and Engineering United States

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 16 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Pruning false positives of static data-race detection via thread specialization

Pruning false positives of static data-race detection via th...

引用

10th International Symposium on Advanced parallel processing Technologies, APPT 2013

作者： Chen, Chen Lu, Kai Wang, Xiaoping Zhou, Xu Fang, Li National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China Information Center National University of Defense Technology Changsha China

ISBN: (纸本)9783642452925

Static data-race detection is a powerful tool by providing clues for dynamic approaches to only instrument certain memory accesses. However, static data-race analysis suffers from high false positive rate. A key reason is that static analysis overestimates the set of shared objects a thread can access. We propose thread specialization to distinguish threads statically. By fixing the number of threads as well as the ID assigned to each thread, a program can be transformed to a simplified version. Static data-race analysis on this simplified program can infer the range of addresses accessed by each thread more accurately. Our approach prunes false positives by an average of 89.2% and reduces dynamic instrumentation by an average of 63.4% in seven benchmarks. © 2013 Springer-Verlag.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Prediction-based federated management of multi-scale resources in cloud

引用

Advances in Information Sciences and Service Sciences 2012年第6期4卷 324-334页

作者： Shi, Peichang Wang, Huaimin Yin, Gang Lu, Fengshun Wang, Tianzuo National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China

The connotation of the cloud resources have been extended to be multi-scale resources, which includes central resources as presented by data center, edge resources as presented by Content Delivery Network (CDN) and end resources as presented by Peer-to-Peer (P2P). Under the development situation of the scale of the cloud services, it is difficult to provide services (e.g. streaming distribution) with guaranteed QoS only relying on single type of resource (e.g. central resources) to geo-distributed users. Therefore, making multi-resources cooperative to provide reliable services is necessary. However, it is a great challenge to realize Federated Management of Multi-scale Resources (FMMR). In this research, we propose the idea of prediction-based FMMR, and present the problem formulation introducing economic profit from the perspective of CDN operators. Then, we present the method of Time-series Prediction based on Wavelet Analysis (TPWA) to predict the resource requirements of streaming cloud services in CDN. Finally, the predictability of the resource requirement pattern of the streaming cloud service and the effectiveness of our proposed method have been verified, based on the traces collected from a real CDN entity.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Symbolic Model Checking APSL

Symbolic Model Checking APSL

引用

第二届IFIP/IEEE软件工程理论基础国际研讨会(TASE 2008)(Second IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering)

作者： Wanwei Liu Ji Wang Huowang Chen Xiaodong Ma National Laboratory for Parallel and Distributed Processing School of computer National University of Defense Technology China

PSL is a kind of temporal logic which uses SEREs as additional formula constructs. We present a variant of PSL, namely APSL, which replaces SEREs with finite automata. APSL and PSL are of the exactly same expressiveness. In this paper, we extend the LTL symbolic model checking algorithm to that of APSL, and present a tableau based APSL verification approach. Moreover, we show how to implement this algorithm via the BDD based symbolic approach.

关键词： Automata Logic Data structures Boolean functions Binary decision diagrams Software engineering Laboratories distributed processing Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Partial Clones for Stragglers in MapReduce

Partial Clones for Stragglers in MapReduce

引用

International Conference of Young computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Jia Li Changjian Wang Dongsheng Li Zhen Huang National Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

Stragglers can temporize jobs and reduce cluster efficiency *** researches have been contributed to the solution,such as Blacklist[8],speculative execution[1,6],Dolly[8].In this paper,we put forward a new approach for mitigating stragglers in Map Reduce,name *** starts task clones only for high-risk delaying *** experiments have been carried and results show that it can decrease the job delaying risk with fewer resources *** small jobs,Hummer also improves job completion time by 48% and 10% compared to LATE and Dolly.

关键词： MapReduce mitigating stragglers task clones

来源：评论

学校读者我要写书评

暂无评论

A framework for constructing peer-to-peer overlay networks in java 09

A framework for constructing peer-to-peer overlay networks i...

引用

7th International Conference on Principles and Practice of Programming in Java, PPPJ 2009

作者： Rui, Shen Ji, Wang Shengdong, Zhang Siqi, Shen Pei, Fan National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Computing University of Leeds Leeds LS2 9JT United Kingdom

ISBN: (纸本)9781605585987

Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide key-based routing capabilities to eliminate flooding in unstructured ones. Many overlay network protocols have been proposed to organize peers into various topologies with emphasis on different networking properties. However, applications are often stuck to a specific peer-to-peer overlay network implementation, because different overlay implementations usually provide very different interfaces and messaging mechanisms. In this paper, we present a framework for constructing peer-to-peer overlay networks in Java. First, networking is abstracted by the interfaces that use URIs to uniformly address peers on different underlying or overlay networks. Then, asynchronous and synchronous messaging support is built upon these interfaces. Finally, overlay networking interfaces are sketched to handle specific issues in overlay networks. We have constructed several overlay networks in this framework, and built peer-to-peer applications which are independent of overlay implementations. Copyright 2009 ACM.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Fine-grained checkpoint based on non-volatile memory

引用

Frontiers of Information Technology & Electronic Engineering 2017年第2期18卷 220-234页

作者： Wen-zhe ZHANG Kai LU Mikel LUJAN Xiao-ping WANG Xu ZHOU Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha 410072 China School of Computer The University of Manchester Manchester M13 9PL UK

New non-volatile memory （e.g., phase-change memory） provides fast access, large capacity, byteaddressability, and non-volatility features. These features, fast-byte-persistency, will bring new opportunities to fault tolerance. We propose a fine-grained checkpoint based on non-volatile memory. We extend the current virtual memory manager to manage non-volatile memory, and design a persistent heap with support for fast allocation and checkpointing of persistent objects. To achieve a fine-grained checkpoint, we scatter objects across virtual pages and rely on hardware page-protection to monitor the modifications. In our system, two objects in different virtual pages may reside on the same physical page. Modifying one object would not interfere with the other object. This allows us to monitor and checkpoint objects smaller than 4096 bytes in a fine-grained way. Compared with previous page-grained based checkpoint mechanisms, our new checkpoint method can greatly reduce the data copied at checkpoint time and better leverage the limited bandwidth of non-volatile memory.

关键词： Non-volatile memory Byte-persistency Persistent heap Fine-grained checkpoint

来源：评论

学校读者我要写书评

暂无评论

The parallelized Cuckoo Filter for Cold Data Representation 23

The Parallelized Cuckoo Filter for Cold Data Representation

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Sun, Bowen Luo, Lailong Li, Shangsen Chen, Yingwen Guo, Deke College of Computer National University of Defense Technology China National University of Defense Technology Science and Technology on Information Systems Engineering Laboratory China College of Computer National University of Defense Technology National Lab for Parallel and Distributed Processing China

ISBN: (纸本)9781665494571

Cold data contributes a large portion of the big data today and is usually stored in secondary storage. Various sketch data structures are implemented to represent the stored elements and provide constant-time membership queries. Considering the large volume and infrequent access of cold data, we envision three rationales of cold data representation: 1) parallelized insertion, 2) accurate representation, and 3) constant-time query/deletion. The existing sketches, however, fail to achieve these rationales simultaneously. To this end, we propose a novel sketch named parallelized cuckoo Filter (PCF) in this paper. PCF divides the standard cuckoo filter into multiple homogenous segments. An additional hash function is introduced to assign an element to a segment. The element will be inserted into the selected segment. With such a design, element insertions in PCF can be naturally parallelized. Besides, as a variant of the cuckoo filter, PCF naturally realizes the accurate representation and constant-time query/deletion requirements. Comprehensive experiments further indicate that PCF achieves the three rationales simultaneously. © 2021 IEEE.

关键词： Hash functions Smart cities Big Data Data structures Standards

来源：评论

学校读者我要写书评

暂无评论

Topology-aware deployment of scientific applications in cloud computing

Topology-aware deployment of scientific applications in clou...

引用

2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012

作者： Fan, Pei Chen, Zhenbang Wang, Ji Zheng, Zibin Lyu, Michael R. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769547558

Nowadays, more and more scientific applications are moving to cloud computing. The optimal deployment of scientific applications is critical for providing good services to users. Scientific applications are usually topology-aware applications. Therefore, considering the topology of a scientific application during the development will benefit the performance of the application. However, it is challenging to automatically discover and make use of the communication pattern of a scientific application while deploying the application on cloud. To attack this challenge, in this paper, we propose a framework to discover the communication topology of a scientific application by pre-execution and multi-scale graph clustering, based on which the deployment can be optimized. Comprehensive experiments are conducted by employing a well-known MPI benchmark and comparing the performance of our method with those of other methods. The experimental results show the effectiveness of our topology-aware deployment method. © 2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A wikipedia based semantic graph model for topic tracking in blogosphere

A wikipedia based semantic graph model for topic tracking in...

引用

22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

作者： Tang, Jintao Wang, Ting Lu, Qin Wang, Ji Li, Wenjie College of Computer National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)9781577355120

There are two key issues for information diffusion in blogosphere: (1) blog posts are usually short, noisy and contain multiple themes, (2) information diffusion through blogosphere is primarily driven by the "word-of- mouth" effect, thus making topics evolve very fast. This paper presents a novel topic tracking approach to deal with these issues by modeling a topic as a semantic graph, in which the semantic relatedness between terms are learned from Wikipedia. For a given topic/post, the name entities, Wikipedia concepts, and the semantic relatedness are extracted to generate the graph model. Noises are filtered out through the graph clustering algorithm. To handle topic evolution, the topic model is enriched by using Wikipedia as background knowledge. Furthermore, graph edit distance is used to measure the similarity between a topic and its posts. The proposed method is tested by using the real-world blog data. Experimental results show the advantage of the proposed method on tracking the topic in short, noisy texts.

关键词： Blogs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：