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

International Symposium on Parallel and Distributed computing

作者： Ali Mohammed Ahmed Eleliemy Florina M. Ciorba Franziska Kasielke Ioana Banicescu Department of Mathematics and Computer Science University of Basel Switzerland Center for Information Services and High Performance Computing Technische Universität Dresden Germany Department of Computer Science and Engineering Mississippi State University USA

Scientific applications are often irregular and characterized by large computationally-intensive parallel loops. Dynamic loop scheduling (DLS) techniques improve the performance of computationally-intensive scientific applications via load balancing of their execution on high-performance computing (HPC) systems. Identifying the most suitable choices of data distribution strategies, system sizes, and DLS techniques which improve the performance of a given application, requires intensive assessment and a large number of exploratory native experiments (using real applications on real systems), which may not always be feasible or practical due to associated time and costs. In such cases, simulative experiments are more appropriate for studying the performance of applications. This motivates the question of 'How realistic are the simulations of executions of scientific applications using DLS on HPC platforms?' In the present work, a methodology is devised to answer this question. It involves the experimental verification and analysis of the performance of DLS in scientific applications. The proposed methodology is employed for a computer vision application executing using four DLS techniques on two different HPC platforms, both via native and simulative experiments. The evaluation and analysis of the native and simulative results indicate that the accuracy of the simulative experiments is strongly influenced by the approach used to extract the computational effort of the application (FLOP-or time-based), the choice of application model representation into simulation (data or task parallel) and the available HPC subsystem models in the simulator (multi-core CPUs, memory hierarchy and network topology). The minimum and the maximum percent errors achieved between the native and the simulative experiments are 0.95% and 8.03%, respectively.

关键词： Dynamic scheduling Analytical models Task analysis Computational modeling Power capacitors Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Modeling of service-level agreements for composed services 13th

引用

13th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, DSOM 2002

作者： Daly, David Kar, Gautam Sanders, William H. Center for Reliable and High-Performance Computing Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States IBM T.J. Watson Research Center P.O.Box 704 Yorktown HeightsNY10598 United States

ISBN: (纸本)3540000801

As Web services are increasingly accepted and used, the next step for them is the development of hierarchical and distributed services that can perform more complex tasks. In this paper, we focus on how to develop guarantees for the performance of an aggregate service based on the guarantees provided by the lower-level services. In particular, we demonstrate the problem with an example of an e-commerce Web site implemented using Web services. The example is based on the Transaction Processing performance Council (TPC) TPC-W Benchmark [8], which specifies an online store complete with a description of all the functionality of the site as well as a description of how customers use the site. We develop models of the site’s performance based on the performance of two sub-services. The model’s results are compared to experimental data and are used to predict the performance of the system under varying conditions. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

On implementation of an enhanced and integrated parallel programming Web-based toolkit

On implementation of an enhanced and integrated parallel pro...

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Kuan-Ching Li Chao-Tung Yang Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan High Performance Computing Laboratory Department of Computer Science and Infnmation Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0780389328

The computing power provided by high performance and low cost PC-based clusters and grid computing platforms are attractive and they are equal or superior to supercomputers and mainframes. In parallel, discussions on how to obtain more computing power from these computing platforms become an interesting issue. The development of applications for these high-performance computing platforms is complicated for several reasons: the complexity of applications themselves, which combines aspects of super computing and distributed computing, and by the need to achieve higher performance. This paper describes the design rationale and implementation of a parallel programming Web-based toolkit, to ease the parallel programming learning process, with the use of Web-based interface. The toolkit has widely been used in MPI parallel programming courses (both in graduate and undergraduate levels) and industry trainings.

关键词： Parallel programming Concurrent computing Application software Distributed computing Grid computing high performance computing Visualization computer science Supercomputers Industrial training

来源：评论

学校读者我要写书评

暂无评论

Single pattern search implementations in a cluster computing environment

Single pattern search implementations in a cluster computing...

引用

Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST

作者： J C Prasad K.S.M. Panicker Department of Computer Science and Engineering Federal Institute of Science and Technology MGR University Chennai Angamaly India Centre of High Performance Computing Federal Institute of Science and Technology Angamaly India

This paper provides an overview of different string matching algorithms in parallel environments. In this work, we have evaluated several algorithms, such as Knuth-Morris-Pratt, Boyer-Moore algorithm, Boyer Moore Horspool Algorithm, Zhu Takaoka algorithm, Quick Search Algorithm, BR Algorithm, Fast Searching algorithm, SSABS algorithm, TVSBS algorithm, ZTMBH algorithm and BRBMH algorithm. Static pattern of string matching algorithms are widely used for searching. For comparisons of speed different algorithms are implemented with parallel programming technique of MPI Standard, for a large text file with a pattern of small length. A Beowulf based homogenous cluster architecture was developed which has a performance of 81 Gigabits floating point operations per second in searching environment. The result of pattern searching showed the variation of performance with this customized cluster architecture for variable number of compute nodes with different pattern lengths. Nearly 80% of the searching code part works in parallel. The performance of string search algorithm is based on the network bandwidth and the selection of algorithms used. Depending on certain applications, different algorithm can be used. It is observed that the cluster searching architecture provides better speed with different algorithms. In general, from the experiments, BRBMH Algorithm is found to be efficient for a general string searching applications.

关键词： Clustering algorithms Signal processing algorithms Algorithm design and analysis computer architecture Complexity theory Program processors Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Shu-Tzu Tsai Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.

关键词： Decision trees Data mining Grid computing computer architecture Clustering algorithms Concurrent computing Distributed computing computer science Application software Chaos

来源：评论

学校读者我要写书评

暂无评论

The anatomy of a course in cluster and grid computing

The anatomy of a course in cluster and grid computing

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Chao-Tung Yang Kuan-Ching Li High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0780389328

Cluster and grid computing is a relatively new interdisciplinary field, where computer science, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipline brings to computer science faculty members new opportunities and challenges, both in education and in research. In this paper, we explore issues in teaching cluster and grid computing, the developing of curricula, and thoughts to foster student to work on research projects in cluster and grid computing.

关键词： Anatomy Grid computing Distributed computing Concurrent computing computer networks Brain modeling Predictive models computer science Education Space technology

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated DNA distance matrix computation

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGri...

引用

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGrid 2011 2011年 42-47页

作者： Ying, Zhi Lin, Xinhua See, Simon Chong-Wee Li, Minglu Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Institute of High Performance Computing AStar Singapore Singapore NVIDIA Corporation United States Shanghai Key Laboratory of Scalable Computing and Systems China

ISBN: (纸本)9780769544724

Distance matrix calculation used in phylogeny analysis is computational intensive. The growing sequences data sets necessitate fast computation method. This paper accelerate Felsenstein's DNADIST program by using OpenCL to exploit the great computation capability of graphic card. The GPU-accelerated DNADIST program achieves more than 12-fold speedup over the serial CPU program on a personal workstation with a 2.66GHz quad-core Intel CPU and an AMD HD5850 graphics card. And dual HD5850 cards on the same platform perform linear improvement of 24-fold speedup. The program also shows good performance portability by achieving 16-fold speedup with a NVIDIA Tesla C2050 card. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Scalability Analysis and Evaluation of Divisible Load Scheduling

Scalability Analysis and Evaluation of Divisible Load Schedu...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Mahadevan Balasubramaniam Ioana Banicescu Florina M. Ciorba Department of Computer Science & Engineering Mississippi State University Mississippi USA Center for Information Services and High Performance Computing Technische Universität Dresden Germany

ISBN: (纸本)9781479956166

In this work, we address the problem of the scalability of divisible load scheduling of data parallel workloads (also called arbitrarily divisible workloads) on high performance parallel and distributed computing systems. Divisible load theory offers a linear, deterministic, and tractable model for scheduling arbitrarily divisible workloads, often encountered in scientific applications. With the continuous increasing problem and the system sizes, it is imperative that application scheduling algorithms scale well to leverage the processing capabilities of the high performance computing systems. We conduct an analytical evaluation as well as a simulation-based study of the scalability of divisible load scheduling algorithms, called DLT algorithms, when applied for scheduling two NAS parallel benchmarks, namely, the embarrassingly parallel (EP) and the integer sort (IS) benchmarks onto a target system modeled as a 3-d torus topology. The EP benchmark is computationally intensive and the IS benchmark is communication intensive. Two questions related to the scalability study are addressed, namely, the fastest time to solve the problem and the condition for cost-optimality. A simulation-based study was conducted to support and verify the solutions obtained via the analytical model.

关键词： Benchmark testing Computational modeling Scalability Load modeling Mathematical model Processor scheduling Runtime

来源：评论

学校读者我要写书评

暂无评论

Impedance responses and size-dependent resonances in topolectrical circuits via the method of images

引用

Physical Review B 2023年第24期107卷 245114-245114页

作者： Haydar Sahin Zhuo Bin Siu S. M. Rafi-Ul-Islam Jian Feng Kong Mansoor B. A. Jalil Ching Hua Lee Department of Electrical and Computer Engineering National University of Singapore Singapore 117583 Singapore Institute of High Performance Computing Agency for Science Technology and Research (A*STAR) Singapore 138632 Singapore Department of Physics National University of Singapore Singapore 117542 Singapore

Resonances in an electric circuit occur when capacitive and inductive components are present together. Such resonances appear in admittance measurements depending on the circuit's parameters and the driving AC frequency. In this study, we analyze the impedance characteristics of nontrivial topolectrical circuits such as one- and two-dimensional Su-Schrieffer-Heeger circuits and reveal that size-dependent anomalous impedance resonances inevitably arise in finite LC circuits. Through the method of images, we study how resonance modes in a multidimensional circuit array can be nontrivially modified by the reflection and interference of current from the structure and boundaries of the lattice. We derive analytic expressions for the impedance across two corner nodes of various lattice networks with homogeneous and heterogeneous circuit elements. We also derive the irregular dependency of the impedance resonance on the lattice size, and provide integral and dimensionally reduced expressions for the impedance in three dimensions and above.

关键词： Edge states Electrical conductivity Impedance Resistive switching Topological insulators Electronic structure Band structure methods Bloch wave theory Classical electromagnetism Tight-binding model

来源：评论

学校读者我要写书评

暂无评论

A multiple-objective workflow scheduling framework for cloud data analytics

A multiple-objective workflow scheduling framework for cloud...

引用

International Joint Conference on computer science and Software engineering (JCSSE)

作者： Orachun Udomkasemsub Li Xiaorong Tiranee Achalakul Computer Engineering Department King Mongkut's University of Technology Bangkok Thailand Institute of High Performance Computing (IHPC) Agency for Science Technology and Research Singapore

One of the most important characteristics of a cloud system is elasticity in resources provisioning. Cloud fabric often composes of massive and heterogeneous types of resources allowing the sciences and engineering applications in many domains to collaboratively utilize the infrastructure. As the cloud systems are designed for a large number of users, a large volume of data, and various types of applications, efficient task management is needed for cloud data analytics. One of the popular methods used in task management is to represent a set of tasks with a workflow diagram, which can capture task decomposition, communication between subtasks, and cost of computation and communication. In this paper, we proposed a workflow scheduling framework that can efficiently schedule series workflows with multiple objectives onto a cloud system. Our designed framework uses a meta-heuristics method, called Artificial Bee Colony (ABC), to create an optimized scheduling plan. The framework allows multiple constraints and objectives to be set. Conflicts among objectives can also be resolved using Pareto-based technique. A series of experiments are then conducted to investigate the performance in comparison to the algorithms often used in cloud scheduling. Results show that our proposed method is able to reduce 57% cost and 50% scheduling time within a similar makespan of HEFT/LOSS for a typical scientific workflow like Chimera-2.

关键词： Processor scheduling Schedules Scheduling Algorithm design and analysis Optimization Genetic algorithms Equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：