检索结果-南通市图书馆

Superscalar communication: A runtime optimization for distributed applications

Science China(Information Sciences) 2010年第10期53卷 1931-1946页

作者： LI HuiBa , LIU ShengYun, PENG YuXing, LI DongSheng, ZHOU HangJun & LU XiCheng National Laboratory for Parallel and distributed Processing, National University of Defense Technology, Changsha 410073, China National Laboratory for Parallel and distributed Processing National University of Defense Technology Changsha China

Building distributed applications is difficult mostly because of concurrency management. Existing approaches primarily include events and threads. Researchers and developers have been debating for decades to prove which is superior. Although the conclusion is far from obvious, this long debate clearly shows that neither of them is perfect. One of the problems is that they are both complex and error-prone. Both events and threads need the programmers to explicitly manage concurrencies, and we believe it is just the source of difficulties. In this paper, we propose a novel approach—superscalar communication, in which concurrencies are automatically managed by the runtime system. It dynamically analyzes the programs to discover potential concurrency opportunities; and it dynamically schedules the communication and the computation tasks, resulting in automatic concurrent execution. This approach is inspired by the idea of superscalar technology in modern microprocessors, which dynamically exploits instruction-level parallelism. However, hardware superscalar algorithms do not fit software in many aspects, thus we have to design a new scheme completely from scratch. Superscalar communication is a runtime extension with no modification to the language, compiler or byte code, so it is good at backward compatibility. Superscalar communication is likely to begin a brand new research area in systems software, which is characterized by dynamic optimization for networking programs.

关键词： network programming concurrency event thread superscalar

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

引用

Computers, Materials & Continua 2024年第5期79卷 2625-2646页

作者： Mingliang Sun Jie Yuan Xiaoyong Li Dongxiao Liu Key Laboratory of Trustworthy distributed Computing and Service(BUPT) Ministry of EducationBeijing University of Posts and TelecommunicationsBeijing100876China

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

关键词： Image encryption chaotic system compressive sensing arnold transform

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Embedded DHT overlays in virtual computing environments

引用

Science China(Information Sciences) 2010年第3期53卷 483-493页

作者： ZHANG YiMing, LU XiCheng & LI DongSheng 1National Laboratory for Parallel and distributed Processing (PDL), Changsha 410073, China 2School of Computer, National University of Defense Technology, Changsha 410073, China National Laboratory for Parallel and distributed Processing (PDL) Changsha China

With the rapid development of computing and networking technologies, people propose to build harmonious, trusted and transparent Internet-based virtual computing environments (iVCE). The overlay-based organization of dynamic Internet resources is an important approach for iVCE to realizing efficient resource sharing. DHT-based overlays are scalable, low-latency and highly available; however, the current DHT overlay (SKY) in iVCE cannot satisfy the "trust" requirements of Internet applications. To address this problem, in this paper we modify SKY and propose TrustedSKY, an embedded DHT overlay technique in iVCE which supports applications to select trusted nodes to form a "trusted subgroup" in the base overlay and realize secure and trusted DHT routing.

关键词： Internet-based virtual computing environment (iVCE) DHT overlay TrustedSKY

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Adaptive and augmented active anomaly detection on dynamic network traffic streams

引用

Frontiers of Information Technology & Electronic Engineering 2024年第3期25卷 446-460页

作者： Bin LI Yijie WANG Li CHENG National Key Laboratory of Parallel and distributed Computing College of ComputerNational University of Defense TechnologyChangsha 410073China College of System Engineering National University of Defense TechnologyChangsha 410073China

Active anomaly detection queries labels of sampled instances and uses them to incrementally update the detection model,and has been widely adopted in detecting network attacks.However,existing methods cannot achieve desirable performance on dynamic network traffic streams because(1)their query strategies cannot sample informative instances to make the detection model adapt to the evolving stream and(2)their model updating relies on limited query instances only and fails to leverage the enormous unlabeled instances on streams.To address these issues,we propose an active tree based model,adaptive and augmented active prior-knowledge forest(A3PF),for anomaly detection on network trafic streams.A prior-knowledge forest is constructed using prior knowledge of network attacks to find feature subspaces that better distinguish network anomalies from normal traffic.On one hand,to make the model adapt to the evolving stream,a novel adaptive query strategy is designed to sample informative instances from two aspects:the changes in dynamic data distribution and the uncertainty of anomalies.On the other hand,based on the similarity of instances in the neighborhood,we devise an augmented update method to generate pseudo labels for the unlabeled neighbors of query instances,which enables usage of the enormous unlabeled instances during model updating.Extensive experiments on two benchmarks,CIC-IDS2017 and UNSW-NB15,demonstrate that A3PF achieves significant improvements over previous active methods in terms of the area under the receiver operating characteristic curve(AUC-ROC)(20.9%and 21.5%)and the area under the precision-recall curve(AUC-PR)(44.6%and 64.1%).

关键词： Active anomaly detection Network traffic streams Pseudo labels Prior knowledge of network attacks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

MPtostream:an OpenMP compiler for CPU-GPU heterogeneous parallel systems

引用

Science China(Information Sciences) 2012年第9期55卷 1961-1971页

作者： YANG XueJun,TANG Tao ,WANG GuiBin,JIA Jia & XU XinHai National Laboratory for Parallel and distributed Processing,National University of Defense Technology,Changsha 410073,China National Laboratory for Parallel and distributed Processing National University of Defense Technology Changsha China

In light of GPUs’ powerful floating-point operation capacity,heterogeneous parallel systems incorporating general purpose CPUs and GPUs have become a highlight in the research field of high performance computing(HPC).However,due to the complexity of programming on GPUs,porting a large number of existing scientific computing applications to the heterogeneous parallel systems remains a big challenge.The OpenMP programming interface is widely adopted on multi-core CPUs in the field of scientific computing.To effectively inherit existing OpenMP applications and reduce the transplant cost,we extend OpenMP with a group of compiler directives,which explicitly divide tasks among the CPU and the GPU,and map time-consuming computing fragments to run on the GPU,thus dramatically simplifying the transplantation.We have designed and implemented MPtoStream,a compiler of the extended OpenMP for AMD’s stream processing GPUs.Our experimental results show that programming with the extended directives deviates from programming with OpenMP by less than 11% modification and achieves significant speedup ranging from 3.1 to 17.3 on a heterogeneous system,incorporating an Intel Xeon E5405 CPU and an AMD FireStream 9250 GPU,over the execution on the Xeon CPU alone.

关键词： GPGPU stream OpenMP compiler

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A fast successive over-relaxation algorithm for force-directed network graph drawing

引用

Science China(Information Sciences) 2012年第3期55卷 677-688页

作者： WANG YongXian & WANG ZhengHua National Key Laboratory for Parallel and distributed Processing, National University of Defense Technology, Changsha 410073, China National Key Laboratory for Parallel and distributed Processing National University of Defense Technology Changsha China

Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation (SOR) strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.

关键词： graph drawing graph layout successive over-relaxation force-directed algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

SCautz:a high performance and fault-tolerant datacenter network for modular datacenters

引用

Science China(Information Sciences) 2012年第7期55卷 1493-1508页

作者： HUANG Feng,LU XiCheng,LI DongSheng & ZHANG YiMing National Lab for Parallel and distributed Processing,School of Computer,National University of Defense Technology,Changsha 410073,China National Lab for Parallel and distributed Processing School of Computer National University of Defense Technology Changsha China

Modular datacenters (MDCs) use shipping containers,encapsulating thousands of servers,as large pluggable building blocks for mega datacenters.The MDC’s "service-free" model poses stricter demand on fault-tolerance of the modular datacenter network (MDCN).Based on the "scale-out" principle,in this paper we propose SCautz,a novel hybrid intra-container network for MDCs.SCautz comprises a base Kautz topology,created by interconnecting servers,and a small number of COTS (commercial off-the-shelf) switches.Moreover,each switch connects a specific number of servers forming "clusters",which,as logical nodes,form multiple higher-level logical Kautz structures.SCautz’s hybrid structure has several advantages.First,it supports multiple running modes for the MDC,while its full structure increases network capacity twofold.Second,it retains the throughput for processing one-to-x traffic in the presence of failures.Finally,it achieves much more graceful network performance degradation than computation and storage capacity do.Results from theoretical analysis and simulations show that SCautz is more viable for intra-container networks.

关键词： modular datacenter network container Kautz fault-tolerant

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

NFT Security Matrix:Towards Modeling NFT Ecosystem Threat

引用

Computer Modeling in Engineering & Sciences 2024年第6期139卷 3255-3285页

作者： Peng Liao Chaoge Liu Jie Yin Zhi Wang Xiang Cui Key Laboratory of Trustworthy distributed Computing and Service Beijing University of Posts and TelecommunicationsBeijing100876China Zhongguancun Laboratory Beijing100094China Institute of Information Engineering Chinese Academy of SciencesBeijing100085China

Digital assets have boomed over the past few years with the emergence of Non-fungible Tokens(NFTs).To be specific,the total trading volume of digital assets reached an astounding$55.5 billion in 2022.Nevertheless,numerous security concerns have been raised by the rapid expansion of the NFT ecosystem.NFT holders are exposed to a plethora of scams and traps,putting their digital assets at risk of being lost.However,academic research on NFT security is scarce,and the security issues have aroused rare attention.In this study,the NFT ecological process is comprehensively explored.This process falls into five different stages encompassing the entire lifecycle of NFTs.Subsequently,the security issues regarding the respective stage are elaborated and analyzed in depth.A matrix model is proposed as a novel contribution to the categorization of NFT security issues.Diverse data are collected from social networks,the Ethereum blockchain,and NFT markets to substantiate our claims regarding the severity of security concerns in the NFT ecosystem.From this comprehensive dataset,nine key NFT security issues are identified from the matrix model and then subjected to qualitative and quantitative analysis.This study aims to shed light on the severity of NFT ecosystem security issues.The findings stress the need for increased attention and proactive measures to safeguard the NFT ecosystem.

关键词： Non-fungible token blockchain cyber security

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Static Analysis Techniques for Fixing Software Defects in MPI-Based Parallel Programs

引用

Computers, Materials & Continua 2024年第5期79卷 3139-3173页

作者： Norah Abdullah Al-Johany Sanaa Abdullah Sharaf Fathy Elbouraey Eassa Reem Abdulaziz Alnanih Department of Computer Science Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Software Engineering and distributed System Research Group King Abdulaziz UniversityJeddah21589Saudi Arabia

The Message Passing Interface (MPI) is a widely accepted standard for parallel computing on distributed memorysystems.However, MPI implementations can contain defects that impact the reliability and performance of parallelapplications. Detecting and correcting these defects is crucial, yet there is a lack of published models specificallydesigned for correctingMPI defects. To address this, we propose a model for detecting and correcting MPI defects(DC_MPI), which aims to detect and correct defects in various types of MPI communication, including blockingpoint-to-point (BPTP), nonblocking point-to-point (NBPTP), and collective communication (CC). The defectsaddressed by the DC_MPI model include illegal MPI calls, deadlocks (DL), race conditions (RC), and messagemismatches (MM). To assess the effectiveness of the DC_MPI model, we performed experiments on a datasetconsisting of 40 MPI codes. The results indicate that the model achieved a detection rate of 37 out of 40 codes,resulting in an overall detection accuracy of 92.5%. Additionally, the execution duration of the DC_MPI modelranged from 0.81 to 1.36 s. These findings show that the DC_MPI model is useful in detecting and correctingdefects in MPI implementations, thereby enhancing the reliability and performance of parallel applications. TheDC_MPImodel fills an important research gap and provides a valuable tool for improving the quality ofMPI-basedparallel computing systems.

关键词： High-performance computing parallel computing software engineering software defect message passing interface deadlock

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Towards estimating expected sizes of probabilistic skylines

引用

Science China(Information Sciences) 2011年第12期54卷 2574-2584页

作者： YANG YongTao & WANG YiJie National Key Laboratory for Parallel and distributed Processing, School of Computer, National University of Defense Technology, Changsha 410073, China National Key Laboratory for Parallel and distributed Processing School of Computer National University of Defense Technology Changsha China

We consider the maximal vector problem on uncertain data, which has been recently posed by the study on processing skyline queries over a probabilistic data stream in the database context. Let D n be a set of n points in a d-dimensional space and q (0 < q 1) be a probability threshold; each point in D n has a probability to occur. Our problem is concerned with how to estimate the expected size of the probabilistic skyline, which consists of all the points that are not dominated by any other point in D n with a probability not less than q. We prove that the upper bound of the expected size is O(min{n, (- ln q)(ln n) d-1 }) under the assumptions that the value distribution on each dimension is independent and the values of the points along each dimension are distinct. The main idea of our proof is to find a recurrence about the expected size and solve it. Our results reveal the relationship between the probability threshold q and the expected size of the probabilistic skyline, and show that the upper bound is poly-logarithmic when q is not extremely small.

关键词： probabilistic skyline probabilistic data streams expected size

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：