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

arXiv 2019年

作者： Zahaf, Houssam-Eddine Capodieci, Nicola Cavicchioli, Roberto Bertogna, Marko Lipari, Giuseppe

Recent commercial hardware platforms for embedded real-time systems feature heterogeneous processing units and computing accelerators on the same System-on-Chip. When designing complex real-time application for such architectures, the designer needs to make a number of difficult choices: On which processor should a certain task be implemented? Should a component be implemented in parallel or sequentially? These choices may have a great impact on feasibility, as the difference in the processor internal architectures impact on the tasks' execution time and preemption cost. To help the designer explore the wide space of design choices and tune the scheduling parameters, in this paper we propose a novel real-time application model, called C-DAG, specifically conceived for heterogeneous platforms. A C-DAG allows to specify alternative implementations of the same component of an application for different processing engines to be selected off-line, as well as conditional branches to model if-then-else statements to be selected at run-time. We also propose a schedulability analysis for the C-DAG model and a heuristic allocation algorithm so that all deadlines are respected. Our analysis takes into account the cost of preempting a task, which can be non-negligible on certain processors. We demonstrate the effectiveness of our approach on a large set of synthetic experiments by comparing with state of the art algorithms in the literature. Copyright © 2019, The Authors. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

MAGDA: a software environment for mobile agent based distributed applications

MAGDA: a software environment for mobile agent based distrib...

引用

Euromicro Conference on parallel, Distributed and Network-Based Processing

作者： R. Aversa B. Di Martino N. Mazzocca S. Venticinque Facoltà di Ingegneria-Dipartimento di Ingegneria dell'Informazione Second University of Naples Italy

The mobile agents model has the potential to provide a flexible framework to face the challenges of high performance computing, especially when targeted towards heterogeneous distributed architectures. We developed a framework for supporting programming and execution of mobile agent based distributed applications, the MAGDA (Mobile Agents Distributed Applications) toolset. It supplements mobile agent technology with a set of features for supporting parallel programming on a dynamic heterogeneous distributed environment.

关键词： Mobile agents Application software Dynamic programming Network servers parallel programming Java High performance computing Computer architecture Distributed computing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Performance and granularity control in the SPaDES parallel simulation system

Performance and granularity control in the SPaDES parallel s...

引用

International Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Yong-Meng Teo Seng-Chuan Tay School of Computing National University Singapore

parallel simulation has the potential to accelerate the execution of simulation applications. However developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimising performance. This paper presents an overview of the SPaDES (Structured parallel Discrete-Event Simulation) parallel simulation framework. We focus on the performance analysis of SPaDES/C++, an implementation of SPaDES on a distributed-memory Fujitsu AP3000 parallel computer. SPaDES/C++ hides the underlying complex parallel simulation synchronization and parallel programming details from the simulationist. Our empirical results show that the SPaDES framework can deliver good speedup if the process granularity is properly optimised.

关键词： Computational modeling Concurrent computing Read only memory parallel programming Discrete event simulation programming environments Distributed computing Independent component analysis Liver Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Trace-based KPN composability analysis for mapping simultaneous applications to MPSoC platforms 10

Trace-based KPN composability analysis for mapping simultane...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Jeronimo Castrillon Ricardo Velasquez Anastasia Stulova Weihua Sheng Jianjiang Ceng Rainer Leupers Gerd Ascheid Heinrich Meyr Institute of Integrated Signal Processing Systems (ISS) RWTH Aachen University Germany ALaRI Institute Lugano Switzerland

ISBN: (纸本)9783981080162

Nowadays, most embedded devices need to support multiple applications running concurrently. In contrast to desktop computing, very often the set of applications is known at design time and the designer needs to assure that critical applications meet their constraints in every possible use-case. In order to do this, all possible use-cases, i.e. subset of applications running simultaneously, have to be verified thoroughly. An approach to reduce the verification effort, is to perform composability analysis which has been studied for sets of applications modeled as Synchronous Dataflow Graphs. In this paper we introduce a framework that supports a more general parallel programming model based on the Kahn Process Networks Model of Computation and integrates a complete MPSoC programming environment that includes: compiler-centric analysis, performance estimation, simulation as well as mapping and scheduling of multiple applications. In our solution, composability analysis is performed on parallel traces obtained by instrumenting the application code. A case study performed on three typical embedded applications, JPEG, GSM and MPEG-2, proved the applicability of our approach.

关键词： Simultaneous localization and mapping Performance analysis Computational modeling parallel programming Computer networks Concurrent computing programming environments Program processors Analytical models Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Techniques supporting threadprivate in OpenMP 06

Techniques supporting threadprivate in OpenMP

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： X. Martorell M. Gonzalez A. Duran J. Balart R. Ferrer E. Ayguade J. Labarta Barcelona Supercomputing Center-Computer Architecture Department Technical University Catalunya Barcelona Spain

ISBN: (纸本)9781424400546

This paper presents the alternatives available to support threadprivate data in OpenMP and evaluates them. We show how current compilation systems rely on custom techniques for implementing thread-local data. But in fact the ELF binary specification currently supports data sections that become threadprivate by default. ELF naming for such areas is thread-local storage (TLS). Our experiments demonstrate that implementing threadprivate based on the TLS support is very easy, and more efficient. This proposal goes in the same line as the future implementation of OpenMP on the GNU compiler collection. In addition, our experience with the use of threadprivate in OpenMP applications shows that usually it is better to avoid it. This is because threadprivate variables reside in common blocks and they impede the compiler to fully optimize the code. So it is better to keep threadprivate as a temporary technique only to ease porting MPI codes to OpenMP

关键词： Ground penetrating radar Geophysical measurement techniques Yarn Proposals parallel processing Computer architecture Impedance Optimizing compilers parallel programming Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Object Oriented MPI (OOMPI): a class library for the Message Passing Interface

Object Oriented MPI (OOMPI): a class library for the Message...

引用

Proceedings of the MPI Developer's Conference

作者： B.C. McCandless J.M. Squyres A. Lumsdaine Laboratory for Scientific Computing Department of Computer Science and Engineering University of Notre Dame Notre Dame IN USA

Using the Message Passing Interface (MPI) in C++ has been difficult up to this point, because of the lack of suitable C++ bindings and C++ class libraries. The existing MPI standard provides language bindings only for C and Fortran 77, precluding their direct use in object-oriented programming. Even the proposed C++ bindings in MPI-2 are at a fairly low-level and are not directly suitable for object-oriented programming. In this paper, we present the requirements, analysis and design for Object-Oriented MPI (OOMPI), a C++ class library for MPI. Although the OOMPI class library is specified in C++, in some sense the specification is a generic one that uses C++ as the program description language. Thus, the OOMPI specification can also be considered as a generic object-oriented class library specification which can thus also form the basis for MPI class libraries in other object-oriented languages.

关键词： Libraries Message passing Laboratories Scientific computing Computer science Object oriented programming parallel programming Writing programming profession Functional programming

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of image matching with MPI

Parallel implementation of image matching with MPI

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Ismail Sheikh Alfonso Oviedo Alejandro Emerio Nagi Mekhiel Ryerson University Toronto ON CA Dept. of Electrical & Computer Engineering (ECE) Ryerson University Toronto Canada

In this paper, the performance of parallel computing will be thoroughly discussed in the domain of image matching. The concept of image matching is widely used in the areas of security, medical and computer vision which require comparing two images for similarities. However, depending on the size of images, it is highly possible that the application computation cannot be handled in a single processor running a sequential algorithm. In order to overcome this limitation, parallel computing is introduced through the Message Passing Interface (MPI) library. In this project, for the comparison of two images, both images are first converted into grayscale and then are compared using the Sum of Square Differences (SSD) algorithm. Further, a parallel network of 12 processors was implemented for image matching and to calculate the performance of the SSD algorithm between both images. The performance gain of 12, 8, 4 and 2 processors was compared with the performance of a single processor. The comparison results presented a linear relationship between the performance gain and the number of processors used for execution. Hence, it proves that there are significant benefits of parallelism on SSD applications.

关键词： Computational modeling Image matching Computers Performance gain parallel processing parallel programming Mathematical model

来源：评论

学校读者我要写书评

暂无评论

parallelization via context preservation

Parallelization via context preservation

引用

International Conference on Computer Languages

作者： Wei-Ngan Chin A. Takano Zhenjiang Hu Hitachi Advanced Research Laboratory National University of Singapore Singapore Hitachi Advanced Research Laboratory Japan University of Tokyo Japan

Abstract program schemes, such as scan or homomorphism, can capture a wide range of data parallel programs. While versatile, these schemes are of limited practical use on their own. A key problem is that the more natural sequential specifications may not have associative combine operators required by these schemes. As a result, they often fail to be immediately identified. To resolve this problem, the authors propose a method to systematically derive parallel programs from sequential definitions. This method is special in that it can automatically invent auxiliary functions needed by associative combine operators. Apart from a formalisation, they also provide new theorems, based on the notion of context preservation, to guarantee parallelization for a precise class of sequential programs.

关键词： parallel processing parallel programming Tree graphs Laboratories parallel architectures Vector processors Concurrent computing Numerical analysis Sorting Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

GAME: a framework for programming genetic algorithms applications

GAME: a framework for programming genetic algorithms applica...

引用

IEEE International Conference on Evolutionary Computation

作者： J.L. Ribeiro-Filho P.C. Treleaven Department of Computer Science University College London London UK

The GAME system is a programming environment being developed at University College London as part of the major European project, aimed at promoting and demonstrating the use of genetic algorithms in real world applications. GAME is target at the development and execution of complex sequential, concurrent or parallel applications, based on the genetic algorithm (GA) paradigm. Its object-oriented design and implementation provide the required levels of abstraction to describe and configure applications for a broad range of domains. GAME addresses the basic requirements involved in the design cycle of a GA application; it offers a set of genetic-oriented data structures, objects and straightforward programming interfaces that permit the implementation of a variety of GAs and parallel GAs. The underlying infrastructure provides the mechanisms for problem independent manipulation of data structures, monitoring, and execution on a virtual computing environment supporting multiple parallel computation models. Applications are constructed from parameterised libraries containing algorithms and genetic operators modules. GAME is highly customisable and its libraries can be easily expanded with the inclusion of new parameterised modules. Novice users can rapidly configure and execute pre-defined applications by simply setting up few parameters. Programmers can create new applications by combining pre-defined algorithms and genetic operators, or by directly programming new algorithms using the set of C++ classes provided. A graphic interface and monitoring facilities are also available in GAME.< >

关键词： Genetic algorithms Data structures Concurrent computing Libraries programming environments Educational institutions parallel programming Computational modeling Object oriented modeling programming profession

来源：评论

学校读者我要写书评

暂无评论

DLoVe: using constraints to allow parallel processing in multi-user virtual reality

DLoVe: using constraints to allow parallel processing in mul...

引用

IEEE Annual International Symposium Virtual Reality

作者： L. Deligiannidis R.J.K. Jacob Department of Electrical Engineering and Computer Science Tufts University MA USA

ISBN: (纸本)0769514928

In this paper, we introduce DLoVe, a new paradigm for designing and implementing distributed and nondistributed virtual reality applications, using one-way constraints. DLoVe allows programs written in its framework to be executed on multiple computers for improved performance. It also allows easy specification and implementation of multi-user interfaces. DLoVe hides all the networking aspects of message passing among the machines in the distributed environment and performs the needed network optimizations. As a result, a user of DLoVe does not need to understand parallel and distributed programming to use the system; he or she needs only be able to use the serial version of the user interface description language. parallelizing the computation is performed by DLoVe, without modifying the interface description.

关键词： parallel processing Virtual reality User interfaces Computer interfaces Jacobian matrices Message passing Delay Design optimization parallel programming Writing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：