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

Symposium on Applications and the Internet (SAINT)

作者： Wen-chung Shih Chao-tung Yang Chun-jen Chen Shian-shyong Tseng Department of Computer Science National Chiao Tung University Hsinchu Taiwan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Department of Information Science and Applications Asia University Taichung Taiwan

Parallel loop scheduling on grid environments is a challenging problem, especially for loops with irregular workload distribution. In the past, this problem of load imbalance resulting from irregular workload was not explicitly addressed. This paper proposes a new approach to schedule loop iterations with irregular workload on grid environments. Based on knowledge-based estimation of workload, the proposed method can dispatch an appropriate proportion of workload to each node for execution according to its performance. In addition, the scheduler uses historical statistics of CPU usage and network bandwidth to estimate the dynamically changing performance of each node. Two applications, regular type and irregular one respectively, are implemented and executed on a grid test-bed, which consists of four schools. Experimental results show that the new approach improves the performance on previous schemes

关键词： Grid computing Processor scheduling Concurrent computing Distributed computing computer science Application software Internet Bandwidth Testing Middleware

来源：评论

学校读者我要写书评

暂无评论

Lattice Boltzmann algorithms for fluid turbulence

Lattice Boltzmann algorithms for fluid turbulence

引用

department of Defense - HPCMP Users Group Conference 2007;high performance computing Modernization Program: A Bridge to Future Defense, DoD HPCMP UGC

作者： Vahala, George Yepez, Jeffrey Soe, Min Vahala, Linda Ziegeler, Sean Department of Physics College of William and Mary Williamsburg VA United States Hanscom Field MA United States Department of Mathematics and Science Rogers State University Claremore OK United States Department of Electrical and Computer Engineering Old Dominion University Norfolk VA United States High Performance Computing Modernization Program Mississippi State University MS United States

ISBN: (纸本)0769530885

Lattice Boltzmann algorihms are a mesoscopic representation of nonlinear continuum physics (like Navier-Stokes, magnetohydrodynamics (MHD), Gross-Pitaevskii equations) which are ideal for parallel supercomputers because they transform the difficult nonlinear convective macroscopic derivatives into purely local moments of distribution functions. The macroscopic nonlinearities are recovered by relaxation distribution functions in the collision operator whose dependence on the macroscopic velocity is algebraically nonlinear and thus purely local. Unlike standard computational fluid dynamics codes, there is no loss in parallelization in handling arbitrary geometric boundaries, e.g., using bounce-back rules from kinetic theory. By encoding detailed balance into the collision operator through the introduction of discrete H-function, the lattice Boltzmann algorithm can be made unconditionally stable for arbitrary high Reynolds numbers. It is shown that this approach is a special case of a quantum lattice Boltzmann algorithm that entangles local qubits through unitary collision operators and which is ideally parallelized on quantum computer architectures. Here we consider turbulence simulations using 2,048 PEs on a 1,6003-spatial grid. A connection is found between the rate of change of enstrophy and the onset of laminar-to-turbulent flows. © 2007 IEEE.

关键词： Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Lattice Boltzmann Algorithms for Fluid Turbulence

Lattice Boltzmann Algorithms for Fluid Turbulence

引用

DoD high performance computing Modernization Program Users Group

作者： G. Vahala J. Yepez M. Soe L. Vahala S. Ziegeler Department of Physics The College of William and Mary Williamsburg VA USA U.S. Air Force Research Laboratory MA USA US Air Force Research Laboratory (AFRL) Hanscom Field MA Department of Mathematics and Science Rogers State University Claremore OK USA Department of Electrical & Computer Engineering Old Dominion University Norfolk VA USA High Performance Computing Modernization Program Mississippi State University MS

Lattice Boltzmann algorihms are a mesoscopic representation of nonlinear continuum physics (like Navier-Stokes, magnetohydro dynamics (MHD), Gross- Pitaevskii equations) which are ideal for parallel supercomputers because they transform the difficult nonlinear convective macroscopic derivatives into purely local moments of distribution functions. The macroscopic nonlinearities are recovered by relaxation distribution functions in the collision operator whose dependence on the macroscopic velocity is algebraically nonlinear and thus purely local. Unlike standard computational fluid dynamics codes, there is no loss in parallelization in handling arbitrary geometric boundaries, e.g., using bounce-back rules from kinetic theory. By encoding detailed balance into the collision operator through the introduction of discrete H-function, the lattice Boltzmann algorithm can be made unconditionally stable for arbitrary high Reynolds numbers. It is shown that this approach is a special case of a quantum lattice Boltzmann algorithm that entangles local qubits through unitary collision operators and which is ideally parallelized on quantum computer architectures. Here we consider turbulence simulations using 2,048 PEs on a 1,6003-spatial grid. A connection is found between the rate of change of enstrophy and the onset of laminar-to- turbulent flows.

关键词： Lattice Boltzmann methods Magnetohydrodynamics Distribution functions Quantum computing Quantum entanglement Physics Fluid dynamics Navier-Stokes equations Nonlinear equations Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Towards design of a file location selection system in grid environments

Towards design of a file location selection system in grid e...

引用

1st International Conference on Hybrid Information Technology

作者： Wu, Tsung-Ying Li, Kuan-Ching Wang, Hsiao-Hsi Hsu, Ching-Hsien Cheng, Kuo-Yang Su, Wei-Shun Lee, Ming-Hsiao National Center of High-performance Computing Taiwan Department of Computer Science and Information Engineering Providence University Taiwan Department of Computer Science and Information Engineering Chung Hua University Taiwan

ISBN: (纸本)9780769526744

Data Grid is one of key factors to build up large-scale dataset storage system and providing high performance computing capacity, by connecting distributed resources in the Grid. One major challenge in data grids is how to provide good and timely access to huge amount of data in distributed locations, given the high latency of interconnection networks. Parallel downloading methods can improve download efficiency and performance, but the download process should have started from appropriate locations for such achievement. In this paper, we present the design of Location Selection System (LSS) for data grid environments, aiming at the problem of downloading locations. The proposed Location Selection System (LSS) not only provides users for setting their own priority strategies, but also provides two downloading modes, manual and automatic. The proposed techniques included as middleware over data grid platforms optimize Me downloads, by improving its efficiency and performance.

关键词： data grid SRB data location selection file selection

来源：评论

学校读者我要写书评

暂无评论

Implementation of a dynamic adjustment mechanism with efficient replica selection in data grid environments 06

Implementation of a dynamic adjustment mechanism with effici...

引用

2006 ACM Symposium on Applied computing

作者： Yang, Chao-Tung Yang, I.-Hsien Chen, Chun-Hsiang Wang, Shih-Yu High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan

ISBN: (纸本)1595931082

The co-allocation architecture was developed in order to enable parallel downloading of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finishing time among replica servers. In this paper, we propose a dynamic coallocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time. We also provide an effective scheme for reducing the cost of reassembling data blocks. Copyright 2006 ACM.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Study on Parallel computing

引用

Journal of computer science & Technology 2006年第5期21卷 665-673页

作者：陈国良孙广中张云泉莫则尧 Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 P.R. China Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 P.R. China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Beijing 100088 P.R. China

In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.

关键词： parallel computing parallel architecture parallel programming parallel algorithm parallel application

来源：评论

学校读者我要写书评

暂无评论

Elliptic curve cryptography engineering

Elliptic curve cryptography engineering

引用

作者： Cilardo, Alessandro Coppolino, Luigi Mazzocca, Nicola Romano, Luigi Computer Science Department University Federico II Naples 80125 Italy High-Performance and Reliable Computing Computer and System Engineering Department University of Naples Federico II Italy Department for Technologies University of Naples Parthenope International Program Committees

In recent years, elliptic curve cryptography (ECC) has gained widespread exposure and acceptance, and has already been included in many security standards. engineering of ECC is a complex, interdisciplinary research field encompassing such fields as mathematics, computer science, and electrical engineering. In this paper, we survey ECC implementation issues as a prominent case study for the relatively new discipline of cryptographic engineering. In particular, we show that the requirements of efficiency and security considered at the implementation stage affect not only mere low-level, technological aspects but also, significantly, higher level choices, ranging from finite field arithmetic up to curve mathematics and protocols. © 2006 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Using PVFS2 to Construct a Large File System in Data Grids

Using PVFS2 to Construct a Large File System in Data Grids

引用

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

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

Grid technology is the great progress of network after Internet, since grid enables the integrated and collaborative use of distributed computing resources owned and managed by multiple organizations, available over a local or wide area network. In this paper, we provided a data grid platform with integrated storage to solve such data grid problems by using PVFS2 to increase the data storage space. The experimental results presented show the effectiveness of such proposed combination of technologies

关键词： File systems Space technology IP networks Collaboration Distributed computing computer network management Resource management Technology management Wide area networks Memory

来源：评论

学校读者我要写书评

暂无评论

A Workflow-based Computational Resource Broker with Information Monitoring in Grids

A Workflow-based Computational Resource Broker with Informat...

引用

International Conference on Grid and Cooperative computing (GCC)

作者： Chao-Tung Yang Cheng-Fang Lin Sung-Yi Chen Taiwan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

As grid computing becomes a reality, a resource broker is needed to manage and monitor available resources. This work presents a workflow-based computational resource broker whose main function is to match available resources with user requests and consider network information status during matchmaking. The resource broker provides a uniform interface for accessing available and the appropriate resources via user credentials. We utilize the NWS tool to monitor the network-related information and resources status. Also, we constructed a grid platform using Globus Toolkit that integrates the distributed resources of five universities in Taichung, Taiwan, where the resource broker is developed. As a result, the proposed broker provides secure and updated information about available resources and serves as a link to the diverse systems available in the grid

关键词： Grid computing Resource management Middleware Access protocols computerized monitoring Information security computer networks Portals computer interfaces Web services

来源：评论

学校读者我要写书评

暂无评论

A Information Monitoring and Job Scheduling System for Multiple Linux PC Clusters

A Information Monitoring and Job Scheduling System for Multi...

引用

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

作者： Chao-Tung Yang Chun-Sheng Liao Ping-I Chen Hao-Yu Tung Taiwan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

Managing and monitoring a cluster is both a tedious and challenging task, since each computing node is designed as a stand-alone system rather than a part of a parallel architecture. In this paper, a software system that allows the centralized administration of a generic Beowulf cluster is proposed. This system also provides Web services and applications to monitor multiple PC clusters with job submission and scheduling

关键词： Linux Portals Master-slave Concurrent computing Web services File servers Databases computerized monitoring Processor scheduling Job design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：