This paper discusses the use of genetic algorithm (GA), tabu search (TS), and ant colony algorithm (ACA) to solve the reporting cells planning problem. In the reporting cell location management scheme, some cells in t...
Infrared and visible image fusion has been a hot issue in image fusion. However, the parameters and result image have many proposed. In this paper, a novel visible infrared image fusion algorithm based on double-densi...
详细信息
Fast, byte-addressable NVM promises near-cache latency and near memory bus throughput for file systems, which is evident by recent development of a number of NVM file systems (NVMFS). However, a key approach to measur...
详细信息
Graph-structured analytics has been widely adopted in a number of big data applications such as social computation, web-search and recommendation systems. Though much prior research focuses on scaling graph-analytics ...
详细信息
ISBN:
(纸本)9781450332057
Graph-structured analytics has been widely adopted in a number of big data applications such as social computation, web-search and recommendation systems. Though much prior research focuses on scaling graph-analytics on distributed environments, the strong desire on performance per core, dollar and joule has generated considerable interests of processing large-scale graphs on a single server-class machine, which may have several terabytes of RAM and 80 or more cores. However, prior graph-analytics systems are largely neutral to NUMA characteristics and thus have suboptimal performance. This paper presents a detailed study of NUMA characteristics and their impact on the efficiency of graph-analytics. Our study uncovers two insights: 1) either random or interleaved allocation of graph data will significantly hamper data locality and parallelism;2) sequential inter-node (i.e., remote) memory accesses have much higher bandwidth than both intra- and inter-node random ones. Based on them, this paper describes Polymer, a NUMA-aware graph-analytics system on multicore with two key design decisions. First, Polymer differentially allocates and places topology data, application-defined data and mutable runtime states of a graph system according to their access patterns to minimize remote accesses. Second, for some remaining random accesses, Polymer carefully converts random remote accesses into sequential remote accesses, by using lightweight replication of vertices across NUMA nodes. To improve load balance and vertex convergence, Polymer is further built with a hierarchical barrier to boost parallelism and locality, an edge-oriented balanced partitioning for skewed graphs, and adaptive data structures according to the proportion of active vertices. A detailed evaluation on an 80-core machine shows that Polymer often outperforms the state-of-the-art single-machine graph-analytics systems, including Ligra, X-Stream and Galois, for a set of popular real-world and synthetic grap
Multi-channel neighbor discovery protocol based on information of detected neighbors for wireless sensor networks is proposed in this paper, called MND. To make sure that the discovery among nodes is as quick as possi...
详细信息
Although many works have reported simulated performance benefits of stream reuse techniques to the scalability of VoD systems, these techniques have been rarely evaluated in practical implementations of scalable VoD s...
详细信息
Influence maximization refers to the number of influenced nodes reach to maximum by finding a set of seed nodes in social network. Due to peoples' excessive concentration of attention, sometimes, negative effects ...
详细信息
Even though pre-trained language models like BERT and XLNet have produced significant consequences on a variety of tasks of natural language processing, they are difficult to deploy in practical applications due to th...
详细信息
In this work, we explore the energy band of the well-aligned silicon (Si) nanopillars (NPs) embedded in Si0.7Ge0.3 matrix fabricated by neutral beam etching. Instead of real-space modeling, we formulate and solve the ...
详细信息
暂无评论