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

Proceedings of the ACM Symposium on Applied computing 2007年 144-145页

作者： Yang, Chao-Tung Han, Tsu-Fen Kan, Heng-Chuan High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Southern Business Unit National Center for High-performance Computing Hsinshi Tainan County 74147 Taiwan

ISBN: (纸本)1595934804;9781595934802

In this paper, we report on implementing an experimental distributed computing application for bioinformatics consisting of basic high-performance computing environments (Grid and PC Cluster systems), multiple interfaces at user portals that provide useful graphical interfaces to enable biologists who are not IT specialists to benefit directly from the use of high-performance technology. Copyright 2007 ACM.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

Real-time Java processor optimized for RTSJ

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied computing 2007年 1540-1544页

作者： Chai, Zhilei Zhao, Wenke Xu, Wenbo Center of Intelligent and High Performance Computing School of Information Technology Southern Yangtze University Wuxi 214122 China Department of Computer Science and Engineering Fudan University 220# of Handan Rd. Shanghai 200433 China

ISBN: (纸本)1595934804;9781595934802

Due to the preeminent work of the real-time specification for Java(RTSJ), Java is increasingly expected to become the leading programming language in real-time systems. To provide a Java platform suitable for real-time applications, a real-time Java processor can execute Java bytecode directly is proposed in this paper. This processor provides efficient support in hardware for mechanisms specified in the RTSJ and offers a simpler programming model through ameliorating the scoped memory of the RTSJ. The most important characteristic of the processor is that its WCET(worst case execution time) of the bytecode execution is predictable. It is vital for the real-time systems. Copyright 2007 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Study on parallel machine scheduling problem with buffer

Study on parallel machine scheduling problem with buffer

引用

2nd International Multi-Symposiums on computer and Computational sciences 2007, IMSCCS'07

作者： Li, Shisheng Zhou, Yinghua Sun, Guangzhong Chen, Guoliang Anhui Province-MOST Key Co-lab of High Performance Computing and Its Applications Department of Computer Science University of Science and Technology of China Anhui Hefei 230027 China

ISBN: (纸本)0769530397

In [1] and [2] the authors investigate a semi on-line version of a classical parallel machine scheduling problem. In the semi on-line version, there is a buffer of length k which is available to maintain k jobs. The jobs arrive one by one and can be temporarily assigned to the buffer if the buffer is not full. The goal is to assign all jobs to m identical machines such that the makespan is minimized. For two machines, [1] presented a lower bound 4/3 of the worst-case ratio and [2] presented an optimal algorithm with a buffer of length 1. In this paper, we investigate the problem with m ≥ 2 machines. First, we design a new algorithm for Pm//Cmax with a buffer oj'length ⌊m/2 and analyze it. Second, we present some lower bounds of the worst-case ratio. ©2007 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Parallel loop scheduling using knowledge-based workload estimation on grid environments

Parallel loop scheduling using knowledge-based workload esti...

引用

2007 International Symposium on Applications and the Internet, SAINT

作者： Shih, Wen-Chung Yang, Chao-Tung Chen, Chun-Jen Tseng, Shian-Shyong Department of Computer Science National Chiao Tung University Hsinchu 30010 Taiwan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Information Science and Applications Asia University Taichung 41354 Taiwan

ISBN: (纸本)0769527566

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. © 2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

One-to-all personalized communication in torus networks

One-to-all personalized communication in torus networks

引用

IASTED International Conference on Parallel and Distributed computing and Networks, PDCN 2007

作者： Mao, Weizhen Chen, Jie Watson III, William Department of Computer Science College of William and Mary Williamsburg VA 23187 United States High Performance Computing Group Jefferson Lab. Newport News VA 23606 United States

ISBN: (纸本)9780889866379

Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each of the other processors in the network. Under the assumptions of same-size data to each processor, storeand-forward routing, and all-port processors, we formulate the one-to-all personalized communication problem as an optimization problem with the goal to minimize the total elapsed time (measured in the number of time steps) for all data to reach their respective destinations. We design an optimal algorithm based on partitioning the torus network into disjoint subnetworks. We also present a heuristic algorithm based on a greedy strategy. We implement the algorithms on two Linux clusters with Gigabit Ethernet torus connection, currently in use at the Jefferson National lab and configured as a 2-dimensional 8 x 8 torus and a 3-dimensional 4 x 8 x 8 torus, respectively. We analyze the performance of the algorithms using data collected in experiments.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Implementation of Monitoring and Information Service Using Ganglia and NWS for Grid Resource Brokers

Implementation of Monitoring and Information Service Using G...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

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

Grid computing is increasingly used by organizations to achieve high performance computing and heterogeneous resources sharing. These grids may span several domain administrations via Internet. As a result of this, it may be difficult to monitor, control and manage those machines and resources. This paper aims at providing a multi-platform grid monitoring service which can monitor resources such as CPU speed and utilization, memory usage, disk usage, and network bandwidth in a real-time manner. Monitoring data is extracted form Ganglia and NWS tools then stored and transmitted in XML form and then used for displaying. All the information is displayed using real-time graphs.

关键词： Grid computing high performance computing Bandwidth Data mining computerized monitoring Condition monitoring Resource management XML Weather forecasting Chaos

来源：评论

学校读者我要写书评

暂无评论

A dynamic file replication strategy in data grids

A dynamic file replication strategy in data grids

引用

IEEE Region 10 International Conference TENCON

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

As large amount of data that is produced by scientific experiments and simulations, data grid is a very important and useful technique to solve these kinds of problems in this region. Data replication is one technique that many researchers discuss in past years in data grid. It can create many copies of file and stored in the appropriate location to shorten the time of getting the file. In this paper, we propose a dynamical maintenance service of replication to maintain the data in grid environment. Replicas will be adjusted to the appropriate location for using. The BHR algorithm is a strategy to maintain replica dynamically. We point out a scenario that the BHR algorithm will cause a mistake when it operates. That mistake will limit the speed of transferring file. We propose the Dynamic Maintenance Service is aimed at overcoming the mistake proposed. The contributions of this paper are that the data grid environment will be more efficiency by using DMS algorithm. And the experimental results show that the DMS algorithm is more efficient than other replication strategies.

关键词： Bandwidth Delay Grid computing Computational modeling Distributed computing Resource management computer networks high performance computing Chaos laboratories

来源：评论

学校读者我要写书评

暂无评论

G-BLAST: a grid-based solution for mpiBLAST on computational grids

G-BLAST: a grid-based solution for mpiBLAST on computational...

引用

IEEE Region 10 International Conference TENCON

作者： Chao-Tung Yang Tsu-Fen Han Heng-Chuan Kan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan National Center for High-performance Computing Southern Business Unit Tainan Taiwan

The researches of bioinformatics have grown with each passing day so that more and more computing power is required for better performance. These requires usually solved by parallelism techniques, because cluster technology can reduce the execution time and increase alignment efficiency. For example, mpiBLAST is a parallelism solution of NCBI BLAST via MPI parallel programming. However, most laboratories can not build up powerful supercomputing environments. They usually connect dozen of personal computers to build cluster computing environments. Besides, cluster usually is limited by local environment that leads to extend equipments difficulty. The concepts of grid can solve these problems. Grid environments coordinate the resources of distributed virtual organizations and satisfy a great many computational demands. In this paper, we have deployed a biogrid framework called G-BLAST. G-BLAST was designed for sequence alignment to use grid environment and access mpiBLAST application from a server node. Because grid environment is a heterogeneous environment, G-BLAST is endowed with selection the most adaptive work nodes, dynamic fragmenting database, and self-adjust performance data abilities. Furthermore, we also deployed a grid service portal and a grid service GUI desk application for normal users to submit jobs and host administrators to maintain their own work nodes, and the interaction between this application and G-BLAST meets WSRF standards.

关键词： Grid computing Bioinformatics Biology computing Databases Sequences Microcomputers Application software Concurrent computing Distributed computing Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

A One-Way File Replica Consistency Model in Data Grids

A One-Way File Replica Consistency Model in Data Grids

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Chao-Tung Yang Wen-Chi Tsai Tsui-Ting Chen Ching-Hsien Hsu High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu Taiwan

In recent years, grid technology, which is frequently used to solve the scientific problem, has ripened gradually. A large number of storage resources and computational power are combined to form a data grid network to deal with massive data of scientific experiments. Data replication generates huge data which are distributed in wide-area for researches around the globe. The files of grid environments can be modified by grid users might bring a critical problem of maintaining data consistency among the several replicas distributed in different machines. For that reason how to maintain the consistency of those files is a great challenge. In this paper, we propose a Oneway Replica Consistency model in data grid environments, which is used for consistency maintenance issue. Furthermore, we anticipate striking a balance between improving data access performance and replica consistency in data grids. This work can find out the more efficient ways of utilizing storage space is an important point.

关键词： Tin Grid computing Power engineering computing computer science Power engineering and energy Earth Availability Chaos laboratories Data engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：