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

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Efficient semantic-aware coflow scheduling for data-parallel jobs

Efficient semantic-aware coflow scheduling for data-parallel...

引用

IEEE International Conference on Cluster Computing

作者： Ziyang Li Yiming Zhang Yunxiang Zhao Dongsheng Li National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (纸本)9781509036547

This paper studies the communication pattern of data-parallel applications from the perspective of job execution, and discovers multiple inter-coflow dependencies. These inter-coflow dependencies, collectively named as semantic flow (seflow), can expose job-level semantics. It is observed that most distributed computing frameworks describe their job execution as directed acyclic graphs (DAG). So a seflow comprises not only all the coflows of a job but also the DAG-based relationship between them. Seflow, coflow and flow can be viewed as the top-down abstractions for communication of jobs.

关键词： Semantics distributed computing Sparks Scheduling algorithms Scheduling Schedules

来源：评论

学校读者我要写书评

暂无评论

An Improved Independent Set Ordering Algorithm for Solving Large-scale Sparse Linear Systems

An Improved Independent Set Ordering Algorithm for Solving L...

引用

2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics(第二届智能人机系统与控制论国际学术会议 IHMSC 2010)

作者： Lu Yao Wei Cao Zongzhe Li Yongxian Wang Zhenghua Wang National Key Lab for Parallel and Distributed Processing National Univ.of Defense TechnologyChangshaChina

The independent set ordering algorithm is a heuristic algorithm based on finding maximal independent sets of vertices in the matrix adjacency graph, which is commonly used for parallel matrix factorization. However, Disadvantages appear when it is applied to large-scale sparse linear systems. In this paper, we propose an improved algorithm by finding an optimal size of independent set in each elimination step rather than find a maximal independent set, which is proved to be effective by both theoretical analysis and parallel implementation.

关键词： independent set parallel LU decomposition large-scale sparse linear systems matrix ordering

来源：评论

学校读者我要写书评

暂无评论

Research on Integrated Detection of SQL Injection Behavior Based on Text Features and Traffic Features 10th

Research on Integrated Detection of SQL Injection Behavior B...

引用

10th International Conference on Computer Engineering and Networks, CENet 2020

作者： Li, Ming Liu, Bo Xing, Guangsheng Wang, Xiaodong Wang, Zhihui College of Intelligence Science and Technology National University of Defence Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology Changsha410073 China

ISBN: (纸本)9789811584619

With the rapid development of Internet technology, various network attack methods come out one after the other. SQL injection has become one of the most severe threats to Web applications and seriously threatens various Web application services and users data security. There are both traditional detection methods and emerging methods based on deep learning technology with higher detection accuracy for the detection of SQL injection. However, they are all for detecting a single statement and cannot determine the stage of the attack. To further improve the effect of SQL injection detection, this paper proposes an integrated detection framework for SQL injection behavior based on both text features and traffic features. We propose a SQL-LSTM model based on deep learning technology as the detection model at the text features level. Meanwhile, the features of the data traffic are merged. By this integrated method, the detection effect of SQL injection is further improved. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

DMSA: Decentralized and Multi-keyword Selective Data Sharing and Acquisition 22

DMSA: Decentralized and Multi-keyword Selective Data Sharing...

引用

22nd IEEE International Symposium on parallel and distributed processing with Applications, ISPA 2024

作者： Lin, Moheng Shi, Peichang Fu, Xiang Jiang, Feng Yi, Guodong National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Changsha410073 China Xiangjiang Lab Changsha410073 China

ISBN: (纸本)9798331509712

Blockchain technology has been extensively uti-lized in decentralized data-sharing applications, with the immutability of blockchain providing a witness for the circulation of data. However, current blockchain data-sharing solutions still fail to address the simultaneous screening needs of both the sender and receiver with multi-keywords. Without the capability to support bilateral simultaneous filtering, the disclosure of reasons for matching failures could inadvertently expose sensitive user data. Therefore, the challenge lies in enabling ciphertexts with multiple keywords and receivers with multiple interests to achieve mutual and simultaneous matching. Based on the technical foundations of SE (Searchable Encryption), MABE (Multi-Attribute Based Encryption), and polynomial fitting, this paper proposes a scheme called DMSA (Decentralized and Multi-keyword selective Sharing and selective Acquisition). This scheme can satisfy soundness, enabling ciphertexts carrying multiple keywords and receivers representing multiple interests to match each other simultaneously. We conducted a security analysis that confirms the security of DMSA against chosen-plaintext attacks. Our experimental results demonstrate a significant efficiency improvement, with a 67% increase over single-keyword data-sharing schemes and a 16% enhancement compared to the existing multi-keyword data-sharing solution. © 2024 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of parallel Prefix Adders in FPGA Implementation of EAC

A Comparative Study of Parallel Prefix Adders in FPGA Implem...

引用

12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools

作者： Liu, Feng Fariborz, F. F. Mohamed, Otmane Ait Chen, Gang Song, Xiaoyu Tan, Qingping National Lab. of Parallel Distributed Processing Hunan China ECE Department Concordia University Montreal QC Canada Lingcore Lab. Portland OR United States ECE Department Portland State University Portland OR United States

ISBN: (纸本)9780769537825

Several regular parallel trees have been proposed over the years to optimize logic depth, area, fan-out and interconnect count for logic circuits. In this paper, we propose a comparative study of different parallel prefix trees used in the design of a new end-around carry (EAC) adder targeting FPGA technology. This new adder is based on the fast 128-bit binary floating-point EAC adder which has been implemented in the IBM POWER6 microprocessor's fused multiply-add unit. The parallel prefix tree implemented on the IBM's EAC adder is a Kogge-Stone tree which has been chosen for its high performance and its low power consumption. Our comparative study highlights the main performance differences among fourteen different architecture configurations when targeting an FPGA EAC adder design. We focus on the area requirements and the critical path delay of these designs. Our experimental results show that there is one architecture configuration with the lower area requirement and the higher performance.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

Using redundant threads for fault tolerance of OpenMP programs

Using redundant threads for fault tolerance of OpenMP progra...

引用

2010 International Conference in Information Science and Applications, ICISA 2010

作者： Fu, Hongyi Ding, Yan Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defence Tech. Changsha Hunan 410073 China School of Computer National University of Defence Tech. Changsha Hunan 410073 China

ISBN: (纸本)9781424459438

As the wide application of multi-core processor architecture in the domain of high performance computing, fault tolerance for shared memory parallel programs becomes a hot spot of research. For years, checkpointing has been the dominant fault tolerance technology in this field, and recently, many research works have been engaged with it. However, to those programs which deal with large amount of data, checkpointing may induce massive I/O transfer, which will adversely affect scalability. To deal with such a problem, this paper proposes a fault tolerance approach, making use of redundancy, for shared memory parallel programs. Our scheme avoids saving and restoring computational state during the program's execution, hence does not involve I/O operations, so presents explicit advantage over checkpointing in scalability. In this paper, we introduce our approach and the related compiler tool in detail, and give the experimental evaluation result. ©2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

CoCache: Multi-layer Multi-path Cooperative Cache Accelerating the Deployment of Large Scale Virtual Machines

CoCache: Multi-layer Multi-path Cooperative Cache Accelerati...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Ziyang Li Zhaoning Zhang Huiba Li Yuxing Peng National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China

By analyzing the problems and challenges of virtual machine image store system in cloud computing environment, we present a cooperative persistent cache (CoCache) for virtual disks. CoCache takes advantage of the service ability of the cached nodes by providing virtual image data service for other nodes. CoCache can transfer data between nodes in a P2P pattern, for extending data service ability of the system. CoCache is realized in the kernel space of Linux, can support any kind of VMM. Experiments show that CoCache can effectively reduce the cost during virtual machines read data, and promote the service ability of virtual machine storage system. Layer-aware cache policy is proposed specially for improving cache hit rate in the multi-layer and multipath environment.

关键词： Virtual machining Servers Image storage Cloud computing Computer architecture System performance Cache storage

来源：评论

学校读者我要写书评

暂无评论

A hybrid multicasting for large-scale data dissemination applications

A hybrid multicasting for large-scale data dissemination app...

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Hairong Zhong Xiaojian Liu Shiyao Jin National Lab for Parallel & Distributed Processing National University of Defense Technology Hunan Province China National Lab for Parallel & Distributed Processing National University of Defense Technology Changsha Hunan Province China

ISBN: (纸本)0780382730

Large-scale data dissemination applications, which need large numbers of multicast groups to filter information, were often restricted by the poor support of the relevant network routers. So we proposed hybrid multicasting (HM), which could take the advantage of IP multicasting, and was not limited by the network routers at the same time. Compared with other one-to-many data transfer methods, such as duplicate unicasting, broadcasting and IP multicasting, HM could exploit the capabilities and behavior of the underlying communication network and provided better performance. Basing on the application characteristics, we gave some theorems to guide how to select transfer methods, and presented a new data dissemination allocation algorithm, information Flow Merge with the Hybrid Multicasting First (FM/HMF). Tests showed that FM/HMF could produce better outcome and executes faster than nowadays-prevalent IP multicast group allocation strategies.

关键词： Large-scale systems Application software Broadcasting Filters Multicast algorithms Testing Bandwidth distributed processing Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Merge-Weighted Dynamic Time Warping for Speech Recognition

引用

Journal of Computer Science & Technology 2014年第6期29卷 1072-1082页

作者：张湘莉兰骆志刚李明 State Key Laboratory of Pathogen and Biosecurity Beijing Institute of Microbiology and Epidemiology Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology David R.Cheriton School of Computer Science University of WaterlooWaterlooOntario N2L 3G1Canada ACM IEEE

Obtaining training material for rarely used English words and common given names from countries where English is not spoken is difficult due to excessive time, storage and cost factors. By considering personal privacy, language- independent （LI） with lightweight speaker-dependent （SD） automatic speech recognition （ASR） is a convenient option to solve tile problem. The dynamic time warping （DTW） algorithm is the state-of-the-art algorithm for small-footprint SD ASR for real-time applications with limited storage and small vocabularies. These applications include voice dialing on mobile devices, menu-driven recognition, and voice control on vehicles and robotics. However, traditional DTW has several lhnitations, such as high computational complexity, constraint induced coarse approximation, and inaccuracy problems. In this paper, we introduce the merge-weighted dynamic time warping （MWDTW） algorithm. This method defines a template confidence index for measuring the similarity between merged training data and testing data, while following the core DTW process. MWDTW is simple, efficient, and easy to implement. With extensive experiments on three representative SD speech recognition datasets, we demonstrate that our method outperforms DTW, DTW on merged speech data, the hidden Markov model （HMM） significantly, and is also six times faster than DTW overall.

关键词： merge-weighted dynamic time warping natural language processing speech recognition and synthesis tem-plate confidence index

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：