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

Accurate data and context management in message-passing programs 12th

12th International Workshop on Languages and Compilers for parallel computing, LCPC 1999

作者： Chakrabarti, Dhruva R. Banerjee, Prithviraj Center for Parallel and Distributed Computing ECE Dept Northwestern University 2145 Sheridan Road EvanstonIL60208-3118 United States

ISBN: (纸本)9783540678588

This paper presents a novel scheme for maintaining accurate information about distributed data in message-passing programs. The ability to maintain dynamically the data-to-processor mapping as well as the program contexts at which state changes occur enable a variety of sophisticated optimizations. The algorithms described in this paper are based on the static single assignment (SSA) form of message-passing programs which can be used for performing many of the classical compiler optimizations during automatic parallelization as well as for analyzing user-written message-passing programs. Reaching de_nition analysis is performed on SSA-structures for determining a suitable communication point. The scheme addresses possible optimizations and shows how appropriate representation of the data structures can substantially reduce the associated overheads. Our scheme uniformly handles arbitrary subscripts in array references and can handle general reducible control flow. Experimental results for a number of benchmarks on an IBM SP-2 show a conspicuous reduction in inter-processor communication as well as a marked improvement in the total run-times. We have observed up to around 10-25% reduction in total run-times in our SSA-based schemes compared to non-SSA-based schemes on 16 processors. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

A comparative study of star graphs and rotator graphs

A comparative study of star graphs and rotator graphs

引用

23rd International Conference on parallel Processing, ICPP 1994

作者： Ponnuswamy, Subburajan Chaudhary, Vipin Parallel and Distributed Computing Laboratory Dept. of ECE Wayne State University Detroit MI 48202 United States

ISBN: (纸本)0849324939

Star graph is an extensively studied Cayley graph, considered to be an attractive alternative to the popular binary cube. The rotator graphs are a set of directed Cayley graphs introduced recently. In this paper we compare the structural and algorithmic aspects of star graphs with that of rotator graphs. In the process we present some new results for star graphs and rotator graphs. We present a formula for the number of nodes at any distance from the identity permutation in star graphs. The minimum bisection width of star and rotator graphs is obtained. Partitioning and fault tolerant parameters for both star and rotator graphs are analyzed. The node disjoint parallel paths and hence the upper bound on the fault diameter of rotator graphs are presented. We compare the minimal path routing in star and rotator graphs using simulation results. © 1994 IEEE.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A novel compilation framework for supporting semi-regular distributions in hybrid applications

A novel compilation framework for supporting semi-regular di...

引用

International Symposium on parallel Processing

作者： D.R. Chakrabarti P. Banerjee Center for Parallel and Distributed Computing ECE Department Tech.Institute Northwestern University Evanston IL USA

This paper explains how efficient support for semi-regular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work is in showing how, unlike other existing schemes, our scheme is able to minimize preprocessing overheads and maintain sophisticated communication optimizations (such as reduction of inter-processor communication during schedule generation and sharing of communicated information between regular and irregular accesses) even in the presence of semi-regular distributions. It is only natural that preprocessing overheads associated with semi-regular distributions be intermediate between those involved for regular and irregular distributions. This paper shows how various properties can be inferred for semi-regular distributions. These allow the use of the interval representation which in turn reduces the preprocessing overhead and makes possible compatible code generation for hybrid references. Experimental results on a 16-processor IBM SP-2 for a number of sparse applications using semi-regular distributions show that our scheme is feasible.

关键词： Sparse matrices Runtime Hybrid power systems Contracts Concurrent computing Costs Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for managing a parallel heap

引用

parallel Algorithms and Applications 1994年第3-4期4卷 281-299页

作者： Das, Sajal K. Horng, Wen-Bing Moon, Gyo S. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX 76203-6886 United States Dept. of Computer Science and Information Engineering Tamkang Univ Tamsui Taipei Taiwan

We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read exclusive-write (EREW), parallel random access machine (PRAM) model. We also analyze the time and space complexities of our algorithm, which efficiently employs p processors in the range 1 ≤ p ≤ n, where n is the maximum number of items in the parallel heap. It is assumed that a delete-think-insert cycle is repeatedly performed, and each processor requires an arbitrary but the same amount of time (called the think time) for processing an item which in turn generates at most two new items. The use of a global data structure for each level of the heap helps reduce the working memory space required. The time complexity for deleting p items of the highest priority from the parallel heap is O(log p), while that for inserting at most 2p new items is O(log n). With or without incorporating the think time, the speedup of our algorithm is shown to be linear, i.e. O(p). Hence this algorithm is an improvement in time over the one proposed by Deo and Prasad [5, 6]. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Data structure EREW PRAM Heap Linear speedup parallel algorithm Priority queue

来源：评论

学校读者我要写书评

暂无评论

An efficient uniform run-time scheme for mixed regular-irregular applications 98

An efficient uniform run-time scheme for mixed regular-irreg...

引用

Proceedings of the 12th international conference on Supercomputing

作者： Dhruva R. Chakrabarti Nagaraj Shenoy Alok Choudhary Prithviraj Banerjee Center for Parallel and Distributed Computing ECE Dept. Tech. Institute Northwestern University 2145 Sheridan Road Evanston IL

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

ITRE 2005 - 3rd International Conference on Information Technology: Research and Education

作者： Li, Kuan-Ching Yang, Chao-Tung Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Shalu Taichung 43301 Taiwan High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung City Taichung 40704 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 supercomputing 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. © 2005 IEEE.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

The anatomy of a course in cluster and grid computing

The anatomy of a course in cluster and grid computing

引用

ITRE 2005 - 3rd International Conference on Information Technology: Research and Education

作者： Yang, Chao-Tung Li, Kuan-Ching High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung City Taichung 40704 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Shalu Taichung 43301 Taiwan

ISBN: (纸本)0780389328

Cluster and grid computing is a relatively new interdisciplinary field, where computer science, engineering and computational biology as 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 will 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. © 2005 IEEE.

关键词： Education

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel loop self-scheduling on grid environments

引用

IFIP International Conference on Network and parallel computing, NPC 2004

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540233881

The approaches to deal with scheduling and load balancing on PC-based cluster systems are famous and well-known. Self-scheduling schemes, which are suitable for parallel loops with independent iterations on cluster computer system, they have been designed in the past. In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PC-based cluster and grid computing environments in order to improve system performance. A grid computing environment consists of multiple PC-based clusters is constructed using Globus Toolkit and SUN Grid Engine middleware. The experimental results show that our scheduling can result in higher performance than other similar schemes. © IFIP International Federation for Information Processing 2004.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

On design of cluster and grid computing environment toolkit for bioinformatics applications∗ 6th

引用

6th International Workshop on distributed computing, IWDC 2004

作者： Yang, Chao-Tung Kuo, Yu-Lun Li, Kuan-Ching Gaudiot, Jean-Luc High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung40744 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung43301 Taiwan Parallel and Scalable Computer Architecture Laboratory Dept. of Electrical Engineering and Computer Science University of California – Irvine IrvineCA92697 United States

ISBN: (纸本)9783540240761

In this paper, we present BioGrid, a novel computing resource that combines advantages of grid computing technology with bioinformatics parallel applications. The grid environment permits the sharing of a large amount of idle computing resources and data. The investigation of bioinformatics demands orders of magnitude of computing resources and in parallel, the biological data are growing in such a high speed. By using BioGrid, we plan to integrate and share resources and biological data using the grid computing technology. Still in this paper, the well-known FASTA application is performed as matter of testing and analysis in our grid computing platform, as goal to show the improved efficiency and reduced computation time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Applying linux high-availability and load balancing servers for video-on-demand (Vod) systems

Applying linux high-availability and load balancing servers ...

引用

5th Pacific Rim Conference on Multimedia, PCM 2004

作者： Yang, Chao-Tung Wang, Ko-Tzu Li, Kuan-Ching Lee, Liang-Teh High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung433 Taiwan Dept. of Computer Science and Engineering Tatung University Taipei104 Taiwan

ISBN: (纸本)9783540239772

In this research paper, we integrate and implement High-Availability (HA) and Load-Balancing technologies to clusters of workstations, increasing both the availability and scalability of services and resources in these systems. The cluster of workstations is commonly built and used as web-based VOD servers. Thus, this paper presents the hardware and software configurations of cluster systems working as VOD servers. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：