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

International Conference on Advanced Learning Technologies (ICALT)

作者： Chao-Tung Yang Hsin-Chuan Ho Chien-Tung Pan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

In recent years, e-learning has become a popular method of learning. Generally, an e-learning platform which provided multi-media content required a high capacity storage device such as NAS (network attached storage) or SAN (storage area network). However, many schools with insufficient budgets cannot afford this type of expensive equipment. Thus, we employ grid computing and PVFS (parallel virtual file system) technology to integrate the idling storage resources in the school as a means to substitute the purchase of an expensive high-level storage server. In this research we will link several sets of PCs in the school to make them armed with the storage and computing capacity like that of a high-end server. We hope the goal of sharing and reuse of resources among the schools can be achieved.

关键词： Grid computing Electronic learning Educational institutions Education Space technology Storage area networks Material storage File systems Network servers Video on demand

来源：评论

学校读者我要写书评

暂无评论

performance Evaluation of SLIM and DRBL Diskless PC Clusters on Fedora Core 3

Performance Evaluation of SLIM and DRBL Diskless PC Clusters...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Chao-Tung Yang Ping-I Chen Ya-Ling Chen High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

In this paper, we introduce our experiments on SLIM and DRBL diskless PC clusters. We constructed them by using 16 machines and only one disk. We run the matrix multiplication and bioinformatics software to evaluate their performance. We find that the performance of SLIM has a great improvement, and the system setup time is much less than before. The network loading of DRBL is also very high. The system boot-up time is no difference between these two systems. The best way to construct the diskless Linux cluster is to eliminate the image size. It can make the nodes have more memory space to handle the program and ease the network loading.

关键词： Linux Network servers Space technology File systems Bioinformatics computer science Software performance Personal communication networks Hard disks Chaos

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing

Decision tree construction for data mining on grid computing

引用

IEEE International Conference on e-Technology, e-Commerce and e-Service

作者： Shu-Tzu Tsai Chao-Tung Yang High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0769520731

Decision tree is one of the frequently used methods in data mining for searching prediction information. Due to its characteristics which are suitable for parallelism, it has been widely adopted in high performance field and developed into various parallel decision tree algorithms to deal with huge data and complex computation. Following the development of other technology fields, grid computing is regarded as the extension of PC cluster and therefore it future research development is highly valued. This new wave of Internet application is the 3rd generation of Internet applications following the traditional Internet and Web application. We have presented a grid-based decision tree architecture, and hope it can be applied on both parallel and sequential algorithms for the decision tree applications. Also, based on the scope and model of data mining applied in grid environment as well as user equivalent perspective, grid roles can be categorized into three types. We are hoping that through these definitions, software developers can define clear system processes and differentiate the application scope for software applications. To fulfil our architecture, we first apply an existing parallel decision tree algorithm-SPRINT algorithm in the grid environment. The performance and differences in many other areas are compared using different sizes of dataset. The experimental results are used for future reference and further development.

关键词： Decision trees Data mining Grid computing Internet Application software Clustering algorithms computer architecture Parallel processing Concurrent computing high performance computing

来源：评论

学校读者我要写书评

暂无评论

Implementation of a Diskless Cluster computing Environment in a computer Classroom

Implementation of a Diskless Cluster Computing Environment i...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Chao-Tung Yang Wen-Feng Hsieh Hung-Yen Chen High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

The objective of this paper is to implement and evaluate a cluster computing environment by clustering idle PCs (personal computer) with Diskless slave nodes on campuses in order to obtain the effectiveness of the largest computer potency. Two sets of cluster platforms BCCD and DRBL are used to compare parallel computing performance. The objective is to prove that DRBL has better performance than BCCD in this experiment. In order to achieve the objective of a platform for Free Software Teaching, DRBL is applied to the computer classroom, enabling PCs to be manually or automatically switched among different OS (operating system) of Windows, Free Software Teaching and PC Cluster. The bioinformatics program, mpiBLAST, is executed smoothly in the Cluster architecture as well. Through comparing various aspects of performance, including performance of Switch, Swap, this paper is attempted to find out the best Cluster environment in computer classroom at school. Finally, HPCC is used to demonstrate Cluster performance.

关键词： Parallel processing Linux Software maintenance Personal communication networks Education Operating systems Switches Educational institutions Hard disks Network servers

来源：评论

学校读者我要写书评

暂无评论

A Data Grid File Replication Maintenance Strategy Using Bayesian Networks

A Data Grid File Replication Maintenance Strategy Using Baye...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Chao-Tung Yang Chien-Jung Huang Ting-Chih Hsiao High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

Data grids are a very important and useful technique for solving problems created by the large amounts of data scientific experiments and simulations produce. Data replication, a technique much discussed by data grid researchers in past years, creates multiple copies of files and stores them in convenient locations to shorten file access times. In this paper, we propose a dynamic replication maintenance service for maintaining data in grid environments. Replicas are adjusted to appropriate locations using Bayesian Networks (BN). The maintenance strategy we propose is called Implicit Dynamic Maintenance Service with Bayesian Network (IDMSBN).

关键词： Bayesian methods Grid computing Computational modeling computer networks Bandwidth Frequency Distributed computing Middleware Resource management Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Frontiers in Algorithmics 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Xiaotie Deng John E. Hopcroft Jinyun Xue

ISBN: (数字)9783642022708

ISBN: (纸本)9783642022692

This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.

关键词： Data Structures Mathematics of computing Artificial Intelligence Algorithm Analysis and Problem Complexity Discrete Mathematics in computer science Software engineering/Programming and Operating Systems

来源：评论

学校读者我要写书评

暂无评论

Data mining analysis to validate performance tuning practices for HPL

Data mining analysis to validate performance tuning practice...

引用

2009 IEEE International Conference on Cluster computing and Workshops, CLUSTER '09

作者： Tan, Tuan Zea Mong Goh, Rick Siow March, Verdi See, Simon Advanced Computing Institute of High Performance Computing Singapore Singapore Asia-Pacific Science and Technology Center Sun Microsystems Inc. Department of Computer Science National University of Singapore Singapore Department of Mechanical and Aerospace Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781424450121

Applications performance is a criterion for system evaluation, and hence performance tuning for these applications is of great interest. One such benchmark application is high performance Linpack (HPL). Although guidelines exist for HPL tuning, validating these guidelines on various systems is a challenging task as a large number of configurations need to be tested. In this work, we use data mining analysis to reduce the number of configurations to be tested in validating the HPL tuning guidelines on the Ranger System. We validate that NB, P and Q are the three most important parameters to tune HPL, and that PMAP does not have a significant impact on HPL performance. We also validate the practice of tuning HPL at small N using data mining analysis. We find that the value of N selected for tuning should not be significantly smaller than the largest N that can fit into the system memory. Our results indicate that data mining could be further applied to application performance tuning. © 2009 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A framework of user-driven data analytics in the cloud for course management

A framework of user-driven data analytics in the cloud for c...

引用

18th International Conference on computers in Education: Enhancing and Sustaining New Knowledge Through the Use of Digital Technology in Education, ICCE 2010

作者： Zhang, Jie Tjhi, William Chandra Lee, Bu Sung Lee, Kee Khoon Vassileva, Julita Looi, Chee Kit School of Computer Engineering Nanyang Technological University Singapore A Star Institute of High Performance Computing Singapore Department of Computer Science University of Saskatchewan Canada Centre of Excellence for Learning Innovation National Institute of Education Singapore

ISBN: (纸本)9789834251253

In this paper, we describe our goal of an effective course management system for assisting course managers to make informed decisions about what materials should be most appropriate to be presented to students (learners) and what learning strategies or methods should be used for the students. The system is supported by our design of a novel framework for user-driven data analytics in the cloud. Different modules of the framework will be illustrated in detail in the context of course management.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for longest common subsequence problem on GPUs

An efficient parallel algorithm for longest common subsequen...

引用

作者： Yang, Jiaoyun Xu, Yun Shang, Yi Key Laboratory on High Performance Computing Anhui Province China College of Computer Science and Technology University of Science and Technology of China Heifei Anhui China Department of Computer Science University of Missouri Columbia MO United States

ISBN: (纸本)9789881701299

Sequence alignment is an important problem in computational biology and finding the longest common subsequence (LCS) of multiple biological sequences is an essential and effective technique in sequence alignment. A major computational approach for solving the LCS problem is dynamic programming. Several dynamic programming methods have been proposed to have reduced time and space complexity. As databases of biological sequences become larger, parallel algorithms become increasingly important to tackle large size problems. In the meantime, general-purpose computing on graphics processing units (GPGPU) has emerged as a promising technology for cost-effective high performance computing. In this paper, we develop an efficient parallel algorithm on GPUs for the LCS problem. We propose a new technique that changes the data dependency in the score table used by dynamic programming algorithms to enable higher degrees of parallelism. The algorithm takes advantage of the large number of processing units and the unique memory-accessing properties of GPUs to achieve high performance. The algorithm was implemented on Nvidia 9800GT GPUs and tested on randomly generated sequences of different lengths. The experiment results show that the new algorithm is about 6 times faster on GPUs than on typical CPUs and is 3 times faster than an existing efficient parallel algorithm, the diagonal parallel algorithm.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

DISCRETE ENERGY ANALYSIS OF THE THIRD-ORDER VARIABLE-STEP BDF TIME-STEPPING FOR DIFFUSION EQUATIONS

引用

Journal of Computational Mathematics 2023年第2期41卷 325-344页

作者： Hong-lin Liao Tao Tang Tao Zhou Department of Mathematics Nanjing University of Aeronautics and AstronauticsNanjing 211106China Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles(NUAA) MIITNanjing 211106China Division of Science and Technology BNU-HKBU United International CollegeZhuhai 519087China Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing100190China

This is one of our series works on discrete energy analysis of the variable-step BDF *** this part,we present stability and convergence analysis of the third-order BDF(BDF3)schemes with variable steps for linear diffusion equations,see,e.g.,[SIAM ***.,58:2294-2314]and[***.,90:1207-1226]for our previous works on the BDF2 *** this aim,we first build up a discrete gradient structure of the variable-step BDF3 formula under the condition that the adjacent step ratios are less than 1.4877,by which we can establish a discrete energy dissipation ***-robust stability and convergence analysis in the L^(2) norm are then *** the mesh robustness means that the solution errors are well controlled by the maximum time-step size but independent of the adjacent time-step *** also present numerical tests to support our theoretical results.

关键词： Diffusion equations Variable-step third-order BDF scheme Discrete gradient structure Discrete orthogonal convolution kernels Stability and convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：