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

15th IEEE Int Conf on Trust, Security and Privacy in Comp and Commun / 10th IEEE Int Conf on Big Data Science and Engineering / 14th IEEE Int Symposium on parallel and distributed proc with Applicat (IEEE Trustcom/BigDataSE/ISPA)

作者： Pei, Xiaoqiang Wang, Yijie Ma, Xingkong Xu, Fangliang Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Coll Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509032051

distributed storage systems usually adopt erasure codes to ensure the data reliability due to the better space efficiency and higher reliability. However, existing data insertion schemes for erasure codes are not appropriate for the continuous online data due to bottleneck of the centralized insertion schemes and the low efficiency of the decentralized insertion schemes. In this paper, we propose a pipelined online data insertion scheme based on the distributed storage systems with erasure codes, called POIS. For efficiency, we propose a distance-aware node selection technique to improve the transmission efficiency by selecting the nodes with the higher available bandwidth. Moreover, we propose a distributed data processing technique to maximize the encoding efficiency by pipelining the data transmission and distributing the encoding operations. For adaptivity, we propose a rollback-based failure processing technique to handle the node failure during the insertion process. To evaluate the performance of POIS, we conduct experiments on HDFS-RAID under various parameter settings on 200 virtual machines. Extensive experiments confirm that POIS improves the insertion throughput, adaptively adjusts the insertion process by handling the node failure during insertion and significantly outperforms the state-of-the art approaches under various parameter settings.

关键词： distributed storage systems Erasure codes Online Pipeline Data insertion

来源：评论

学校读者我要写书评

暂无评论

A 60Gbps DPI Prototype based on Memory-Centric FPGA 16

A 60Gbps DPI Prototype based on Memory-Centric FPGA

引用

ACM Conference on Special Interest Group on Data Communication (SIGCOMM)

作者： Su, Jinshu Chen, Shuhui Han, Biao Xu, Chengcheng Wang, Xin Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781450341936

Deep packet inspection (DPI) is widely used in content aware network applications to detect string features. It is of vital importance to improve the DPI performance due to the ever-increasing link speed. In this demo, we propose a novel DPI architecture with a hierarchy memory structure and parallel matching engines based on memory-centric FPGA. The implemented DPI prototype is able to provide up to 60Gbps full-text string matching throughput and fast rules update speed.

关键词： DPI string matching hierarchical memory

来源：评论

学校读者我要写书评

暂无评论

An escrow-free online/offline HIBS scheme for privacy protection of people-centric sensing

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第14期9卷 2302-2312页

作者： Chen, Peixin Su, Jinshu Zhao, Baokang Wang, Xiaofeng You, Ilsun Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China Soonchunhyang Univ Dept Informat Secur Engn Asan South Korea

People-centric sensing (PCS), which collects information closely related to human activity and interactions in societies, is stepping into a flourishing time. Along with its great benefits, PCS poses new security challenges such as data integrity and participant privacy. Hierarchical identity-based signature (HIBS) scheme can efficiently provide high-integrity messaging, secure communication, and privacy protection to PCS. However, key escrow problem and low computation efficiency primarily hinder the adoption of HIBS scheme. In this paper, we propose an escrow-free online/offline HIBS scheme for securing PCS. By utilizing user-selected-secret signing algorithm and splitting the signing phase into online and offline procedures, our scheme solves the key escrow problem and achieves high scheme performance. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： Internet of things people-centric sensing hierarchical identity-based signature online offline signature key escrow problem

来源：评论

学校读者我要写书评

暂无评论

A Cluster Based Approach for Task Scheduling Across Multiple Programming Systems 15

A Cluster Based Approach for Task Scheduling Across Multiple...

引用

15th International Symposium on parallel and distributed Computing (ISPDC)

作者： Lu, Hongliang Cao, Jiannong Chawla, Shailey Wang, Yuqi Lv, Saohe Wang, Xiaodong Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha Hunan Peoples R China Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781509041527

As the data processing demands have been increasing, different types of data processing systems are being developed. The new programming systems have different characteristics like types of data handled, processing technique and performance. However, multiple new systems have introduced difficulties for non-expert users like choosing the right system and usage methodology of the new systems. In order to relieve the burden of common users of conducting data processing tasks and taking relevant advantage of the systems features, we intend to integrate the popular programming systems and provide more efficient data processing services. In this paper, we propose to address the task scheduling problem for integrating multiple programming systems. We have designed a cluster based approach for task scheduling across multiple programming systems. This approach helps in minimizing the makespan of workilows and resource consumption. The simulation results show that the proposed approach can reduce the resource consumption significantly while achieving a low makespan for the workfiows.

关键词： big data task scheduling data processing systems cluster based genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

EmSBoT: A Lightweight Modular Software Framework for Networked Robotic Systems 3

EmSBoT: A Lightweight Modular Software Framework for Network...

引用

3rd International Conference on Advances in Computational Tools for Engineering Applications (ACTEA)

作者： Peng, Long Guan, Fei Perneel, Luc Fayyad-Kazan, Hasan Timmerman, Martin Vrije Univ Brussel Dept Elect & Informat Pleinlaan 2 B-1050 Brussels Belgium Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781467385237

Developing applications for modern complex networked robotic systems is more challenging due to the introduction of possibly sophisticated communication and coordination aspects. In this paper, we propose EmSBoT, a lightweight embedded component-based software framework targeting resource-constrained networked robotic systems. EmSBoT provides a unified Application Program Interface (API) that hides the heterogeneous distributed environment from applications. Its OS abstraction layer endows it with OS independence and portability. A port-based communication mechanism is adopted to exchange message between loosely coupled components, making the system with fault-tolerance capability. By isolating the communication channels as separate agents, the framework provides uniform and transparent message-passing for agents over node boundaries. We describe the architecture, programming model and core features of EmSBoT in this paper, together with the performance evaluation and behavior validation to demonstrate its efficiency and feasibility.

关键词： Robotic Software Framework Networked Robotic System Real-time EmSBoT

来源：评论

学校读者我要写书评

暂无评论

Tendency-Based Caching in Content-Centric Networking 8

Tendency-Based Caching in Content-Centric Networking

引用

8th International Conference on Ubiquitous and Future Networks (ICUFN)

作者： Xia, YuSheng Liu, YaPing Su, JinShu Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781467399913

In content-centric networking, the schemes of in-network caching can affect the performance of the whole network. Existing schemes lack of the global view, which results in inefficient caches. In this paper, we aim to analyze the real-time distribution of contents among caches from multiple perspectives. This paper proposes TCBRP, a scheme that analyzes caching tendency of various contents in reverse path, based on centrality of nodes, popularity of contents and replacement rate of nodes, to cache in-network contents. This scheme also has decent scalability and can be expended conveniently. The experimental results reflect that TCBRP report savings in average hops and balance cache hit rate, compared with BetwRep and LCE.

关键词： Content-Centric Networking Tendency-based Caching Popularity

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Last Level Cache Based on Multi-retention STT-RAM Cells 1

引用

11th Conference on Advanced Computer Architecture (ACA)

作者： Zhang, Hongguang Zhang, Minxuan Zhao, Zhenyu Tian, Shuo Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (数字)9789811022098

ISBN: (纸本)9789811022098;9789811022081

Spin-transfer torque random access memory (STT-RAM) is one of the most promising substitutes for universal main memory and cache due to its excellent scalability, high storage density and low leakage power. A much larger cache capacity in the same die footprint can be implemented with STT-RAM because its area is only 1/9 to 1/3 that of SRAM. However, the non-volatile STT-RAM also has some drawbacks, such as long write latency and high write energy, which limit its application in cache design. To solve the two problems, we relax the retention time of STT-RAM to optimize its write performance and energy, and propose a novel multi-retention STT-RAM hybrid last level cache (LLC) architecture, which is realized with three different kinds of cells. In addition, we design the data migration scheme to manage its block allocation, thus improving overall system performance further. The experiment results show that our multi-retention hybrid LLC reduces the total power consumption by as much as 96.6 % compared with SRAM LLC, while having almost the same (at 99.4 %) instruction per cycle (IPC).

关键词： STT-RAM Last level cache Multi-retention Data migration

来源：评论

学校读者我要写书评

暂无评论

Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One 1

引用

10th International Frontiers of Algorithmics Workshop (FAW)

作者： Peng, Wei Wang, Dongxia Jiang, Xinwen Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China Beijing Inst Syst Engn Natl Key Lab Sci & Technol Informat Syst Secur Beijing Peoples R China

ISBN: (数字)9783319398174

ISBN: (纸本)9783319398174;9783319398167

It is well-known that many NP-complete problems will undergo phase transitions along with the change of some problem-specific critical parameter values. It has been shown that the phase transition will occur at an average node degree log(n)+ log log(n) for Hamiltonian cycle problem in random graphs with n nodes. In this paper, we prove that random graphs with such critical average node degrees tend to be hamiltonian graphs if their node degrees are greater than one. Using an improved backtracking algorithm with pruning operations, we try to find the areas where hard problem instances can be found with high probability. For random graphs with degrees greater than 1, the experimental results have demonstrated that hard cases can be found with high probability when graphs take lower average degrees, and the phase transition occurs at lower average degrees, too. Empirically, the phase transition between hamiltonicity and non-hamiltonicity occurs when the average degree is 1.1601 + 0.2418log(n) for random graphs with degrees greater than one.

关键词： Hamiltonian cycle problem Phase transition NP-completeness Empirical study

来源：评论

学校读者我要写书评

暂无评论

A Loosely-Coupled Full-System Multicore Simulation Framework

引用

IEEE TRANSACTIONS ON parallel AND distributed SYSTEMS 2016年第6期27卷 1566-1578页

作者： Zhang, Weihua Wang, Haojun Lu, Yunping Chen, Haibo Zhao, Wenyun Fudan Univ Software Sch Shanghai 200433 Peoples R China Fudan Univ Shanghai Key Lab Data Sci Shanghai 200433 Peoples R China Fudan Univ Parallel Proc Inst Shanghai 200433 Peoples R China Fudan Univ Sch Comp Sci Shanghai 200433 Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai 200030 Peoples R China

Full-system simulation is critical in evaluating design alternatives for multicore processors. However, state-of-the-art multicore simulators either lack good extensibility due to their tightly-coupled design between functional model (FM) and timing model (TM), or cannot guarantee cycle-accuracy. This paper conducts a comprehensive study on factors affecting cycle-accuracy and uncovers several contributing factors less studied before. Based on these insights, we propose a loosely-coupled functional-driven full-system simulator for multicore, namely Transformer. To ensure extensibility and cycle-accuracy, Transformer leverages an architecture-independent interface between FM and TM and uses a lightweight scheme to detect and recover from execution divergence between FM and TM. Built upon Transformer and its foundational simulator components, a graduate student only needed to write about 180 lines of code to extend an X86 functional model (QEMU) in Transformer. Moreover, the loosely-coupled design also removes the complex interaction between FM and TM and opens the opportunity to parallelize FM and TM to improve performance. Experimental results show that Transformer achieves an average of 8.4 and 7.0 percent performance improvement over GEMS in 4-core and 8-core configuration while guaranteeing cycle-accuracy. A further parallelization between FM and TM leads to 35.3 and 29.7 percent performance improvement respectively.

关键词： Functional-driven multicore simulation full-system extension

来源：评论

学校读者我要写书评

暂无评论

A Data-driven Mechanism for Large-scale Data Distribution

A Data-driven Mechanism for Large-scale Data Distribution

引用

World Automation Congress (WAC)

作者： Shi Peichang Li Yiying Ding Bo Jiang Longquan Liu Hui Zhang Jie Natl Univ Def Technol Sch Comp Sci Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China China Elect Equipment & Syst Engn Co Ltd Beijing 100039 Peoples R China

ISBN: (纸本)9781889335513

As The integration of Physical space and cyberspace, the large-scale data distributing to diversification terminal which is geographical distribution of mass has become a huge challenge. When the data size can't be processed by the technology for traditional scope, how to deal with the user quality of service and efficient use of system resources has become an important issue of concern, with the resources becoming limited. This paper presents a data-driven mechanism for large-scale data distribution which is consists of four core part of the data production, data collection and pre-processing, data analysis engine, data consumption, aims to excavate the valuable information to improve the efficiency of resource use and accurate fault location for the Large-scale data distribution system. At the same time, this paper studies the resource scheduling optimization with analyzing data driven for the system behavior and Fault location with analyzing data-driven environment, which proves the effectiveness for the operation of the Large-scale data distribution system optimization by the data-driven working.

关键词： Data-driven Large-scale Data Distribution Monitoring and Analysis Resource Scheduling Fault Diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：