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

Using streaming and parallelization techniques for 3D visualization in a high-performance computing and networking environment 9th

引用

9th international conference on High-Performance computing and Networking

作者： Olbrich, S Pralle, H Raasch, S Leibniz Univ Hannover RRZN Reg Sci Comp Ctr Lower Saxony RVSInst Comp Networks & Distributed Syst D-30159 Hannover Germany Leibniz Univ Hannover Inst Meteorol & Climatol IMUK D-30167 Hannover Germany

ISBN: (纸本)3540422935

Currently available massively parallel supercomputers provide sufficient performance to simulate multi-dimensional, multi-variable problems in high resolution. However, the visualization of the large amounts of result data cannot be handled by traditional methods, where postprocessing modules are usually coupled to the raw data source - either by files or by data flow. Due to significant bottlenecks of the storage and communication resources, efficient techniques for data extraction and preprocessing at the source have to be developed to get a balanced, scalable system and the feasibility of a "Virtual Laboratory" scenario, where the user interacts with a multi-modal, tele-immersive virtual reality environment. In this paper we describe an efficient, distributed system approach to support three-dimensional, interactive exploration of complex results of scientific computing. Our processing chain consists of the following networked instances: 1. Creation of geometric 3D objects, such as isosurfaces, orthogonal slicers or particle sets, which illustrate the behaviour of the raw data. Our efficient visualization approach allows to handle large result data sets of simulation frameworks. It is based on processing every result data part corresponding to the domain decomposition of the parallelized simulation at the location of computation, and then collecting and exporting the generated 3D primitives. this is supported by special postprocessing routines, which provide filtering and mapping functions. 2. Storage of the generated sequence of 3D files on a separate "3D Streaming Server", which provides - controlled via "Real Time Streaming Protocol" (RTSP) - play-out capabilities for continuous 3D media streams. 3. Presentation of such 3D scene sequences as animations in a virtual reality environment. the virtual objects are embedded in a WWW page by using an advanced 3D viewer plugin, and taking advantage of high-quality rendering, stereoscopic displays and interactive navig

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Soft computing agents

Soft computing agents

引用

conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： D. Lakov ICCS BAS Intelligent Computing Technologies Inc. Sofia Bulgaria

the paper introduces a new paradigm in the broad family of software agents. It is called soft computing agents (SCA) that combines the advantages of soft computing technology with the software agents paradigm as universal optimal resource allocation techniques. SCA is oriented to improve the quality of service QoS and endows intelligent agents with the ability to perceive, be aware, and perform sensitive to customers' claims optimal actions. Primary definitions and axiomatics of SCA are introduced. the strategy of mobile SCA creation dedicated to a routing task has been developed. It comprises three types of SCAs: information, optimal routing, and inter-node interactive. these three types of SCA have been created for the solution of optimal routing tasks into Internet applications. the first, information SCA, is responsible for providing necessary information in all the nodes under some horizon under consideration. the second type performs optimization based on such gathered information. the third type, inter-node interactive SCA, is responsible for timely recover of the current states to every node into the horizon after every successive routing implementation.

关键词： Intelligent agent Routing Computers Reactive power Internet Color Fuzzy logic Cathode ray tubes distributed control Paper technology

来源：评论

学校读者我要写书评

暂无评论

parallel retrograde analysis on different architecture

Parallel retrograde analysis on different architecture

引用

international Symposium on High Performance distributed computing

作者： Ren Wu D.F. Beal HP Laboratories Hewlett Packard Company USA Department of Computer Science Queen Mary & Westfield College London University UK

Retrograde analysis is an efficient exhaustive search method. It is a powerful tool that can be used in solving problems where end states have known values but starting states do not. It has been widely used to solve mathematically-precise games such as chess endgames, and is potentially usable in energy-minimization problems. With increasing computing power, both in speed and storage capacity, retrograde analysis will become more and more useful. this paper looks at successful applications to games, the challenges ahead and the modifications that are required to utilize distributed hardware. the power and the usefulness of retrograde analysis are still limited by the computing resources one has access to. Today, the best sequential retrograde algorithms are capable of solving problems with about 10/sup 9/ states in a few hours on a standard personal computer. Bigger problems need more powerful computers, or take much longer to solve, or are simply out of the reach of today's technologies. Introducing parallelism to retrograde analysis is a natural way to attack the bigger problems. there are today three main architectures available for doing parallel retrograde analysis, namely symmetric multiprocessor (SMP) systems, high-speed network-based distributed systems and Internet-based distributed systems. In this paper, we discuss some of the key issues in doing parallel retrograde analysis on these different architectures. Technical challenges are addressed in detail, as well as some examples and proposals. these examples and proposals are drawn from various board games, but the ideas can be applied to other problem domains.

关键词： Computer architecture Proposals Laboratories Search methods Hardware Microcomputers parallel processing Multiprocessing systems High-speed networks IP networks

来源：评论

学校读者我要写书评

暂无评论

parallel Retrograde Analysis on Different Architecture 01

Parallel Retrograde Analysis on Different Architecture

引用

Proceedings of the 10th IEEE international Symposium on High Performance distributed computing

作者： Ren Wu

Abstract: Retrograde analysis is an efficient exhaustive search method. It is a powerful tool that can be used in solving problems where end states have known values but starting states do not. It has been widely used to solve mathematically-precise games such as chess endgames, and is potentially usable in energy-minimization problems. With increasing computing power, both in speed and storage capacity, retrograde analysis will become more and more useful. this paper looks at successful applications to games, the challenges ahead, and the modifications that are required to utilize distributed hardware. the power and the usefulness of retrograde analysis are still limited by the computing resources one has access to. Today, the best sequential retrograde algorithms are capable of solving problems with about 10 9 states in a few hours on a standard personal computer. Bigger problems need more powerful computers, or take much longer to solve, or are simply out of reach of today's technologies. Introducing parallelism to retrograde analysis is a natural way to attack the bigger problems. there are today three main architectures available for doing parallel retrograde analysis: namely Symmetric Multiprocessor systems, High-speed network based distributed systems, and Internet based distributed systems. In this paper, we discuss some of the key issues in doing parallel retrograde analysis on these different architectures. Technical challenges are addressed in detail, as well as some examples and proposals. these examples and proposals are drawn from various board games, but the ideas can be applied to other problem domains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable realization of Sparse distributed Memory on a multiprocessor system 9

Scalable realization of Sparse Distributed Memory on a multi...

引用

9th international conference on Intelligent Systems

作者： Kolinummi, P Tikkanen, KN Hämäläinen, T Saarinen, J Tampere Univ Technol Digital & Comp Syst Lab FIN-33101 Tampere Finland

ISBN: (纸本)1880843331

parallel mappings of Sparse distributed Memory (SDM) are presented for a partial tree shape neurocomputer. the implemented partial tree shape neurocomputer called PARNEU is a scalable co-processor system to speed up soft computing applications. the used SDM algorithm benefits from the improved reading method and mask based activation. Two different mapping strategies are presented and analysed in detail the effect of SDM size is analysed and the system scalability is verified with speedup figures of different SDM networks. Almost linear speedup is achieved with reasonable size SDM algorithm.

关键词： Sparse distributed Memory neurocomputer parallel mapping

来源：评论

学校读者我要写书评

暂无评论

distributed processor allocation in large PC clusters 9

Distributed processor allocation in large PC clusters

引用

9th IEEE international Symposium on High Performance distributed computing

作者： De Rose, CAF Heiss, HU Navaux, PAO Univ Fed Rio Grande Sul Dept Comp Sci Porto Alegre RS Brazil

ISBN: (纸本)0769507840

Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large distributed memory machines. A contiguous and a noncontiguous version of a distributed dynamic processor allocation strategy are proposed and studied in this paper Simulations compare the performance of the proposed strategies with that of well-known centralized algorithms. We also present the results of experiments on a Simens hpcLine Primergy Sewer with 96 nodes that show distributed allocation is feasible with current technologies.

关键词： Computer science Data structures Fault tolerance Hypercubes parallel machines parallel processing Partitioning algorithms Resource management Shape throughput

来源：评论

学校读者我要写书评

暂无评论

A method to design process architecture in a distributed product realization environment 9

A method to design process architecture in a distributed pro...

引用

9th IEEE international Workshops on Enabling technologies - Infrastructure for Collaborative Enterprises (WET ICE 2000)

作者： Xiao, A Allen, JK Rosen, D Mistree, F Georgia Inst Technol George W Woodruff Sch Mech Engn Syst Realizat Lab Atlanta GA 30332 USA

ISBN: (纸本)0769507980

Globalization, collaboration and competition are forcing product realization processes to become faster and more distributed the requirements for higher efficiency lower cost, and better product quality lead to challenges in the design of a product realization process in. which concurrency and distribution are important. A distributed process structuring method (DPSM) is presented to help engineers design process architectures based an characteristics of the distributed environment. DPSM also provides a framework for managing collaboration. With DPSM, a process is represented hierarchically by partitioning the process and reorganizing the activities. Four typical architecture templates, sequential, parallel, integrated and distributed architectures are presented. Process architectures are constructed by mapping the process representation into the templates. DPSM is a stare-of-the-science method for structuring the distributed product realization process, while ensuring its modularity and robustness. An engineering case is investigated, and the distributed architecture is implemented using agent technology.

关键词： Collaboration Concurrent computing Costs Design engineering Design methodology Electronic switching systems Globalization Process design Product design Product development

来源：评论

学校读者我要写书评

暂无评论

Supporting reconfigurable security policies for mobile programs

引用

COMPUTER NETWORKS 2000年第1-6期33卷 77-93页

作者： Hashii, B Malabarba, S Pandey, R Bishop, M Univ Calif Davis Dept Comp Sci Parallel & Distributed Comp Lab Davis CA 95616 USA

Programming models that support code migration have gained prominence, mainly due to a widespread shift from stand-alone to distributed applications. Although appealing in terms of system design and extensibility, mobile programs are a security risk and require strong access control. Further, the mobile code environment is fluid, i.e. the programs and resources located on a host may change rapidly, necessitating an extensible security model. In this paper, we present the design and implementation of a security infrastructure. the model is built around an event/response mechanism, in which a response is executed when a security-related event occurs. We support a fine-grained, conditional access control language, and enforce policies by instrumenting the bytecode of protected classes. this method enhances efficiency and promotes separation of concerns between security policy and program specification. this infrastructure also allows security policies to change at runtime, adapting to varying system state, intrusion, and other events. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： mobile code Java adaptive security policy access control dynamic classes

来源：评论

学校读者我要写书评

暂无评论

6th international European conference on parallel computing, Euro-Par 2000

引用

6th international European conference on parallel computing, Euro-Par 2000

ISBN: (纸本)9783540679561

the proceedings contain 189 papers. the special focus in this conference is on Support Tools, Evironments, Performance Evaluation, Prediction and Load Balancing. the topics include: Grid-based asynchronous migration of execution context in java virtual machines;visualization and computational steering in heterogeneous computing environments;a web-based finite element meshes partitioner and load balancer;an infrastructure for the construction of memory hierarchy analysis tools;on combining computational differentiation and toolkits for parallel scientific computing;generating parallel program frameworks from parallel design patterns;a callgraph-based search strategy for automated performance diagnosis;automatic performance analysis of MPI applications based on event traces;an extensible environment for visualizing multi-threaded programs executions;a statistical-empirical hybrid approach to hierarchical memory analysis;use of performance technology for the management of distributed systems;delay behavior in domain decomposition applications;automating performance analysis from UML design patterns;integrating automatic techniques in a performance analysis session;the specific cluster operation and performance evaluation benchmark suite;a fast and accurate approach to analyze cache memory behavior;performance prediction of a NAS benchmark program with chronosmix environment;a hierarchical approach to irregular problems;the impact of migration on parallel job scheduling for distributed systems;exploiting knowledge of temporal behaviour in parallel programs for improving distributed mapping;preemptive task scheduling for distributed systems and scheduling trees with large communication delays on two identical processors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel Laplace transform method for diffusion problems with discontinuous boundary conditions

A parallel Laplace transform method for diffusion problems w...

引用

6th international conference on applications of High-Performance computing in Engineering

作者： Davies, AJ Crann, D Mushtaq, J Univ Hertfordshire Dept Math Hatfield AL10 9AB Herts England

the Laplace transform method in the time variable provides an excellent alternative to the finite difference method for the solution of diffusion-type problems. Stehfest9;s numerical inversion process provides a st...

ISBN: (纸本)1853128104

the Laplace transform method in the time variable provides an excellent alternative to the finite difference method for the solution of diffusion-type problems. Stehfest's numerical inversion process provides a stable and accurate method. the boundary-value problem in the transform space may be solved by a variety of methods and we shall use a finite difference approach leading to the usual five-point stencil for the Laplacian operator. the inversion via Stehfest's method may be effected for any value of the time variable and as such leads to a direct domain-decomposition in time. this inherent data-parallelism is well-suited to an implementation on an MIMD parallel environment. Such an implementation is of the SPMD type with the same program on each processor. the Laplace transform approach to problems with time-dependent discontinuities in the boundary condition can have serious errors in the neighbourhood of the discontinuity. this may be alleviated by developing the solution in two time domains. the first yields the space variable at the time of the discontinuity which is then used as the initial condition for the solution in subsequent times. this problem is well-suited to the parallel environment of a distributed memory architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：