Determining the validity of knowledge triples and filling in the missing entities or relationships in the knowledge graph are the crucial tasks for large-scale knowledge graph completion. So far, the main solutions us...
详细信息
Many recent applications involve processing and analyzing uncertain data. Recently, several research efforts have addressed answering skyline queries efficiently on massive uncertain datasets. However, the research la...
详细信息
Emerging blockchain accounting mechanism allow mutually distributed parties to transport trusted information and ensure the correctness of data. Every blockchain node stores the complete block locally. Although this m...
详细信息
Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation t...
详细信息
The density peak （DP） algorithm has been widely used in scientific research due to its novel and effective peak density-based clustering approach. However, the DP algorithm uses each pair of data points several time...
详细信息
The density peak （DP） algorithm has been widely used in scientific research due to its novel and effective peak density-based clustering approach. However, the DP algorithm uses each pair of data points several times when determining cluster centers, yielding high computational complexity. In this paper, we focus on accelerating the time-consuming density peaks algorithm with a graphics processing unit （GPU）. We analyze the principle of the algorithm to locate its computational bottlenecks, and evaluate its potential for parallelism. In light of our analysis, we propose an efficient parallel DP algorithm targeting on a GPU architecture and implement this parallel method with compute unified device architecture （CUDA）, called the ‘CUDA-DP platform＇. Specifically, we use shared memory to improve data locality, which reduces the amount of global memory access. To exploit the coalescing accessing mechanism of CPU, we convert the data structure of the CUDA-DP program from array of structures to structure of arrays. In addition, we introduce a binary search-and-sampling method to avoid sorting a large array. The results of the experiment show that CUDA-DP can achieve a 45-fold acceleration when compared to the central processing unit based density peaks implementation.
In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features e...
详细信息
In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features effectively supporting high performance communications, ranging over remote direct memory access, collective optimization, hardwareenable reliable end-to-end communication, user-level message passing services, etc. Measured hardware performance results are also presented.
The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic...
详细信息
The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.
Although Statecharts has gained widespread use as a formalism for modeling reactive real-time systems, testing these systems still confronts some difficulties, of which a major one is the existence of numerous and com...
详细信息
distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme th...
详细信息
distributed online social networks (DOSN) have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose BCE (Bloom Filter based Common-Friend Est...
详细信息
暂无评论