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

International conference on parallel and distributed Systems (ICPADS)

作者： Sung Hun Cho Division of Computer and Information Communication Hongik University ChungNam South Korea

ISBN: (纸本)0818682272

This paper presents competition protocols to speed up distributed programs on a network of shared workstations in the background by exploiting their wasted computing capacity, without interfering with foreground processes. Competition protocols are transparent operating system facilities that involve creating multiple instances (called clones) p/sub 1/, p/sub 2/, etc. of a process P on different processors, and making clones "compete", i.e., attempting to guarantee on a moment-by-moment basis that the output of the clone that is farthest "ahead" is fed to the rest of the computation, and that the entire application's performance tracks that of the clone which is farthest ahead. We show that competition protocols speed up distributed programs, especially with smaller granularity. We also show that competition protocols offer more speedup for distributed programs than for sequential programs.

关键词： Workstations Cloning Protocols Snow Computer networks Costs distributed computing Operating systems Processor scheduling Capacity planning

来源：评论

学校读者我要写书评

暂无评论

A hierarchical BSP model supporting processor locality

A hierarchical BSP model supporting processor locality

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Hojung Cha Dongho Lee Department of Computer Science Kwangwoon University South Korea

ISBN: (纸本)0818682272

The paper presents a parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP (Bulk Synchronous parallel) computing model. A H-BSP program consists of a number of BSP groups which are dynamically created at run time and executed in a hierarchical fashion. H-BSP allows the algorithm designer to develop a more efficient algorithm by utilizing processor locality in the program. The paper describes the structure of the H-BSP model, complexity analysis and an example of the H-BSP algorithm. Also presented are the performance characteristics of the H-BSP algorithm based on simulation analysis. Simulation results show that H-BSP model takes advantages of processor locality and performs well in low bandwidth networks or in a constant valence architecture such as a 2 dimensional mesh. It is also proved that H-BSP model can predict algorithm performance better than the BSP model due to its locality preserving nature.

关键词： Concurrent computing Hardware Computational modeling Phase change random access memory Algorithm design and analysis parallel processing Predictive models Manufacturing Computer science Analytical models

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of portable C*-like data-parallel library in C++

Efficient implementation of portable C*-like data-parallel l...

引用

proceedings of the advances in parallel and distributed computing

作者： M. Matsuda M. Sato Y. Ishikawa Real World Computing Partnership Tsukuba Research Center Ibaraki Japan

The C* language is a data-parallel extension of the C language which incorporates parallel data types. Since the C++ language provides operator overloading, a C++ library can implement the C* parallel extensions with a similar syntax. Although library implementations are highly portable, some overheads make them impractical. The two major overheads incurred are temporaries in each operator application and the inability to detect regular communication patterns. The C++ overloading mechanism forces a temporary for each operator application. Also, regular communications in C* are syntactically indistinguishable from general point-to-point communications. We tackled these problems extensively in a library. The template mechanism, a type parameterization in C++, is used to eliminate temporaries by delaying operator application and evaluating the entire expression at once. The polymorphic type dispatch mechanism is used to detect regular communications by assigning particular types to potentially regular communications. We have implemented the library on the CM-5, and compared its performance with the C* compiler using three simple examples. The techniques presented offers improved performance comparable to the C* compiler, which is close or 1.5 times slower in two examples, and even faster in one example.

关键词： Libraries Emulation parallel programming Tellurium Programming profession Delay Object oriented modeling Arithmetic parallel machines Yarn

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant cluster computing through replication

Fault tolerant cluster computing through replication

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Kam Hong Shum Department of Information Systems & Computer Science National University of Singapore Singapore

ISBN: (纸本)0818682272

Long-lived parallel applications running on work station clusters are vulnerable to single-node or multiple-node failures. Fault recovery is therefore required to prevent immature program termination. However, much of the runtime overhead imposed by fault tolerance schemes is generally due to the cost of transferring the checkpoint states of applications by disk I/O operations. In this paper, we propose a fault tolerant model in which checkpoint states are transferred between replicated parallel applications. We also describe how the resource consumption of the replicated applications can be minimized. The fault tolerant model has been implemented and tested on a workstation cluster and a Fujitsu AP3000 multi-processor machine. The measurements of our experiments have showed that efficient fault tolerance can be achieved by replicating parallel applications on clusters of computers.

关键词： Fault tolerance Checkpointing Concurrent computing Workstations Application software Discrete event simulation Runtime Writing Information systems Computer science

来源：评论

学校读者我要写书评

暂无评论

POET (parallel Object-Oriented Environment and Toolkit) and frameworks for scientific distributed computing

POET (Parallel Object-Oriented Environment and Toolkit) and ...

引用

Annual Hawaii International conference on System Sciences (HICSS)

作者： R. Armstrong A. Cheung Sandia National Laboratories Livermore CA USA

Frameworks for parallel computing have recently become popular as a means for presenting parallel algorithms as reusable components. Frameworks for parallel computing in general, and POET in particular, focus on finding ways to orchestrate cooperation between objects implementing parallel algorithms. POET seeks to be a general platform for scientific parallel algorithm components which can be modified, linked, "mixed and matched" to a user's specification. The paper centers on the characteristics that allow these components to cooperate, and at the same time, remain "black boxes" that users can drop into the frame without having to know the intricate details of message passing, data layout, etc.

关键词： parallel processing Concurrent computing parallel algorithms Application software distributed computing Libraries Computational modeling Object oriented modeling parallel machines Control systems

来源：评论

学校读者我要写书评

暂无评论

Task scheduling in distributed computing systems with a genetic algorithm

Proceedings of the Conference on High Performance Computing ...

引用

proceedings of the conference on High Performance computing on the Information Superhighway, HPC Asia'97 1997年 301-305页

作者： Woo, Sung-Ho Yang, Sung-Bong Kim, Shin-Dug Han, Tack-Don Yonsei Univ Seoul Korea Republic of

Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Geostationary-satellite imagery applications on distributed, high-performance computing

Proceedings of the Conference on High Performance Computing ...

引用

proceedings of the conference on High Performance computing on the Information Superhighway, HPC Asia'97 1997年 50-55页

作者： Hawick, K.A. James, H.A. Maciunas, K.J. Vaughan, F.A. Wendelborn, A.L. Buchhorn, M. Rezny, M. Taylor, S.R. Wilson, M.D. Univ of Adelaide Adelaide

We discuss applications of high resolution geostationary satellite imagery and distributed high performance computing facilities for the storage, processing and delivery of satellite data products. We describe our system which is built on a distributed high performance computing environment using a number of software infrastructural building blocks and computational resources interconnected by an ATM-based broadband network. distributed High Performance computing hardware technology underpins our proposed system. In particular, we discuss the capabilities of a distributed hardware environment incorporating: high bandwidth communications networks such as Telstra's Experimental Broadband Network (EBN);large capacity hierarchical storage systems;and high performance parallel computing resources. We also describe a recent demonstration of our project resources to the remote-sensing user community.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

International Workshop on Artificial Intelligence and Simulation of Behaviour, AISB 1997

引用

AISB International Workshop on Evolutionary computing, 1997

ISBN: (纸本)3540634762

The proceedings contain 21 papers. The special focus in this conference is on Evolutionary Approaches to Issues in Biology and Economics. The topics include: Simulating pricing behaviours using a genetic algorithm;biologically inspired computational ecologies;modelling bounded rationality using evolutionary techniques;the abstract theory of evolution of the living;an evolutionary algorithm for single objective nonlinear constrained optimization problems;on recombinative sampling;the evolution of mutation, plasticity and culture in cyclically changing environments;on the structure and transformation of landscapes;island model genetic algorithms and linearly separable problems;empirical validation of the performance of a class of transient detector;the construction and evaluation of decision trees;parallel distributed genetic programming applied to the evolution of natural language recognisers;scheduling planned maintenance of the south wales region of the national grid;solving generic scheduling problems with a distributed genetic algorithm;directing the search of evolutionary and neighbourhood-search optimisers for the flowshop sequencing problem with an idle-time heuristic;multiobjective genetic algorithms for pump scheduling in water supply;use of rules and preferences for schedule builders in genetic algorithms for production scheduling;a voxel based approach to evolutionary shape optimisation;an evolutionary, agent-assisted strategy for conceptual design space decomposition and task scheduling with use of classifier systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel processing method for receding horizon tracking control

A parallel processing method for receding horizon tracking c...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Zhengjiu Kang Hyeong Jun Lim Wook Hyun Kwon Control Information Systems LaboratorySchool of Electrical Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0818682272

A recursive square root algorithm for Receding Horizon Tracking Control (RHTC) based on state-space model which the original sequential algorithm exhibits O(Nn/sup 2/) complexity is derived and its systolic implementation method is also shown. The parallel processing algorithm needs O(Nn) computations for an n-th order plant and N-step prediction horizon on O(n/sup 2/+nN) processor array.

关键词： Signal processing algorithms parallel processing Control systems Design methodology MIMO Application software Very large scale integration Systolic arrays Concurrent computing Predictive control

来源：评论

学校读者我要写书评

暂无评论

A scalable distributed heterogeneous associative logic programming system

A scalable distributed heterogeneous associative logic progr...

引用

International conference on Tools for Artificial Intelligence (ICTAI)

作者： S.W. Ryan A.K. Bansal Depwimenit of Mathematics and Computer Science Kent University Kent OH USA

This paper describes a distributed implementation of a scalable heterogeneous associative logic programming model, and describes an abstract instruction set for the distributed version of the model. Associative computation exploits data parallel computation. The implementation uses PVM for architecture independence, and uses object oriented programming for modularity and portability. Performance results on a cluster of IBM RS 6000 are presented.

关键词： Logic programming distributed computing Object oriented modeling Concurrent computing High performance computing Computer architecture Filters Mathematical model Object oriented programming parallel processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：