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

IEEE international Workshop on software engineering for parallel and distributed systems

作者： T. Rauber G. Runger Institut für Informatik Universität Halle Wittenberg Halle Germany Fachbereich Informatik Universität des Saarlandes Saarbruecken Germany

Most programs from scientific computing can benefit from the use of numerical libraries which provide efficient implementations for standard solution methods that often occur in numerical simulations. This is especially true for parallel scientific computing. A methodology that allows the integration of library functions without any additional programming effort would ease this programming style. The authors address the question how to integrate library procedures into hierarchically organized parallel programs. The hierarchical structure of a specific algorithms results from a top-down decomposition into submethods which can be realized by library functions. The integration of library functions not only requires a correct specification of data dependencies between different modules but has also to take into account a possible distribution of data among the processors. They present algorithms for the adaptation of library modules such that their functional type and underlying data distribution fit into the hierarchical framework. The adaptation includes the construction of dataflow graphs that can be used to determine data distributions for the library modules such that a minimal global execution time results.

关键词： Libraries parallel algorithms Scientific computing Functional programming Data analysis Numerical simulation Numerical models Algorithm design and analysis Computational modeling Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

4th international symposium on Solving Irregularly Structured Problems in parallel, IRREGULAR 1997

4th International Symposium on Solving Irregularly Structure...

引用

4th international symposium on Solving Irregularly Structured Problems in parallel, IRREGULAR 1997

ISBN: (纸本)3540631380

The proceedings contain 23 papers. The special focus in this conference is on Discrete Algorithms, Programming Environments and Implementations. The topics include: parallel mesh generation;efficient massively parallel quicksort;practical parallel list ranking;on computing all maximal cliques distributedly;a probabilistic model for best-first search BandB algorithms;programming irregular parallel applications in cilk;a variant of the biconjugate gradient method suitable for massively parallel computing;efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers;programming with shared data abstractions;supporting run-time parallelization of DO-ACROSS loops on general networks of workstations;engineering diffusive load balancing algorithms using experiments;comparative study of static scheduling with task duplication for distributed systems;a new approximation algorithm for the register allocation problem;improving cache performance through tiling and data alignment;a support for non-uniform parallel loops and its application to a flame simulation code;performance otimization of combined variable-cost computations and I/O;parallel software caches;communication efficient parallel searching;parallel sparse cholesky factorization and unstructured graph partitioning for sparse linear system solving.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design patterns for parallel computing using a network of processors 97

Design patterns for parallel computing using a network of pr...

引用

international symposium on High Performance distributed Computing

作者： S. Siu A. Singh Department of Electrical & Computer Engineering University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9780818681172

High complexity of building parallel applications is often cited as one of the major impediments to the mainstream adoption of parallel computing. To deal with the complexity of software development, abstractions such as macros, functions, abstract data types, and objects are commonly employed by sequential as well as parallel programming models. This paper describes the concept of a design pattern for the development of parallel applications. A design pattern in our case describes a recurring parallel programming problem and a reusable solution to that problem. A design pattern is implemented as a reusable code skeleton for quick and reliable development of parallel applications. A parallel programming system, called DPnDP (Design Patterns and distributed Processes), that employs such design patterns is described. In the past, parallel programming systems have allowed fast prototyping of parallel applications based on commonly occurring communication and synchronization structures. The uniqueness of our approach is in the use of a standard structure and interface for a design pattern. This has several important implications: first, design patterns can be defined and added to the system's library in an incremental manner without requiring any major modification of the system (extensibility). Second, customization of a parallel application is possible by mixing design patterns with low level parallel code resulting in a flexible and efficient parallel programming tool (flexibility). Also, a parallel design pattern can be parameterized to provide some variations in terms of structure and behavior.

关键词： parallel processing parallel programming Application software Libraries Programming profession software engineering software design Concurrent computing Buildings Impedance

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel and distributed topological sort algorithms

Efficient parallel and distributed topological sort algorith...

引用

Aizu international symposium on parallel Algorithms/Architecture Synthesis

作者： J. Ma K. Iwama T. Takaoka Qian-Ping Gu The Department of Computer Science and Communication Engineering Kyushu University Fukuoka Japan Department of Computer Scienc Ibaraki University Hitachi Japan Department of Computer Software University of Aizu Fukushima Japan DepartmentComputer Science Shandong University Jinan China

In this paper, we give efficient parallel and distributed algorithms for the topological sort problem on acyclic graphs with n vertices. Our parallel algorithm solves the problem on a CREW PRAM in O(log/sup 2/ n) time with O(M(n)/log n) processors, where M(n) denotes the number of processors needed to multiply two n/spl times/n integer matrices over the integer ring. The best known upper bound of M(n) is O(n/sup 2.376/). The parallel algorithm can also solve the problem on processor arrays with reconfigurable bus systems in O(1) time and O(n/sup 3/) processors. Our distributed algorithm solves the topological sort problem of an arbitrary asynchronous network with communication complexity O(n/sup 2/).

关键词： Phase change random access memory Upper bound Shortest path problem Computer science distributed algorithms software Computational modeling distributed computing Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of processor scheduling strategies in a distributed-memory multicomputer system

Performance comparison of processor scheduling strategies in...

引用

international symposium on parallel Processing

作者： Yuet-Ning Chan S.P. Dandamudi S. Majumdar School of Computer Science Carleton University Ottawa ONT Canada Department of Systems and Computer Engineering Carleton University Ottawa ONT Canada

Processor scheduling has received considerable attention in the context of shared memory multiprocessor systems but has not received as much attention in distributed memory multicomputers. Furthermore, most previous research in this area has either used a simulation model or an analytical model in evaluating the performance of various policies. Very often these models neglect several practical aspects of the system and workload. Our goal is to implement processor scheduling policies on a real system and evaluate their performance. We have used a transputer based system to implement two policies-one space sharing policy and one time sharing policy-in order to study the relative performance trade-offs involved. We have also implemented a hybrid space sharing and time sharing policy. We report on the performance sensitivity of these policies to various system and workload parameters.

关键词： Processor scheduling Time sharing computer systems Analytical models Application software software architecture Switches Computer architecture Computer science Round robin Proposals

来源：评论

学校读者我要写书评

暂无评论

Utilizing heterogeneous networks in distributed parallel computing systems 97

Utilizing heterogeneous networks in distributed parallel com...

引用

international symposium on High Performance distributed Computing

作者： J.-S. Kim D.J. Lilja Department of Electrical Engineering University of Minnesota Minneapolis MN USA

ISBN: (纸本)9780818681172

Heterogeneity is becoming quite common in distributed parallel computing systems, both in processor architectures and in communication networks. Different types of networks have different performance characteristics, while different types of messages may have different communication requirements. In this work, we analyze two techniques for exploiting these heterogeneous characteristics and requirements to reduce the communication overhead of parallel application programs executed on distributed computing systems. The performance based path selection (PBPS) technique selects the best (lowest latency) network among several for each individual message, while the second technique aggregates multiple networks into a single virtual network. We present a general approach for applying and evaluating these techniques to a distributed computing system with multiple interprocessor communication networks. We also generate performance curves for a cluster of IBM workstations interconnected with Ethernet, ATM, and Fibre Channel networks. As we show with several of the NAS benchmarks, these curves can be used to estimate the potential improvement in communication performance that can be obtained with these techniques, given some simple communication characteristics of an application program.

关键词： Intelligent networks parallel processing Communication networks distributed computing Application software Computer architecture Delay Concurrent computing Aggregates Computer networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting global data locality in non-blocking multithreaded architectures

Exploiting global data locality in non-blocking multithreade...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Wen-Yen Lin J.-L. Gaudiot Department of Electrical Engineering Systems University of Southern California Los Angeles CA USA

Non-blocking multithreaded architectures have been proposed as an effective means to overlap computation and communication in distributed memory systems. However, in these models, communication latency could only be hidden from computation as long as there are enough ready threads. We describe our I-Structure software Cache (ISSC) run-time system, which takes advantage of the global data locality in these models without adding any specific hardware support. Our ISSC provides a communication latency reduction technique in non-blocking multithreaded architectures while maintaining the ability of tolerating communication latency. Our simulation results show that our ISSC run-time system dramatically decreases network traffic by caching remote requests and also achieves 70% to 95% improvement on the system performance (speedup).

关键词： Yarn Computer architecture Hardware Delay Multiprocessing systems distributed computing Communication switching Switches parallel processing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Implementation of a parallel Prolog system on a distributed memory parallel computer

引用

IEICE TRANSACTIONS ON INFORMATION AND systems 1997年第4期E80D卷 504-509页

作者： Matsuda, H Kawabata, T Kaneda, Y Graduate School of Engineering Science Osaka University Tcyonaka-shi 560 Japan Graduate School of Science and Technology Kobe University Kobe-sni 657 Japan Development Department Osaka SI Promotion Division SANYO Electric Software Co. Ltd. Japan

In this paper we propose a new method for parallel execution of Prolog programs and present its implementation on a distributed memory parallel computer, Fujitsu AP1000. In our method a number of processes (named Prolog engines) explore different branches of a search tree (named tasks) in parallel, which is the same as OR-parallelism. Unlike OR-parallelism, the mapping between Prolog engines and tasks is statically determined like data parallelism. Each Prolog engine can decide which task is executed by the engine without communicating with the other engines. In many search problems, however, such static task mapping may cause imbalance on the processing time of each engine since the computational costs to explore branches may vary substantially. To cope with this issue, we devise a method to adjust the task imbalance by periodical exchanging how many tasks were processed for each engine. Also for reducing communication overhead in load balancing, we limit the scope of engines that exchange the load information each other. The effectiveness of our method is evaluated by measuring execution times for N Queens and the Traveling Salesman Problem on the AP1000. Using 512 processors, we obtained 355-fold speedup for N Queens and 343-fold speedup on the Traveling Salesman Problem.

关键词： parallel Prolog logic programming load balancing search problems data parallelism

来源：评论

学校读者我要写书评

暂无评论

Design issues in building Web-based parallel programming environments 97

Design issues in building Web-based parallel programming env...

引用

international symposium on High Performance distributed Computing

作者： K. Dincer G.C. Fox Northeast Parallel Architectures Center and Department of Electrical Engineering and Computer Science Syracuse University Syracuse NY USA

ISBN: (纸本)9780818681172

We exploited the recent advances in Internet connectivity and Web technologies for building Web-based parallel programming environments (WPPEs) that facilitate the development and execution of parallel programs on remote high-performance computers. A Web browser running on the user's machine provides a user-friendly interface to server-site user accounts and allows the use of parallel computing platforms and software in a convenient manner. The user may create, edit, and execute files through this Web browser interface. This new Web-based client-server architecture has the potential of being used as a future front-end to high-performance computer systems. We discuss the design and implementation of several prototype WPPEs that are currently in use at the Northeast parallel Architectures Center and the Cornell Theory Center. These initial prototypes support high-level parallel programming with Fortran 90 and High Performance Fortran (HPF), as well as explicit low-level programming with Message Passing Interface (MPI). We detail the lessons learned during the development process and outline the tradeoffs of various design choices in the realization of the design. We especially concentrate on providing server-site user accounts, mechanisms to access those accounts through the Web, and the Web-related system security issues.

关键词： Buildings parallel programming Prototypes Internet Concurrent computing parallel processing Computer architecture software prototyping parallel architectures Message passing

来源：评论

学校读者我要写书评

暂无评论

ASCI applications 97

ASCI applications

引用

international symposium on High Performance distributed Computing

作者： C. McMillan Lawrence Livemore National Laboratory USA

ISBN: (纸本)9780818681172

In discussions of ASCI, the high-profile procurements of large computers frequently figure prominently. However, from the outset of the ASCI program, applications have been recognized as the driver. These applications feature complex, multi-physics simulations of natural phenomena that generate massive data sets as output. As we have moved from computing systems dominated by parallel vector processing to massively parallel processing we have designed new applications from the ground up to take advantage of the new capabilities. Early payoffs from this effort include running problems that are one to two orders of magnitude larger than any we have been able to run in the past. With these larger problems, we are begining the computational exploration of domains in physics, chemistry and engineering that were previously closed. As we write these codes, issues associated with languages, debuggers and visualization tools have quickly risen to the surface. The process of running large problems has strained the computational infrastructure almost to the breaking point but indicates the direction for future work.

关键词： Application software Laboratories Procurement Concurrent computing parallel processing Process design Physics computing Chemistry Visualization Contracts

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：