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

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Xie, Chenning Chen, Rong Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Large-scale graph-structured computation usually exhibits iterative and convergence-oriented computing nature, where input data is computed iteratively until a convergence condition is reached. Such features have led to the development of two different computation modes for graph-structured programs, namely synchronous (Sync) and asynchronous (Async) modes. Unfortunately, there is currently no in-depth study on their execution properties and thus programmers have to manually choose a mode, either requiring a deep understanding of underlying graph engines, or suffering from suboptimal performance. This paper makes the first comprehensive characterization on the performance of the two modes on a set of typical graph-parallel applications. Our study shows that the performance of the two modes varies significantly with different graph algorithms, partitioning methods, execution stages, input graphs and cluster scales, and no single mode consistently outperforms the other. To this end, this paper proposes Hsync, a hybrid graph computation mode that adaptively switches a graph-parallel program between the two modes for optimal performance. Hsync constantly collects execution statistics on-the-fly and leverages a set of heuristics to predict future performance and determine when a mode switch could be profitable. We have built online sampling and offline profiling approaches combined with a set of heuristics to accurately predicting future performance in the two modes. A prototype called PowerSwitch has been built based on PowerGraph, a state-of-the-art distributed graph-parallel system, to support adaptive execution of graph algorithms. On a 48-node EC2-like cluster, PowerSwitch consistently outperforms the best of both modes, with a speedup ranging from 9% to 73% due to timely switch between two modes. Copyright 2015 ACM.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

DMSA: Decentralized and Multi-keyword Selective Data Sharing and Acquisition 22

DMSA: Decentralized and Multi-keyword Selective Data Sharing...

引用

22nd IEEE International Symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Lin, Moheng Shi, Peichang Fu, Xiang Jiang, Feng Yi, Guodong National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Changsha410073 China Xiangjiang Lab Changsha410073 China

ISBN: (纸本)9798331509712

Blockchain technology has been extensively uti-lized in decentralized data-sharing applications, with the immutability of blockchain providing a witness for the circulation of data. However, current blockchain data-sharing solutions still fail to address the simultaneous screening needs of both the sender and receiver with multi-keywords. Without the capability to support bilateral simultaneous filtering, the disclosure of reasons for matching failures could inadvertently expose sensitive user data. Therefore, the challenge lies in enabling ciphertexts with multiple keywords and receivers with multiple interests to achieve mutual and simultaneous matching. Based on the technical foundations of SE (Searchable Encryption), MABE (Multi-Attribute Based Encryption), and polynomial fitting, this paper proposes a scheme called DMSA (Decentralized and Multi-keyword selective Sharing and selective Acquisition). This scheme can satisfy soundness, enabling ciphertexts carrying multiple keywords and receivers representing multiple interests to match each other simultaneously. We conducted a security analysis that confirms the security of DMSA against chosen-plaintext attacks. Our experimental results demonstrate a significant efficiency improvement, with a 67% increase over single-keyword data-sharing schemes and a 16% enhancement compared to the existing multi-keyword data-sharing solution. © 2024 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

A Java graphical user interface for large-scale scientific computations in distributed systems 4

A Java graphical user interface for large-scale scientific c...

引用

4th International Conference/Exhibition on High Performance computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Shen, X. Thiruvathukal, G. Liao, W. Choudhary, A. Singh, A. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University EvanstonIL60208 United States School of Computing Telecommunications and Information Sciences JHPC Laboratory DePaul University United States

ISBN: (纸本)0769505902

Large-scale scientific applications present great challenges to computational scientists in terms of obtaining high performance and in managing large datasets. These applications (most of which are simulations) may employ multiple techniques and resources in a heterogeneously distributed environment. Effective working in such an environment is crucial for modern large-scale simulations. In this paper, we present an integrated Java graphical user interface (IJ-GUI) that provides a control platform for managing complex programs and their large datasets easily. As far as performance is concerned, we present and evaluate our initial implementation of two optimization schemes: data replication and data prediction. Data replication can take advantage of 'temporal locality' by caching the remote datasets on local disks;data prediction, on the other hand, provides prefetch hints based on the datasets' past activities that are kept in databases. We first introduce the data contiguity concept in such an environment that guides data prediction. The relationship between the two approaches is discussed. © 2000 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Towards an agent oriented programming language with caste and scenario mechanisms

Towards an agent oriented programming language with caste an...

引用

4th International Conference on Autonomous Agents and Multi agent Systems, AAMAS 05

作者： Wang, Ji Shen, Rui Zhu, Hong National Laboratory for Parallel and Distributed Processing Changsha 410073 China Department of Computing Oxford Brookes University Oxford OX33 1HX United Kingdom

The paper presents an agent-oriented programming language SLABSp. It provides caste and scenario mechanisms in a coherent way to support the caste-centric methodology of agent-oriented software development. It uses caste as a modular facility to organize agents into castes and to represent their structure and behavior characteristics. SLABSp also uses scenarios to define agents' behaviors in the context of environment situations. In the paper, the implementation of the language is briefly described. An example of the program is given to illustrate its programming style. Copyright 2005 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The visual query language for an object-oriented knowledge-based system

The visual query language for an object-oriented knowledge-b...

引用

1999 International Symposium on Database Applications in Non-Traditional Environments, DANTE 1999

作者： Xu, Ming Wang, Yong-Jun Wang, Yi-Jie Zhang, Kang Zhang, Yanchim National Laboratory for Parallel and Distributed Processing Changsha Hunan410073 China Dept.of Computing Mac Quart e University Sydney Australia University of Southern Queensland Depi of Mathematics and Computing Toowoomba Australia

ISBN: (纸本)0769504965

The user interface of the object-oriented knowledge-based system CAOBS/v1.2 is a visual query subsystem consisting of a flexible visual query language (VKQL), and a knowledge base browser/*** the visual language, the user can express query requirements by constructing query *** absorbs the key features of some existing visual query languages, and adds more advanced *** paper presents the design and implementation of VKQL and compares VKQL with other similar query languages. © 2000 IEEE.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

CCN hotspot cache placement strategy based on genetic algorithm 10th

CCN hotspot cache placement strategy based on genetic algori...

引用

10th International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017

作者： Wu, Hongjia Wang, Nao Wang, Gaocai School of Computer and Electronic Information Guangxi University NanningGuangxi533004 China Guangxi Colleges and University Key Laboratory of Parallel and Distributed Computing Technology Nanning530004 China

ISBN: (纸本)9783319723945

Content-centric networks provide effective support for content services through a caching mechanism, so the caching of the placement strategy has become a hot research. In this paper, the problem of content placement in CCN is taken as the starting point, focusing on the allocation of caching resources for district partitioning according to the number of users given the content of predictable hotspots. When the hot topic breaks out, the first to the user from the content of the nearest as the goal, from the user’s point of view as its characteristics, nested using improved genetic algorithms to select hotspot cache placement points, and a CCN hotspot cache placement strategy based on genetic algorithm is proposed. In the simulation experiment, the cache placement strategy proposed in this paper is compared with other traditional strategies in network performance. The simulation results show that the strategy can effectively reduce the access hops and average access latency, reduce the server load and improve the user satisfaction. © Springer International Publishing AG 2017.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing Resolution of Inferring Hi-C Data Integrating U-Net and ResNet Networks 23rd

Enhancing Resolution of Inferring Hi-C Data Integrating U-Ne...

引用

23rd International Conference on parallel and distributed computing, Applications, and Technologies, PDCAT 2022

作者： Zhao, Fengjiao Li, Na Zhong, Cheng School of Computer Electronics and Information Guangxi University Guangxi Nanning530004 China Key Laboratory of Parallel and Distributed Computing Technology in Guangxi Universities Guangxi Nanning530004 China

ISBN: (纸本)9783031299261

The Hi-C data is the basis of three-dimensional chromosome structure reconstruction. In this paper, a method integrating U-Net and ResNET network is proposed to infer high resolution Hi-C data from existing low-resolution Hi-C data. Firstly, the U-Net is used as the backbone network to make full use of the shallow layer details and deep layer essential features of Hi-C data. Secondly, the residual module is introduced into the coding path and decoding path of the network to increase the depth of the model and prevent network degradation. Finally, the down sampling is used to reduce the calculation amount to decrease the required running time for the network model. The experimental results on real datasets showed that the proposed method had better performance than existing methods, and the inferred high resolution Hi-C data was closer to the real Hi-C data. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of dangling pointer error for C/C++ programs 2

Efficient detection of dangling pointer error for C/C++ prog...

引用

2nd Annual International Conference on Information System and Artificial Intelligence, ISAI 2017

作者： Zhang, Wenzhe Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server and Storage Technology College of Computer National University of Defense Technology Changsha China

Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory accesses unmonitored, our method could reduce the memory monitoring overhead and thus achieves better performance over previous methods. Experiments show that our method could achieve an average speed up of 9% over previous compiler instrumentation based method and more than 50% over previous page protection based method. © Published under licence by IOP Publishing Ltd.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

An improved pre-copy transmission algorithm in mobile cloud computing 1

引用

10th International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017

作者： Huang, Xianfei Wang, Nao Wang, Gaocai School of Computer and Electronic Information Guangxi University NanningGuangxi530004 China Guangxi Colleges and University Key Laboratory of Parallel and Distributed Computing Technology Nanning530004 China

ISBN: (数字)9783319723891

ISBN: (纸本)9783319723884

With the rapidly development of mobile cloud computing, in order to provide a better experience for mobile users, the computing and storage functions of mobile terminals are migrated to the cloud. In the application research of virtual machine migration, the transmission rate of wireless channel will changed with the changes of network condition. This paper focuses on the pre-copy transmission algorithm in the process of virtual machine migration in mobile cloud computing. A pre-copy transmission algorithm based on optimal stopping theory (PTAOST) was proposed, the algorithm constructs an optimal stopping problem based on an optimal transmission rate in the process of virtual machine migration. And we solve the model by using the optimal stopping theory, and get an optimal transfer rate. So the total amount of data and migration time is reduced during the process of virtual machine migration. In simulations, the PTAOST is compared with the transmission algorithms offered by some literatures, and we obtained some comparable results about the total migration data and total migration time to different transmission algorithms. The simulative results show that the proposed algorithm has less the total amount of migration data and total time of migration and improves the performance of migration. © 2017, Springer International Publishing AG.

关键词： Mobile cloud computing

来源：评论

学校读者我要写书评

暂无评论

Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters

引用

Cluster computing 1999年第3期2卷 177-186页

作者： Roy, Sumit Chaudhary, Vipin Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become the norm for high-performance economical computing solutions. Multiple nodes in a cluster can be used for parallel programming using a message passing library. An alternate approach is to use a software distributed Shared Memory (DSM) to provide a view of shared memory to the application programmer. This paper describes Strings, a high performance distributed shared memory system designed for such SMP clusters. The distinguishing feature of this system is the use of a fully multi-threaded runtime system, using kernel level threads. Strings allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel level light weight processes, applications written using Strings can exploit multiple processors on a SMP machine. This paper describes some of the architectural details of the system and illustrates the performance improvements with benchmark programs from the SPLASH-2 suite, some computational kernels as well as a full fledged application. It is found that using multiple processes on SMP nodes provides good speedups only for a few of the programs. Multiple application threads can improve the performance in some cases, but other programs show a slowdown. If kernel threads are used additionally, the overall performance improves significantly in all programs tested. Other design decisions also have a beneficial impact, though to a lesser degree.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：