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

SPECIFICATION AND ANALYSIS OF parallel DISTRIBUTED SOFTWARE AND SYSTEMS BY PETRI NETS WITH TRANSITION ENABLING FUNCTIONS

引用

IEEE TRANSACTIONS ON SOFTWARE engineering 1992年第3期18卷 252-261页

作者： PAPELIS, YE CASAVANT, TL Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa City IA 52242

This paper investigates a new approach for visually specifying parallel/distributed software using Petri Nets (PN's) extended with Transition Enabling Functions (TEF's). The approach is demonstrated to be useful in the specification of decision-making activities that control distributed computing systems. PN's are employed because of their highly visual nature that can give insight into the nature of the controller of such a system and because of their well-known analytical properties. In order to increase the expressive power of PN's, the extension of TEF's is used. The main focus of this paper is the specification and analysis of parallel/distributed software and systems. A key element of this approach is a set of rules derived to automatically transform such an extended net into a basic PN. Once the rules have been applied to transform the specification, well-known analytical methods can be used to investigate characteristic properties of the system and validate correct operation.

关键词： DISTRIBUTED SOFTWARE parallel SOFTWARE SOFTWARE SPECIFICATION parallel PETRI NETS TRANSITION ENABLING FUNCTIONS CONCURRENCY

来源：评论

学校读者我要写书评

暂无评论

Preconditioning Full Wave Inversion Using Geological Structure-Oriented Gradient Filtering

引用

IEEE Geoscience and Remote Sensing Letters 2025年 22卷

作者： Gebre, Mesay Geletu Pinheiro, Daniel N. Duarte, Edwin F. Da Costa, Carlos A. N. Araujo, Ramon C. F. Da Silva, Danyelle De Araujo, Joao M. Departamento de Física Universidade Federal do Grande do Norte Natal Rio Grande do Norte Brazil Department of Physics Wolkite University Wolkite Ethiopia Department of Computer Engineering and Automation Laboratory of Parallel Architectures for Signal Processing Federal University of Rio Grande do Norte Natal Rio Grande do Norte Brazil

Full Waveform Inversion (FWI) is inherently an illposed inverse problem. Gradient preconditioning in FWI is crucial for improving the convergence and stability of the inversion process, as it helps to refine the gradient and mitigate the ill-posed nature of FWI. Conventional strategies involve applying smoothing operators, such as Gaussian or Laplacian filters, directly at each FWI iteration. While these operators are easy to implement, they can compromise the structural information embedded in the gradient. To address this drawback, we propose a structure-oriented filter that enhances the gradient’s structure while smoothing the gradient along known geological slopes. This preconditioning method effectively preserves the geological structures. We applied the proposed approach to 3D field data from the Brazilian pre-salt region and compared the inversion results with those obtained using conventional strategies. The enhancement in resolution and structural coherence is striking, with most of the velocity model’s details being preserved. Additionally, the Reverse Time Migrated (RTM) image computed using the FWI velocity model obtained with the proposed preconditioning strategy revealed more detailed geological features associated with complex salt layers, with more focused and sharper edges compared to the RTM image derived from the velocity model using conventional preconditioning methods. To further validate the FWI velocity model obtained with our method, we performed quality control tests, including observed and predicted data comparison and phase residual analysis, which confirmed the reliability of the results. We believe this technique has the potential to be applied to a wide range of field data in the future. © 2004-2012 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

GPU acceleration of subgraph isomorphism search in large scale graph

引用

Journal of Central South University 2015年第6期22卷 2238-2249页

作者：杨博卢凯高颖慧王小平徐凯 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology Department of Electronic Science and Engineering National University of Defense Technology

A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.

关键词： parallel graph isomorphism GPU backtrack paradigm

来源：评论

学校读者我要写书评

暂无评论

The use of feedback in scheduling parallel computations

The use of feedback in scheduling parallel computations

引用

Aizu International Symposium on parallel Algorithms/Architecture Synthesis

作者： R.D. Dietz T.L. Casavant M.S. Andersland T.A. Braun T.E. Scheetz Parallel Processing LaboratoryElectrical and Computer Engineering Department University of Iowa Iowa IA USA

Discusses the use of run-time feedback for optimizing the execution of parallel computations. Four levels of feedback are distinguished and the applicability and limitations of each are discussed. A two-part scheduling paradigm known as SEDIA (Static Exploration/Dynamic Instantiation and Activation) that addresses these limitations to perform robust scheduling in the presence of variant run-time behaviour is introduced. A key component of this scheduling paradigm is an abstract model of run-time information fidelity, which has evolved from our previous work in the area of trace recovery, employing control-theoretic concepts.

关键词： Feedback Processor scheduling Concurrent computing Optimal scheduling Runtime parallel processing Delay Robustness Laboratories Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Human detection in semi-dense scenes using HOG descriptor and mixture of SVMs

Human detection in semi-dense scenes using HOG descriptor an...

引用

3rd International Conference on computer and Knowledge engineering, ICCKE 2013

作者： Rajaei, Afsane Shayegh, Hamidreza Moghaddam Charkari, Nasrollah Parallel Processing Image. Computer Engineering Department Electrical and Computer Faculty Tarbiat Modares Tehran Iran

ISBN: (纸本)9781479920921

Human detection has recently received significant attention in the field of computer vision. Accurate detection of human bodies is an essential component required by a variety of applications such as automated surveillance, advanced user interface and sport analysis. In this paper, we present a new method for human detection in video frames, using learning algorithm, feature extraction and sliding window. People detection is a challenging topic, especially in complex scenes when occlusion occurs. In this paper a new technique based on the body part detection and HOG (Histogram of Gradient) features is proposed for human detection with occlusions. Proposed HOG descriptor provides lower feature vector length in comparison with state of the art methods approaches. Using human detectors alone, cause to high frequent false positive. Thus, we propose a novel classifier-fusion learning algorithm, instead of single classifier. The experimental results show that the new proposed method provides lower false positive and raise higher precision and recall in comparison with state of the art methods. © 2013 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

引用

Journal of computer Science & Technology 2015年第1期30卷 42-56页

作者：卢凯周旭王小平 Tom Bergan 陈沉 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Department of Computer Science and Engineering University of Washington Seattle WA 98195-2350 U.S.A.

Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading （DMT） and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps： relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system （fast）, weak deterministic system （fast and conditionally deterministic）, DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.

关键词： determinism multithreading framework flexible

来源：评论

学校读者我要写书评

暂无评论

Use of PARADISE: A meta-tool for visualizing parallel systems 5

Use of PARADISE: A meta-tool for visualizing parallel system...

引用

5th International parallel processing Symposium, IPPS 1991

作者： Kohl, James Arthur Casavant, Thomas L. Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa CityIA52242 United States

ISBN: (纸本)0818691670

This paper addresses the problem of creating software tools for visualizing the dynamic behavior of parallel applications and systems. PARADISE (parallel Animated Debugging and Simulation Environment) approaches this problem by providing a meta-tool environment for generating custom visual analysis tools. PARADISE is a meta-tool because it is a tool which is utilized to create other tools. This paper focuses on the user's view of the use of PARADISE for constructing tools which analyze the interaction between parallel systems and parallel applications. An example of its use, involving the PASM parallel processing System, is given. © 1991 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A software engineering, visualization methodology for parallel processing systems 16

A software engineering, visualization methodology for parall...

引用

16th Annual International computer Software and Applications Conference, COMPSAC 1992

作者： Kohl, James Arthur Casavant, Thomas L. Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa CityIA52242 United States

ISBN: (纸本)0818630000

This paper focuses on techniques for enhancing the feasibility of using graphic visualization in analyzing the complexities of parallel software. The central drawback to applying such visual techniques is the overhead in developing analysis tools with flexible, customized views. The PARADISE (parallel Animated Debugging and Simulation Environment) system, which has been in operation since 1989, alleviates some of this design overhead by providing an abstract, object-oriented, visual modeling environment which expedites custom visual tool development. PARADISE is a visual tool which is used to develop other visual tools, or a meta-tool. This paper complements previous work on PARADISE by describing the philosophy behind its design, and how that philosophy leads to a methodology for constructing visual models which characterize parallel systems in general. Emphasis will be on the crucial issues in utilizing visualization for parallel software development, and how PARADISE deals with these issues. © 1992 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Improving vertex-frontier based GPU breadth-first search

引用

Journal of Central South University 2014年第10期21卷 3828-3836页

作者：杨博卢凯高颖慧徐凯王小平程志权 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology Department of Electronic Science and Engineering National University of Defense Technology Avatar Science Company

Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effective solution, GPU-acceleration achieves the state-of-the-art result of 3.3×109 traversed edges per second on a NVIDIA Tesla C2050 GPU. A novel vertex frontier based GPU BFS algorithm is proposed, and its main features are three-fold. Firstly, to obtain a better workload balance for irregular graphs, a virtual-queue task decomposition and mapping strategy is introduced for vertex frontier expanding. Secondly, a global deduplicate detection scheme is proposed to remove reduplicative vertices from vertex frontier effectively. Finally, a GPU-based bottom-up BFS approach is employed to process large frontier. The experimental results demonstrate that the algorithm can achieve 10% improvement over the state-of-the-art method on diverse graphs. Especially, it exhibits 2-3 times speedup on low-diameter and scale-free graphs over the state-of-the-art on a NVIDIA Tesla K20 c GPU, reaching a peak traversal rate of 11.2×109 edges/s.

关键词： breadth-first search GPU graph traversal vertex frontier

来源：评论

学校读者我要写书评

暂无评论

Predicting job failures in auvergrid based on workload log analysis

Predicting job failures in auvergrid based on workload log a...

引用

作者： Saadatfar, Hamid Fadishei, Hamid Deldari, Hossein Parallel and Distributed Processing Lab Computer Engineering Department Ferdowsi University of Mashhad Azadi Sq. Mashhad Iran

Grid systems are popular today due to their ability to solve large problems in business and science. Job failures which are inherent in any computational environment are more common in grids due to their dynamic and complex nature. Furthermore, traditional methods for job failure recovery have proven costly and thus a need to shift toward proactive and predictive management strategies is necessary in such systems. In this paper, an innovative effort has been made to predict the futurity of jobs in a production grid environment. First of all, we investigated the relationship between workload characteristics and job failures by analyzing workload traces of AuverGrid which is a part of EGEE (Enabling Grids for E-science) project. After the recognition of failure patterns, the success or failure status of jobs during 6 months of AuverGrid activity was predicted with approximately 96% accuracy. The quality of services on the grid can be improved by integrating the result of this work into management services like scheduling and monitoring. © Ohmsha, Ltd. and Springer Japan 2012.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：