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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithms for Deblurring of MR Images 13

Parallel Algorithms for Deblurring of MR Images

引用

13th International Conference on Computers and Their Applications, CATA 1998

作者： Menon, Padmanabhan Chaudhary, Vipin Pipe, James G. Parallel and Distributed Computing Laboratory Wayne State University DetroitMI48202 United States Department of Radiology Wayne State University DetroitMI48202 United States

ISBN: (纸本)9781618395443

This paper presents a parallelized algorithm for the deblurring of images obtained from Magnetic Resonance Imaging. Images generated by MRI may suffer a loss of clarity due to inhomogeneities in the magnetic field. One of the techniques for removing this blurring artifact is the demodulation of the data for each pixel of the image using the value of the magnetic field near that point in space. This method consists of acquiring a local field map, finding the best fit to a linear map and using it to deblur the image distortions due to local frequency variations. This is a very computation intensive operation and presents appreciable gains through parallelization. This paper presents the implementation of this algorithm using two popular message-passing platforms, PVM and MPI and discusses the pros and cons of each. A message-passing paradigm was chosen for parallelization since the target architecture is a network of workstations. Performance figures are presented for various problem and network sizes and future improvements are discussed. © 13th International Conference on Computers and Their Applications 1998, CATA 1998. All rights reserved.

关键词： Algorithms Image Processing Magnetic Resonance Imaging Message Passing MPI PVM

来源：评论

学校读者我要写书评

暂无评论

HAF: a hybrid annotation framework based on expert knowledge and learning technique

引用

Science China(Information Sciences) 2022年第1期65卷 276-278页

作者： Zhixing LI Yue YU Tao WANG Gang YIN Xinjun MAO Huaimin WANG Key Laboratory of Parallel and Distributed Computing National University of Defense Technology College of Computer National University of Defense Technology

Dear editor,The increasing awareness of the potential value hidden in data has resulted in many data mining studies being conducted. In the domain of software engineering, for example, developers' behavioral data and code review data have been leveraged in social coding sites to automatically recommend relevant projects [1] and candidate reviewers [2, 3].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tinman: Eliminating confidential mobile data exposure with security oriented offloading 15

Tinman: Eliminating confidential mobile data exposure with s...

引用

10th European Conference on Computer Systems, EuroSys 2015

作者： Xia, Yubin Liu, Yutao Tan, Cheng Ma, Mingyang Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332385

The wide adoption of smart devices has stimulated a fast shift of security-critical data from desktop to mobile devices. However, recurrent device theft and loss expose mobile devices to various security threats and even physical attacks. This paper presents TinMan, a system that protects confidential data such as web site password and credit card number (we use the term cor to represent these data, which is short for Confidential Record) from being leaked or abused even under device theft. TinMan separates accesses of cor from the rest of the functionalities of an app, by introducing a trusted node to store cor and offloading any code from a mobile device to the trusted node to access cor. This completely eliminates the exposure of cor on the mobile devices. The key challenges to TinMan include deciding when and how to efficiently and transparently offload execution;Tin-Man addresses these challenges with security-oriented offloading with a low-overhead tainting scheme called asymmetric tainting to track accesses to cor to trigger offloading, as well as transparent SSL session injection and TCP payload replacement to offload accesses to cor. We have implemented a prototype of TinMan based on Android and demonstrated how TinMan protects the information of user's bank account and credit card number without modifying the apps. Evaluation results also show that TinMan incurs only a small amount of performance and power overhead. Copyright © 2015 ACM.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Grid Based Pervasive distributed Storage

Grid Based Pervasive Distributed Storage

引用

International Symposium on Wireless Pervasive computing (ISWPC)

作者： Diego Arias John Sanabria Wilson Rivera Parallel and Distributed Computing Laboratory University of Puerto Rico Mayaguez Puerto Rico

This paper describes a tool that implements a set of services to manipulate and store data from a sensor network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a replication schema based on the information dispersal algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication. The storage scheme has been deployed on top of a Globus based infrastructure

关键词： Network servers Galois fields Polynomials Large-scale systems Sensor systems Wireless sensor networks Secure storage distributed computing Laboratories Sensor phenomena and characterization

来源：评论

学校读者我要写书评

暂无评论

Unique sets oriented partitioning of nested loops with non-uniform dependences

Unique sets oriented partitioning of nested loops with non-u...

引用

International Conference on parallel Processing (ICPP)

作者： Jialin Ju V. Chaudhary Parallel and Distributed Computing Laboratory Wayne State University Detroit MI USA

Although many methods exist for nested loop partitioning, most of them perform poorly when parallelizing loops with non-uniform dependences. This paper addresses the issue of parallelizing nested loops with non-uniform dependences. The approach is based on convex hull theory, which has adequate information to handle non-uniform dependences. We introduce the concept of Complete Dependence Convex Hull, unique head and tail sets and abstract the dependence information into these sets. These sets form the basis of the iteration space partitions. The properties of the unique head and tail sets are derived using convex hull theory. Depending on the relative placement of these unique sets, the partitioning problem is grouped into several cases. Several partitioning schemes are also suggested for implementing the technique. Preliminary implementation results of the scheme on the Cray J916 and comparison with other schemes show a dramatic improvement in performance.

关键词： Tail parallel processing distributed computing Laboratories Sparse matrices Contracts Processor scheduling Indium tin oxide Tiles

来源：评论

学校读者我要写书评

暂无评论

A new metric for processor allocation schemes in multiprocessor systems

A new metric for processor allocation schemes in multiproces...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Wayne State University Detroit MI USA

Recently a number of scalable interconnection networks for connecting multiple processors have been proposed. Though these networks differ in their properties such as bisection bandwidth, node degree, network diameter, and average diameter, there is one common problem that must be addressed by their designers. It should be possible to subdivide the set of processors such that the subset forms a smaller version of the underlying topology. This task is termed as Processor Allocation in general and Subcube allocation for Hypercubes. Various techniques appear in literature, including tree collapsing, free-list based approaches and others. A common metric for evaluating a scheme is the extent to which it can recognize all the possible sub-graphs in a particular network. In this paper are show that recognizability alone is a poor yardstick for predicting the performance of a processor allocation scheme. We introduce the ideas of Search Space and Impact Sets and propose a new, more pragmatic metric to measure the efficiencies of an allocation scheme. We evaluate this metric for a simple buddy strategy and a hypothetical exhaustive scheme for two popular interconnection networks, the Star Graph and the k-ary-n-cube. We support our results by simulation experiments and conclude that a scheme with higher recognizability is unlikely to justify the associated increase in complexity and storage requirements.

关键词： Hypercubes Multiprocessor interconnection networks Multiprocessing systems Operating systems Intelligent networks distributed computing Laboratories Joining processes Bandwidth Topology

来源：评论

学校读者我要写书评

暂无评论

Evaluation of cluster interconnects for a distributed shared memory

Evaluation of cluster interconnects for a distributed shared...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Wayne State University Detroit MI USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become popular as low-cost, high-performance computing solutions. The type of interconnection hardware used in these clusters can become a deciding factor in their overall performance. This paper evaluates the performance of three different communication systems, 10 Mbps Ethernet, 100 Mbps FastEthernet and 155 Mbps ATM, using a multithreaded distributed Shared Memory system, Strings. The raw performance of each network is first measured using netperf. Ten different applications are then used for performance evaluation, including programs from the SPLASH-2 benchmarks, a medical computing application, and some computational kernels. It is found that half of the programs tested are not significantly affected by changes in the bandwidth. Though the ATM network provides the highest overall bandwidth, the remaining applications show that the increase in latency compared to FastEthernet prevents any performance improvement. On the other hand, applications that require only moderately high bandwidths perform substantially better with FastEthernet.

关键词： Bandwidth distributed computing Programming profession Ethernet networks Asynchronous transfer mode Benchmark testing Biomedical computing Kernel Delay Microprocessors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：