نتایج جستجو برای: fortran programming language

تعداد نتایج: 633486  

Journal: :Computer Physics Communications 2010
Janusz Rosiek P. H. Chankowski A. Dedes S. Jäger P. Tanedo

We present SUSY FLAVOR — a Fortran 77 program that calculates important leptonic and semi-leptonic low-energy observables in the general R-parity conserving MSSM. For a set of input MSSM parameters, the code gives predictions for the K̄K, D̄D, B̄dBd and B̄sBs mixing parameters; B → Xsγ, Bs,d → l+l−, K L → πν̄ν and K → πν̄ν decay branching ratios; and the electric dipole moments of the leptons and the...

1991
Edwin M. Paalvast Henk J. Sips Leo C. Breebaart

The development of programming languages suitable to express parallel algorithms in is crucial to the pace of acceptance of parallel processors for production applications. As in sequential programming, portability of parallel software is a strongly desirable feature. Portability in this respect means that given an algorithm description in a parallel programming language, it must be possible, w...

Journal: :Parallel Computing 2001
Piyush Mehrotra Hans P. Zima

This paper focuses on the use of High Performance Fortran (HPF) for important classes of algorithms employed in aerospace applications. HPF is a set of Fortran extensions designed to provide users with a high-level interface for programming data parallel scienti c applications, while delegating to the compiler/runtime system the task of generating explicitly parallel message-passing programs. W...

1994
Donna Bergmark

We have been experimenting with combining three powerful language tools for large, scien-tiic, parallel Fortran codes. One tool is ParaScope, a programming environment; another tool is the Lambda Toolkit, a collection of routines for performing loop transformations using invertible matrices; the third is FORGE 90, a collection of tools for parallelizing Fortran programs. Initial success with in...

2000
Arnaud Desitter Antoine Le Hyaric Geoff Morgan Gareth Shaw Anne E. Trefethen

In developing libraries we need to consider always the needs of the application developers. These vary according to the computational problems that they are developing, the software environment in which they work, and the computing architectures that are available to them. When NAG first became involved in the development of numerical libraries the language was FORTRAN, the computing architectu...

1996
Christian Clémençon Karsten M. Decker Vaibhav R. Deshpande Akiyoshi Endo Josef Fritscher Paulo A. R. Lorenzo Norio Masuda Andreas Müller Roland Rühl William Sawyer Brian J. N. Wylie Frank Zimmermann

High Performance Fortran (HPF) compilers and communication libraries with the standardized Message Passing Interface (MPI) are becoming widely available, easing the development of portable parallel applications on distributed-memory parallel processor systems. The recently developed Annai tool environment supports programming, debugging and tuning of both HPFand MPI-based applications. Consider...

Journal: :Environmental Modelling and Software 2012
Antoni Jordi Dong-Ping Wang

Software availability Software name: sbPOM Developers: Antoni Jordi and Dong-Ping Wang Contact: [email protected] Software requirements: Linux or Unix, fortran compiler, mpich 2, parallel NetCDF Programming language: Fortran 77 Availability and cost: Test cases are available at http://imedea.uibcsic.es/users/toni/sbpom at no cost 1. Overview Ocean circulation models are an integral part o...

2007
Christian H. Bischof H. Martin Bücker Bruno Lang Arno Rasch

Automatic differentiation is a powerful technique for evaluating derivatives of functions given in the form of a high-level programming language such as Fortran, C, or C++. The program is treated as a sequence of elementary statements to which the chain rule of differential calculus is applied mechanically. A key feature of this technique is its ability to generate accurate derivatives rather t...

1999
Lie-Quan Lee Jeremy G. Siek Andrew Lumsdaine

Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic ...

Journal: :J. Parallel Distrib. Comput. 1996
Ravikanth Ganesan Kannan Govindarajan Min-You Wu

| The Connection Machine CM-5 supports both SIMD and MIMD programming modes. The SIMD mode is simulated over the MIMD mode. This simulation is likely to lead to a loss of performance in SIMD programs. This paper describes a comparison of the two programming modes with CM Fortran and message-passing Fortran. Two kinds of benchmarks are discussed. The rst kind consists of synthetic benchmarks in ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید