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

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2013年第7期39卷 917-929页

作者： Brandt, Jens Gemuende, Mike Schneider, Klaus Shukla, Sandeep K. Talpin, Jean-Pierre Univ Kaiserslautern Dept Comp Sci D-67653 Kaiserslautern Germany Virginia Tech Arlington Res Ctr Hume Ctr Natl Secur & Technol Arlington VA 22203 USA IRISA INRIA Rennes INRIA Rennes Bretagne Atlantique F-35042 Rennes France

This paper presents an embedding of polychronous programs into synchronous ones. Due to this embedding, it is not only possible to deepen the understanding of these different models of computation, but, more importantly, it is possible to transfer compilation techniques that were developed for synchronous programs to polychronous programs. This transfer is nontrivial because the underlying paradigms differ more than their names suggest: Since synchronous systems react deterministically to given inputs in discrete steps, they are typically used to describe reactive systems with a totally ordered notion of time. In contrast, polychronous system models entail a partially ordered notion of time, and are most suited to interface a system with an asynchronous environment by specifying input/output constraints from which a deterministic controller may eventually be refined and synthesized. As particular examples for the mentioned cross fertilization, we show how a simulator and a verification backend for synchronous programs can be made available to polychronous specifications, which is a first step toward integrating heterogeneous models of computation.

关键词： Model-driven embedded software synchronous programming polychronous programming programming models synchrony hypothesis synchronous guarded commands

来源：评论

学校读者我要写书评

暂无评论

A survey of software implementations used by application codes in the Exascale Computing Project

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2022年第1期36卷 5-12页

作者： Evans, Thomas M. Siegel, Andrew Draeger, Erik W. Deslippe, Jack Francois, Marianne M. Germann, Timothy C. Hart, William E. Martin, Daniel F. Oak Ridge Natl Lab Oak Ridge TN USA Argonne Natl Lab 9700 S Cass Ave Argonne IL 60439 USA Lawrence Livermore Natl Lab Livermore CA USA Lawrence Berkeley Natl Lab Berkeley CA USA Los Alamos Natl Lab Washington DC USA Sandia Natl Labs Livermore CA USA

The US Department of Energy Office of Science and the National Nuclear Security Administration initiated the Exascale Computing Project (ECP) in 2016 to prepare mission-relevant applications and scientific software for the delivery of the exascale computers starting in 2023. The ECP currently supports 24 efforts directed at specific applications and six supporting co-design projects. These 24 application projects contain 62 application codes that are implemented in three high-level languages-C, C++, and Fortran-and use 22 combinations of graphical processing unit programming models. The most common implementation language is C++, which is used in 53 different application codes. The most common programming models across ECP applications are CUDA and Kokkos, which are employed in 15 and 14 applications, respectively. This article provides a survey of the programming languages and models used in the ECP applications codebase that will be used to achieve performance on the future exascale hardware platforms.

关键词： Exascale Computing Project graphical processing unit computational physics applications programming models

来源：评论

学校读者我要写书评

暂无评论

Parallel programming of multi-processor SoC:: A HW-SW interface perspective

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2008年第1期36卷 68-92页

作者： Kriaa, Lobna Bouchhima, Aimen Gligor, Marius Fouillart, Anne-Marie Petrot, Frederic Jerraya, Ahmed-Amine TIMA Lab SLS Grp F-38031 Grenoble France Land & Joint Syst EDS DHD THALES F-92704 Colombes France

For the design of classic computers the parallel programming concept is used to abstract HW/SW interfaces during high level specification of application software. The software is then adapted to existing multiprocessor platforms using a low level software layer that implements the programming model. Unlike classic computers, the design of heterogeneous MPSoC includes also building the processors and other kind of hardware components required to execute the software. In this case, the programming model hides both hardware and software refinements. This paper deals with parallel programming models to abstract both hardware and software interfaces in the case of heterogeneous MPSoC design. Different abstraction levels will be needed. For the long term, the use of higher level programming models will open new vistas for optimization and architecture exploration like CPU/RTOS tradeoffs.

关键词： programming models HW/SW interfaces heterogeneous MPSoC

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED-programming WITH LOGIC TUPLE SPACES

引用

NEW GENERATION COMPUTING 1994年第3期12卷 251-284页

作者： CIANCARINI, P 1. University of Bologna Piazza Porta S. Donato 5 40127 Bologna Italy

From the point of view of distributed programming one of the most interesting communication mechanisms is associative tuple matching in a shared dataspace, as exemplified in the Linda coordination language. Linda has been used as a coordination layer to parallelize several sequential programming languages, such as C and Scheme. In this paper we study the combination of Linda with a logic language, whose result is the language Extended Shared Prolog (ESP). We show that ESP is based on a new programming model called PoliS, that extends Linda with Multiple Tuple Spaces. A class of applications for ESP is discussed, introducing the concept of ''open multiple tuple spaces''. Finally, we show how the distributed implementation of ESP uses the network version of Linda's tuple space.

关键词： DISTRIBUTED programming programming models COORDINATION PROLOG programming ENVIRONMENT

来源：评论

学校读者我要写书评

暂无评论

Analysis of Threading Libraries for High Performance Computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2020年第9期69卷 1279-1292页

作者： Castello, Adrian Gual, Rafael Mayo Seo, Sangmin Balaji, Pavan Quintana-Orti, Enrique S. Pena, Antonio J. Univ Jaume 1 Castellon De La Plana 12071 Spain Univ Jaume 1 Dept Comp Sci & Engn Castellon De La Plana 12071 Spain Ground X Seoul 135732 South Korea Argonne Natl Lab Lemmont IL 60439 USA Univ Politecn Valencia Comp Architecture Valencia 46022 Spain Barcelona Supercomp Ctr BSC Comp Sci Dept Barcelona 08034 Spain

With the appearance of multi-/many core machines, applications and runtime systems have evolved in order to exploit the new on-node concurrency brought by new software paradigms. POSIX threads (Pthreads) was widely-adopted for that purpose and it remains as the most used threading solution in current hardware. Lightweight thread (LWT) libraries emerged as an alternative offering lighter mechanisms to tackle the massive concurrency of current hardware. In this article, we analyze in detail the most representative threading libraries including Pthread- and LWT-based solutions. In addition, to examine the suitability of LWTs for different use cases, we develop a set of microbenchmarks consisting of OpenMP patterns commonly found in current parallel codes, and we compare the results using threading libraries and OpenMP implementations. Moreover, we study the semantics offered by threading libraries in order to expose the similarities among different LWT application programming interfaces and their advantages over Pthreads. This article exposes that LWT libraries outperform solutions based on operating system threads when tasks and nested parallelism are required.

关键词： Message systems Libraries Instruction sets Task analysis Hardware Parallel processing Concurrent computing Lightweight threads OpenMP GLT POSIX threads programming models

来源：评论

学校读者我要写书评

暂无评论

A DYNAMIC-programming MODEL OF FRACTIONAL FLOWS WITH APPLICATION TO MAINTENANCE AND REPLACEMENT PROBLEMS

引用

MATHEMATICS OF OPERATIONS RESEARCH 1981年第3期6卷 405-419页

作者： FLYNN, J

This paper studies a deterministic dynamic programming model of fractional flows in an n-sector system, characterizing its solutions under general conditions, and developing algorithms for their computation. The calculations that the latter entail are not much more difficult than those needed for an n-state Markovian decision process (in certain restrictive cases, the model is "isomorphic" to an n-state MDP). Some of our results extend to a stochastic model as a "certainty equivalence." Applications include a maintenance/replacement/sales model, a manpower retention model that extends Flynn [8], [9], Grinold-Stanford [19] and Stanford [26], and a constrained version of Pliska's [25] branching model.

关键词： programming models Dynamic programming Dynamic modeling Lagrangian function Stochastic models Human resources Mathematical vectors Mathematical theorems Determinism

来源：评论

学校读者我要写书评

暂无评论

Automated parallel execution of distributed task graphs with FPGA clusters

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2024年 160卷 808-824页

作者： Ruiz, Juan Miguel de Haro Martinez, Carlos alvarez Jimenez-Gonzalez, Daniel Martorell, Xavier Ueno, Tomohiro Sano, Kentaro Ringlein, Burkhard Abel, Francois Weiss, Beat Barcelona Supercomp Ctr Barcelona Spain Univ Politecn Cataluna Barcelona Spain Riken Ctr Computat Sci Kobe Hyogo Japan IBM Res Europe Zurich Switzerland

Over the years, Field Programmable Gate Arrays (FPGA) have been gaining popularity in the High Performance Computing (HPC) field, because their reconfigurability enables very fine-grained optimizations with low energy cost. However, the different characteristics, architectures, and network topologies of the clusters have hindered the use of FPGAs at a large scale. In this work, we present an evolution of OmpSs@FPGA, a high-level taskbased programming model and extension to OmpSs-2, that aims at unifying all FPGA clusters by using a message-passing interface that is compatible with FPGA accelerators. These accelerators are programmed with C/C++ pragmas, and synthesized with High-Level Synthesis tools. The new framework includes a custom protocol to exchange messages between FPGAs, agnostic of the architecture and network type. On top of that, we present a new communication paradigm called Implicit Message Passing (IMP), where the user does not need to call any message-passing API. Instead, the runtime automatically infers data movement between nodes. We test classic message passing and IMP with three benchmarks on two different FPGA clusters. One is cloudFPGA, a disaggregated platform with AMD FPGAs that are only connected to the network through UDP/TCP/IP. The other is ESSPER, composed of CPU-attached Intel FPGAs that have a private network at the ethernet level. In both cases, we demonstrate that IMP with OmpSs@FPGA can increase the productivity of FPGA programmers at a large scale thanks to simplifying communication between nodes, without limiting the scalability of applications. We implement the N-body, Heat simulation and Cholesky decomposition benchmarks, and show that FPGA clusters get 2.6x and 2.4x better performance per watt than a CPU-only supercomputer for N-body and Heat.

关键词： FPGA MPI Task graphs Heterogeneous computing High performance computing programming models Distributed computing

来源：评论

学校读者我要写书评

暂无评论

GridFOR: A Domain Specific Language for Parallel Grid-Based Applications

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2016年第3期44卷 427-448页

作者： Wang, Ye Li, Zhiyuan Purdue Univ Dept Comp Sci W Lafayette IN 47906 USA

To ease the programming burden and to make parallel programs more maintainable, computational scientists and engineers currently have the options to use software libraries, templates, and general purpose language extensions to compose their application programs. These existing options, unfortunately, have considerable limitations with compatibility, expressive power and delivered performance. To address these issues, we design a domain specific language, GridFOR, for computational problems defined over regular geometric grids. This language allows the programmer to first implement an algorithm on simple data structures, as commonly illustrated in textbooks or papers. The programmer then specifies transformations to extend the algorithm for complex data structures required by the target applications. We build a compiler to automatically translate a GridFOR program to a parallel Fortran version with Message Passing Interface calls. Several optimization techniques are implemented in our compiler to enhance the program speed.

关键词： Domain specific languages programming models Program transformation Compiler analysis and optimization

来源：评论

学校读者我要写书评

暂无评论

THE PROGRAMMERS PLAYGROUND - I/O ABSTRACTION FOR USER-CONFIGURABLE DISTRIBUTED APPLICATIONS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1995年第9期21卷 735-746页

作者： GOLDMAN, KJ SWAMINATHAN, B MCCARTNEY, TP ANDERSON, MD SETHURAMAN, R MICROSOFT CORP REDMOND WA 98052 USA

I/D abstraction is offered as a new high-level approach to interprocess communication. Functional components of a distributed system are written as encapsulated modules that act upon local data structures, some of which may be published for external use. Relationships among modules are specified by logical connections among their published data structures. Whenever a module updates published data, I/O takes place implicitly according to the configuration of logical connections. The Programmers' Playground, a software library and runtime system supporting I/O abstraction, is described. Design goals include the separation of communication from computation, dynamic reconfiguration of the communication structure, and the uniform treatment of discrete and continuous data types. Support for end-user configuration of distributed multimedia applications is the motivation for the work.

关键词： DISTRIBUTED programming ENVIRONMENTS DISTRIBUTED SYSTEMS programming models DISTRIBUTED APPLICATIONS DYNAMIC RECONFIGURATION

来源：评论

学校读者我要写书评

暂无评论

RedThreads: An Interface for Application-Level Fault Detection/Correction Through Adaptive Redundant Multithreading

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2018年第2期46卷 225-251页

作者： Hukerikar, Saurabh Teranishi, Keita Diniz, Pedro C. Lucas, Robert F. Univ Southern Calif Inst Informat Sci 4676 Admiralty WaySuite 1001 Marina Del Rey CA 90292 USA Sandia Natl Labs 7011 East Ave Livermore CA 94551 USA

In the presence of accelerated fault rates, which are projected to be the norm on future exascale systems, it will become increasingly difficult for high-performance computing (HPC) applications to accomplish useful computation. Due to the fault-oblivious nature of current HPC programming paradigms and execution environments, HPC applications are insufficiently equipped to deal with errors. We believe that HPC applications should be enabled with capabilities to actively search for and correct errors in their computations. The redundant multithreading (RMT) approach offers lightweight replicated execution streams of program instructions within the context of a single application process. However, the use of complete redundancy incurs significant overhead to the application performance. In this paper we present RedThreads, an interface that provides application-level fault detection and correction based on RMT, but applies the thread-level redundancy adaptively. We describe the RedThreads syntax and semantics, and the supporting compiler infrastructure and runtime system. Our approach enables application programmers to scope the extent of redundant computation. Additionally, the runtime system permits the use of RMT to be dynamically enabled, or disabled, based on the resiliency needs of the application and the state of the system. Our experimental results demonstrate how adaptive RMT exploits programmer insight and runtime inference to dynamically navigate the trade-off space between an application's resilience coverage and the associated performance overhead of redundant computation.

关键词： Resilience Exascale Redundant multithreading programming models Runtime systems Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：