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

parallel approaches to the numerical transient analysis of stochastic reward nets 20th

20th international conference on Application and theory of Petri Nets, ICATPN 1999

作者： Allmaier, Susann Kreische, David Universität Erlangen-Nürnberg Martensstr. 3 ErlangenD-91058 Germany

ISBN: (纸本)3540661328

this paper presents parallel approaches to the complete transient numerical analysis of stochastic reward nets (SRNs) for both shared and distributed-memory machines. parallelization concepts and implementation issues are discussed for the three main analysis steps that are (1) generation of the underlying continuous-time Markov chain (CTMC), (2) solving the CTMC numerically for the desired time points and (3) converting the results back to the net level by evaluating reward based result measure functions. the distributed-memory approach implements dynamic load balancing mechanisms in step (1) to guarantee an equal distribution of the state space onto the main memories of the clustered machines. the shared-memory algorithms are based on elaborated synchronization mechanisms which allow parallel read and write access to the global irregular data structure of the CTMC. Performance measurements on different architectures and a comparison of the approaches are given. All the algorithms are integrated in PANDA which consequently is a parallel SRN modeling tool suitable for different multiprocessor platforms. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A flexible clustering and scheduling scheme for efficient parallel computation

A flexible clustering and scheduling scheme for efficient pa...

引用

international Symposium on parallel processing

作者： S. Chingchit M. Kumar L.N. Bhuyan School of Computing Science Curtin University of Technology Perth Australia Department of Computer Science Texas A and M University College Station TX USA

Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and reduce problem execution times. In this paper we present a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. the proposed scheme is based on the relation between the costs of computation and communication of task clusters. In this paper we show how clustering can be adapted to suit different architectures and number of available processors. the proposed efficient clustering and scheduling algorithm is flexible: the clustering and scheduling can be tuned to suit bounded or unbounded number of processors and/or parallel computing environment. Comparative studies indicate superior efficiency compared to most other schemes proposed in recent years.

关键词： Processor scheduling Concurrent computing Computational efficiency Scheduling algorithm Computer architecture Bandwidth Computer science Clustering algorithms Costs Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Two computer vision-based tracking applications solved using a robust parallel optimizer

Two computer vision-based tracking applications solved using...

引用

international conference on Image Analysis and processing

作者： P.-L. Bazin P. Gerard A. Gagalowicz INRIA-Rocquencourt Le Chesnay France

A method was developed as a response to the need for a robust optimizer for two different image vision algorithms. Our new approach is a synthesis of two modalities, a simulated annealing technique paired with a parallel search. Using an initial value and the maximum parametric variations, our method searches for a cost function minimum by using parameter subspaces combined with a local simulated annealing algorithm step. the description of our two computer vision applications which relate object tracking to video sequences make it clear why this kind of optimizer was needed. In the cases described, our method provides encouraging results.

关键词： Computer applications Computer vision Concurrent computing Application software Robustness Iterative algorithms Simulated annealing Video sequences Cost function Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Dynamically scheduling the trace produced during program execution into VLIW instructions

Proceedings of the International Parallel Processing Symposi...

引用

Proceedings of the international parallel processing Symposium, IPPS 1999年 248-257页

作者： Ferreira de Souza, Alberto Rounce, Peter Univ Coll London London United Kingdom

VLIW machines possibly provide the most direct way to exploit instruction level parallelism;however, they cannot be used to emulate current general-purpose instruction set architectures. Programs scheduled for a particular implementation of a VLIW model cannot be guaranteed to be binary compatible with other implementations of the same machine model with different number of functional-units. this paper describes an architecture, named dynamically trace scheduled VLIW (DTSVLIW), which can be used to implement machines that execute code of current RISC or CISC instruction set architectures in a VLIW fashion, with backward code compatibility. Some preliminary performance measurements of the DTSVLIW, obtained with an execution-driven simulator running the SPECint95 benchmark suite, are also presented.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A BSP realisation of Jarvis's algorithm

A BSP realisation of Jarvis's algorithm

引用

international conference on Image Analysis and processing

作者： L. Cinque C. Di Maggio Dipartimento di Scienze dell Informazione Universita di Roma Rome Italy Dipartimento di Matematica Pura ed Applicata Universita degli Studi dell''Aquila L'Aquila Italy

the purpose of this paper is to present a very efficient parallel algorithm for computing the convex hull in the plane. We propose a parallel version of the Jarvis's march, realized using the BSP model and which takes O(nh/p) time (where p is the number of processors and n is the problem size) against the O(nh) complexity of the sequential algorithm. Furthermore, we give the experimental results obtained testing the algorithm implementation on a 16-node IBM SP2 (Scalable POWER parallel 2) and we compare them with the theoretical performance prediction obtained using the BSP cost calculus model.

关键词： Concurrent computing Computational geometry parallel algorithms Testing Application software Phase change random access memory Algorithm design and analysis Standards development Remuneration Costs

来源：评论

学校读者我要写书评

暂无评论

Euclidean distance transform on a dedicated architecture based on a reconfigurable mesh network

Euclidean distance transform on a dedicated architecture bas...

引用

international conference on Image Analysis and processing

作者： P. Baglietto DIST-University of Genoa Genoa Italy

this paper describes a parallel algorithm for the Euclidean distance transform on a special-purpose architecture based on a reconfigurable mesh interconnection network. the proposed architecture, which supports the Euclidean distance transform algorithm as well as other low-level image processing algorithms, is particularly interesting because it can be effectively implemented in hardware and it can be programmed at a high level. the Euclidean distance transform algorithm described in this paper exploits the specific features of the reconfigurable interconnection network of the proposed dedicated architecture and takes advantage of the natural matching both between the data structure of the problem (a mesh of pixels) and that of the dedicated architecture (a mesh of processing elements) and between the nature of the computation (distance computation) and the capability of the interconnection network to let information flow from one node to a set of nodes by means of reconfigurable buses. the proposed algorithm has been implemented and has been validated through simulation, its computational complexity is O(N) (worst case) for pictures of N/spl times/N pixels on an architecture with N/spl times/N processing elements.

关键词： Euclidean distance Multiprocessor interconnection networks Computer architecture Computer networks Data flow computing parallel algorithms Image processing Hardware Data structures Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Flexible clustering and scheduling scheme for efficient parallel computation

Proceedings of the International Parallel Processing Symposi...

引用

Proceedings of the international parallel processing Symposium, IPPS 1999年 500-505页

作者： Chingchit, S. Kumar, M. Bhuyan, L.N. Curtin Univ Perth

Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and reduce problem execution times. In this paper we present a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. the proposed scheme is based on the relation between the costs of computation and communication of task clusters. In this paper, we show how clustering can be adapted to suit different architectures and number of available processors. the proposed efficient clustering and scheduling algorithm is flexible: the clustering and scheduling can be tuned to suit bounded or unbounded number of processors and/or parallel computing environment. Comparative studies indicate superior efficiency compared to most other schemes proposed in recent years.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Exploiting global structure for performance on clusters

Proceedings of the International Parallel Processing Symposi...

引用

Proceedings of the international parallel processing Symposium, IPPS 1999年 176-182页

作者： Donaldson, Stephen R. Hill, Jonathan M.D. Skillicorn, David B. Oxford Univ Oxford United Kingdom

Most parallel programming models for distributed-memory architectures are based on individual threads interacting via send and receive operations. We show that a more structured model, BSP, gains substantial performance improvements by exploiting the extra information implicit in its structure. In particular, each thread learns something about global state whenever it receives a message. this information can be used to modify its own behavior to improve collective use of the communication system. the programming model's semantics also provides implicit knowledge that can be exploited to increase performance. We show that these effects are useful at the application level by comparing the performance of BSP and MPI implementations of the NAS parallel benchmarks.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Exploiting global structure for performance on clusters

Exploiting global structure for performance on clusters

引用

international Symposium on parallel processing

作者： S.R. Donaldson J.M.D. Hill D.B. Skillicom Oxford University Computing Laboratory Oxford UK Sychron Limited Oxford UK

Most parallel programming models for distributed-memory architectures are based on individual threads interacting via send and receive operations. We show that a more structured model, BSP, gains substantial performance improvements by exploiting the extra information implicit in its structure. In particular each thread learns something about global state whenever it receives a message. this information can be used to modify its own behavior to improve collective use of the communication system. the programming model's semantics also provides implicit knowledge that can be exploited to increase performance. We show that these effects are useful at the application level by comparing the performance of BSP and MPI implementations of the NAS parallel benchmarks.

关键词： Yarn Libraries Programming profession Laboratories Buildings Information science Electrical capacitance tomography Concurrent computing Skeleton parallel processing

来源：评论

学校读者我要写书评

暂无评论

10th international conference on Database and Expert Systems Applications, DEXA 1999

10th International Conference on Database and Expert Systems...

引用

10th international conference on Database and Expert Systems Applications, DEXA 1999

ISBN: (纸本)3540664483

the proceedings contain 103 papers. the special focus in this conference is on Object-Orientation and Fundamentals for Applications. the topics include: On tractable queries and constraints;dynamic relationships in object oriented databases;an intelligent object-oriented database architecture;implementation of a generic query processor;hybrid simultaneous scheduling and mapping in sql multi-query parallelization;cluster-based database selection techniques for routing bibliographic queries;developing patterns as a mechanism for assisting the management of knowledge in the context of conducting organisational change;knowledge acquisition for mobile robot environment mapping;knowledge discovery with the associative memory modell neunet;tracking mobile users utilizing their frequently visited locations;a parallel signature file technique using vertical partitioning and extendable hashing;flexible workflow management systems;object-based ordered delivery of messages in object-based systems;storage and retrieval of xml documents using object-relational databases;a knowledge based approach for modeling and querying multidimensional databases;an incremental hypercube approach for finding best matches for vague queries;formalising ontologies and their relations;addressing efficiency issues during the process of integrity maintenance;quality and recommendation of multi-source data for assisting technological intelligence applications;using self-organizing maps to organize document archives and to characterize subject matters;from object- oriented conceptual modeling to component-based development;query processing in relationlog;a query subsumption technique;a conference key multicasting scheme using knapsack and secret sharing;verify updating trigger correctness;a flexible weighting scheme for multimedia documents and supporting teams in virtual organizations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：