distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world in...
详细信息
Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and s...
详细信息
Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and support efficient resource discovery is an important approach to aggregate resources on-demand in Internet-based Virtual Computing Environment (iVCE). This paper gives an overview of research advances on overlay technologies in iVCE. To adapt to the growth and autonomy of Internet resources, an overlay topology construction mechanism based on Kautz graph is first introduced, and it is extended to a universal method for constructing overlay topologies based on arbitrary regular graphs. To adapt to the diversity of Internet resources, a grouped overlay topology construction mechanism is then proposed. Based on the overlay constructed above, an efficient range query scheme is presented, and the optimization methods of overlay topology as well as other complex query techniques are discussed.
User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate sid...
详细信息
Depthwise convolutions are widely used in lightweight convolutional neural networks (CNNs). The performance of depthwise convolutions is mainly bounded by the memory access rather than the arithmetic operations for cl...
详细信息
Network traffic classification is crucial for network security and network management and is one of the most important network tasks. Current state-of-the-art traffic classifiers are based on deep learning models to a...
详细信息
As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, it becomes an urgent problem of real-time energy-efficient scheduling in multiprocessor systems to reduce system energy cons...
详细信息
As a typical social media in Web 2.0, blogs have attracted a surge of researches. Unlike the traditional studies, the social networks mined from Internet are very large, which makes a lot of social network analyzing a...
详细信息
ISBN:
(纸本)9781605586762
As a typical social media in Web 2.0, blogs have attracted a surge of researches. Unlike the traditional studies, the social networks mined from Internet are very large, which makes a lot of social network analyzing algorithms to be intractable. According to this phenomenon, this paper addresses the novel problem of efficient social networks analyzing on blogs. This paper turns to account the structural characteristics of real large-scale complex networks, and proposes a novel shortest path approximate algorithm to calculate the distance and shortest path between nodes efficiently. The approximate algorithm then is incorporated with social network analysis algorithms and measurements for large-scale social networks analysis. We illustrate the advantages of the approximate analysis through the centrality measurements and community mining algorithms. The experiments demonstrate the effectiveness of the proposed algorithms on blogs, which indicates the necessity of taking account of the structural characteristics of complex networks when optimizing the analysis algorithms on large-scale social networks. Copyright 2009 ACM.
Peer to peer backup systems store data on "unreliable" peers that can leave the system at any moment. In this case, the only way to assure durability of the data is to add redundancy using either replication...
详细信息
The Embarrassingly parallel(EP) algorithm which is typical of many Monte Carloapplications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Int...
详细信息
The Embarrassingly parallel(EP) algorithm which is typical of many Monte Carloapplications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Intel released Many Integrated Core(MIC) architecture as a many-core co-processor. MIC often offers more than 50 cores each of which can run four hardware threads as well as 512-bit vector instructions. In this paper,we describe how the EP algorithm is accelerated effectively on the platforms containing MIC using the offload execution model. The result shows that the efficientimplementation of EP algorithm on MIC can take full advantage of MIC's computational resources and achieves a speedup of 3.06 compared with that on Intel Xeon E5-2670 CPU. Based on the EP algorithm on MIC and an effective task distribution model, the implementation of EP algorithm on a CPU-MIC heterogeneous platform achieves the performance of up to2134.86 Mop/s and 4.04 times speedup compared with that on Intel Xeon E5-2670 CPU.
Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the...
详细信息
ISBN:
(纸本)9781424459889
Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.
暂无评论