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

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Dinan, James Singri, Arjun Sadayappan, P. Krishnamoorthy, Sriram Dept. Computer Science and Engineering Ohio State University United States Pacific Northwest National Laboratory Comp. Sciences and Mathematics Division United States

ISBN: (纸本)9781424469871

We present a fault tolerant task pool execution environment that is capable of performing fine-grain selective restart using a lightweight, distributed task completion tracking mechanism. Compared with conventional checkpoint/restart techniques, this system offers a recovery penalty that is proportional to the degree of failure rather than the system size. We evaluate this system using the Self Consistent Field (SCF) kernel which forms an important component in ab initio methods for computational chemistry. Experimental results indicate that fault tolerant task pools are robust in the presence of an arbitrary number of failures and that they offer low overhead in the absence of faults. © 2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

PAPC: A simple distributed parallel computing framework for mass legacy code tasks

PAPC: A simple distributed parallel computing framework for ...

引用

international conference on Grid and Cloud computing

作者： Wu, Xiaofeng Jiang, Jinlei Yang, Jinzhe Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9780769543130

With the fast development of multi-core technology, future high performance computing system will be a system of many multi-core processors where parallel computing is a must. However, it is not an easy task in such an environment to run legacy code programs that are developed for machines of single-core processors to achieve the desired speedup. To deal with the problem, in this paper we put forward a parallel computing framework named PAPC on the basis of ProActive, an open source middleware that aims to ease the development of parallel and distributed applications and that has excellent support for high performance computing. We explain in detail the design and implementation of the PAPC and conduct some experiments to evaluate it. Experimental results show that the framework PAPC is of strong scalability, good adaptability and can make full use of the high performance of multi-core. © 2010 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A fast seismic data processing approach based on parallel wavelet transform

A fast seismic data processing approach based on parallel wa...

引用

IEEE international conference on Progress in Informatics and computing (PIC)

作者： Zhang, Xiaolai Lu, Yongquan Li, Jinsong Wang, Jintao High Performance Computing Center Communication University of China Beijing 100024 China Information Engineering School Communication University of China Beijing 100024 China

ISBN: (纸本)9781424467860

A new implementation of seismic data processing approach based on parallel wavelet transform is presented in this paper. Firstly, the feasibility and necessity of the parallel processing method for seismic data are elaborated from three primary aspects. Based on the analysis, the parallel wavelet transform is implemented by using MATLAB on a distributed cluster. Finally, both sequential and parallel implements are employed to test and compare the performance of our implementation. A series of experiments have demonstrated that parallel wavelet transform can significantly reduce the running time and improve the speedup greatly. ©2010 IEEE.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

distributed Relay Selection in OFDM-Based Cooperative Wireless networks

Distributed Relay Selection in OFDM-Based Cooperative Wirele...

引用

6th international conference on Wireless Communications, Networking and Mobile computing (WICOM)

作者： Yang, Wendong Cai, Yueming PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9781424437092

In this paper, we investigate distributed relay selection in OFDM-based cooperative wireless networks. A selective Decode-and-Forward relaying strategy is adopted, in which one relay is selected to forward the entire OFDM symbol. Theoretical outage performance is analyzed and evaluated first. Then six relay selection schemes based on different selection criteria are given. The outage performance of one of the schemes coincides with the theoretical value and all the schemes need only local CSI and can thus be implemented in a distributed way. Monte Carlo simulations validate our analysis and show that significant performance gain can be obtained compared to that of direct transmission.

关键词： cooperative communication OFDM outage probability relay selection

来源：评论

学校读者我要写书评

暂无评论

Pairing-Based Dynamic Threshold Secret Sharing Scheme

Pairing-Based Dynamic Threshold Secret Sharing Scheme

引用

6th international conference on Wireless Communications, Networking and Mobile computing (WICOM)

作者： Huang, Ye Yang, Geng Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781424437092

In this paper, we propose the PBDT, a novel secret sharing scheme which outperforms current constructions in the distributed wireless network environment. In our scheme, each participant selects his secret share respectively without negotiating with a central node. One secret share can extract several messages without renewing when new participants are added or old participants are deleted. And its share verification phase allows any participant to verify its authenticity and validity. PBDT proves to be practically efficient and computationally secure to resist collision attack, especially for distributed wireless networks.

关键词： collision attack resistance distributed wireless network environment pairing-based dynamic threshold secret sharing scheme radio networks share verification phase telecommunication security

来源：评论

学校读者我要写书评

暂无评论

Granularity-aware work-stealing for computationally-uniform Grids 10

Granularity-aware work-stealing for computationally-uniform ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Janjic, Vladimir Hammond, Kevin School of Computer Science University of St Andrews United Kingdom

ISBN: (纸本)9781424469871

Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel performance. In this paper, we show how a basic "Random-Stealing" load balancing algorithm for computational Grids can be improved by using information about the task granularity of parallel programs. We propose several strategies (SSL,SLL and LLL) for using granularity information to improve load balancing, presenting results both from simulations and from a real implementation (the Grid-GUM Runtime System for parallel Haskell). We assume a common model of task creation which subsumes both master/worker and data-parallel programming paradigms under a task-stealing work distribution strategy. Overall, we achieve improvement in runtime of up to 19.4% for irregular problems in the real implementation, and up to 40% for the simulations (typical improvements of more that 15% for irregular programs, and from 5-10% for regular ones). Our results show that, for computationally-uniform Grids, advanced load balancing methods that exploit granularity information generally have the greatest impact on reducing the runtimes of irregular parallel programs. Moreover, the more irregular the program is, the better the improvements that can be achieved. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Enhancing Muesli's data parallel skeletons for multi-core computer architectures

Enhancing Muesli's data parallel skeletons for multi-core co...

引用

IEEE international conference on High Performance computing and Communication

作者： Ciechanowicz, Philipp Kuchen, Herbert University of Münster Leonardo-Campus 3 48149 Münster Germany

ISBN: (纸本)9780769542140

Algorithmic skeletons encapsulate typical parallel programming patterns such that they can be easily applied by users. Existing skeleton libraries usually work on distributed memory machines. We present an extension of our skeleton library Muesli which now allows to use the same application without modifications on a variety of parallel machines ranging from multi-processor distributed memory to many-core shared memory machines and combinations of those such as clusters of multi-core nodes. Internally, the skeletons are based on MPI and OpenMP. We demonstrate the efficiency of our approach by providing experimental results. © 2010 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

distributed computing in accelerator physics theory and technology

Distributed computing in accelerator physics theory and tech...

引用

international conference on Computational Science (ICCS)

作者： Andrianov, S. St Petersburg State Univ Fac Appl Math & Control Proc St Petersburg 198504 Russia

This report is devoted to discussion of numerical and symbolic computing ratio in beam physics. We tray to draw attention on basic conceptual and computational problems first of all. It is known that the main problem in modern computational beam physics connected with high performance computing realization. The most of used approaches are not appropriate for computing using multiprocessing systems. Here we give some possible solutions, which based on a matrix presentation of necessary information and modern information technologies. (C) 2010 Published by Elsevier Ltd.

关键词： Beam physics Lie algebraic tools symbolic parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Evolution of the computational science community: The dynamics of topics and collaborations in 24 years of ICCS and JoCS publications

引用

Journal of Computational Science 2025年 89卷

作者： Lijing Luo Klavdiya Bochenina Tesfamariam M. Abuhay Nachyn Dorzhu George Kampis Sergey Kovalchuk Valeria Krzhizhanovskaya Maciej Paszynski Clélia de Mulatier Jack Dongarra Peter M.A. Sloot University of Amsterdam Amsterdam The Netherlands University of Helsinki Helsinki Finland University of Illinois at Chicago Chicago IL USA International Conference on Computational Science Amsterdam The Netherlands Eötvös Loránd University Budapest Hungary AGH University of Krakow Krakow Poland University of Tennessee Knoxville Tennessee United States

We analyze the topic structure of 10,299 publications from the international conference on Computational Science (ICCS) between 2001 and 2024 as well as the Journal of Computational Science (JoCS) between 2010 and 2023, using natural language processing techniques and network analysis. The computational science classification corpus was created into 15 main disciplines and 256 sub-disciplines sourced from Wikipedia. Among the 15 main disciplines, machine learning became the most popular topic after 2019, surpassing parallel & distributed computing, which peaked in the early 2010s. ICCS and JoCS show differences in research popularity in both first and second-level disciplines. Algorithm theory, Mathematical modeling, and network science are the most dominant topics in both ICCS and JoCS. Different disciplines present different trends in ICCS and JoCS. In the past 24 years, machine learning related topics have gained the most attention in both ICCS and JoCS. We also examined and compared the correlation between the trends in ICCS and Google search Trends. The collaboration of disciplinary networks of second-level disciplines exhibits a scale-free characteristic, and the network structures have undergone significant evolution over 24 years. Moreover, different disciplinary communities exhibit different ”introverted” and ”extroverted” community characteristics within the network. Additionally, we examined the life span of thematic workshops and the evolution of authors’ collaborations inside and after ICCS.

关键词： Natural language processing Computational science Topic classification Topic modeling Network analysis Scientometrics Author network ICCS JoCS

来源：评论

学校读者我要写书评

暂无评论

Cloud computing model based on MPI and OpenMP

Cloud computing model based on MPI and OpenMP

引用

2010 2nd international conference on Computer Engineering and Technology, ICCET 2010

作者： Peng, Ying Wang, Fang College of Computer Science and Technology Southwest University for Nationalities Chengdu China

ISBN: (纸本)9781424463503

According to the features of Message Passing Interface (MPI) and OpenMP, the cloud computing application methods based on MPI and OpenMP, including the MPI and OpenMP cloud computing algorithm design model, cloud computing principles, the core model, and the process are proposed. The distributed characteristic and parallel characteristic are introduced. Theoretical analysis results show this algorithm is feasible, effective and superior to the traditional parallel technology, and it can provide the new method to distribute and parallelize the ordinary algorithms. © 2010 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：