LFortran compiles POT3D
Posted on March 18, 2025
| 7 minutes
| 1395 words
| Gaurav Dhingra, Aditya Trivedi, Jinang Shah, Pranav Goswami, Saurabh Kumar, Ansh Mehta, Assem Medhat, Harshita Kalani, Parth Mistry, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Vipul Cariappa, Shivi Mathur, Kerim Birgi, Serge Sans Paille, Advik Kabra, Brian Beckman, Dylon Edwards, Naman Gera, Rohit Goswami, Dominic Poerio, Akshānsh Bhatt, Virendra Kabra, Anutosh Bhat, Luthfan Lubis, Zihua Wu, Khushi Agrawal, Christoph Junghans, Tanay Manerikar, Wolf Vollprecht, Smit Lunagariya, Paul Henning, Ondřej Čertík, Jaysukh Makvana, Harshil Shah, Gauravsingh Sisodia, Karna Pardheev Sai, Shoaib Samim
We are thrilled to announce that LFortran can now successfully compile and run predsci/POT3D, marking a significant milestone in our journey to beta. POT3D is the ninth production-grade, third-party code that LFortran can compile, bringing us closer to our goal of compiling 10 such codes—a critical step toward a beta-quality compiler.
About POT3D
POT3D: High Performance Potential Field Solver is a package developed by Predictive Science Inc., written in Fortran that computes potential field solutions to approximate the solar coronal magnetic field using observed photospheric magnetic fields as a boundary condition. It can be used to generate potential field source surface (PFSS), potential field current sheet (PFCS), and open field (OF) models. It has been (and continues to be) used for numerous studies of coronal structure and dynamics. The code is highly parallelized using MPI and is GPU-accelerated using Fortran standard parallelism (do concurrent) and OpenMP Target for data movement and device selection, along with an option to use the NVIDIA cuSparse library. The HDF5 file format is used for input/output.
[Read More]
LFortran compiles PRIMA
Posted on March 4, 2025
| 6 minutes
| 1138 words
| Jinang Shah, Ansh Mehta, Assem Medhat, Pranav Goswami, Harshita Kalani, Parth Mistry, Gaurav Dhingra, Saurabh Kumar, Aditya Trivedi, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Vipul Cariappa, Shivi Mathur, Kerim Birgi, Serge Sans Paille, Advik Kabra, Brian Beckman, Dylon Edwards, Naman Gera, Rohit Goswami, Dominic Poerio, Akshānsh Bhatt, Virendra Kabra, Anutosh Bhat, Luthfan Lubis, Zihua Wu, Khushi Agrawal, Christoph Junghans, Tanay Manerikar, Wolf Vollprecht, Smit Lunagariya, Paul Henning, Ondřej Čertík, Jaysukh Makvana, Harshil Shah, Gauravsingh Sisodia, Karna Pardheev Sai
We’re thrilled to share that LFortran can now successfully compile and execute libprima/PRIMA. PRIMA marks the eighth production-grade, third-party code that LFortran has compiled with bit-for-bit alignment to GFortran’s output. This milestone brings us closer to our goal of compiling 10 such codes—an essential step toward achieving a beta-quality compiler.
About PRIMA
PRIMA is a package developed by Zaikun Zhang for
solving general nonlinear optimization problems without using derivatives. It
provides the reference implementation for
Powell’s derivative-free optimization
methods, i.e., COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA. PRIMA means
Reference Implementation for Powell’s methods with Modernization and
Amelioration, P for Powell. The package is written in Fortran and is widely
used in the scientific community for solving optimization problems.
[Read More]
LFortran supports all intrinsic functions
Posted on November 14, 2024
| 14 minutes
| 2770 words
| Harshita Kalani, Parth Mistry, Pranav Goswami, Gaurav Dhingra, Assem Medhat, Saurabh Kumar, Jinang Shah, Aditya Trivedi, Ansh Mehta, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Vipul Cariappa, Shivi Mathur, Kerim Birgi, Serge Sans Paille, Advik Kabra, Brian Beckman, Dylon Edwards, Naman Gera, Rohit Goswami, Dominic Poerio, Akshānsh Bhatt, Virendra Kabra, Anutosh Bhat, Luthfan Lubis, Zihua Wu, Khushi Agrawal, Christoph Junghans, Tanay Manerikar, Wolf Vollprecht, Smit Lunagariya, Paul Henning, Ondřej Čertík
We are thrilled to announce that LFortran supports all intrinsic functions
listed in F2018 Interpretation Document (Table 16.1 Pg: 332) (also shown by this nice list online at GFortran’s documentation).
This comprehensive list of almost 200 intrinsics encompasses a broad array of
functions and subroutines essential to Fortran’s functionality, including
elemental, inquiry, transformational, array operations, and more. For each
function we support both compile-time and runtime evaluation.
The functions are implemented in an ASR (Abstract Semantic Representation)
pass, which means they get “instantiated” and specialized for the argument
types and then the compiler can optimize it, so using any intrinsic function is
at least as fast as implementing the same operation yourself, there is no
runtime overhead.
[Read More]
LFortran now compiles SNAP
Posted on August 27, 2024
| 7 minutes
| 1439 words
| Gaurav Dhingra, Assem Medhat, Saurabh Kumar, Pranav Goswami, Ondřej Čertík, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Harshita Kalani, Parth Mistry, Vipul Cariappa, Shivi Mathur, Kerim Birgi, Serge Sans Paille, Advik Kabra, Christoph Junghans, Tanay Manerikar, Wolf Vollprecht
We are thrilled to announce that LFortran can now successfully compile and run lanl/SNAP, marking a significant milestone in our journey to beta. SNAP is the seventh production-grade, third-party code that LFortran can compile, bringing us closer to our goal of compiling 10 such codes—a critical step toward a beta-quality compiler.
About SNAP
SNAP (SN Discrete Ordinates Application Proxy) is a proxy application designed to emulate the performance of modern discrete ordinates neutral particle transport codes. It replicates the computational workload, memory requirements, and communication patterns of the Los Alamos National Laboratory code PARTISN, without including actual physics. By using domain decomposition and parallelization across spatial, angular, and energy domains, SNAP is ideal for performance testing on cutting-edge high-performance computing systems.
[Read More]
Fortran On Web Using LFortran
Posted on May 2, 2024
| 2 minutes
| 377 words
| Ondřej Čertík, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Pranav Goswami, Harshita Kalani, Parth Mistry, Gaurav Dhingra, Smit Lunagariya, Luthfan Lubis, Naman Gera, Zihua Wu, Khushi Agrawal, Christoph Junghans, Brian Beckman, Dylon Edwards
Fortran On Web Using LFortran
Recently, there was a blog post titled Fortran on WebAssembly released by Dr George W Stagg. This article inspired us to compile the same example using our LFortran compiler. We are happy to share that we have the fortran mnist classifier example used in the blog post, compiled to WebAssembly using LFortran (with no hacks to the compiler) and working perfectly in the browser.
MNIST
We cloned the original authors code and just swapped-in two of our generated files mnist.js
and mnist.wasm
with the original files. We also fixed few minor bugs in the code that we came across (details in the commit history).
[Read More]
LFortran compiles Fortran stdlib
Posted on April 16, 2024
| 4 minutes
| 822 words
| Ondřej Čertík, Gagandeep Singh, Ubaid Shaikh, Thirumalai Shaktivel, Pranav Goswami, Harshita Kalani, Parth Mistry, Gaurav Dhingra, Smit Lunagariya, Luthfan Lubis, Naman Gera, Zihua Wu, Khushi Agrawal, Christoph Junghans, Brian Beckman, Dylon Edwards
LFortran compiles 85% Fortran stdlib
We are happy to announce that LFortran can compile all numerical modules in stdlib
. The stdlib
library has 32 modules, here are the details of the current status:
- all 32 modules compile to ASR
- 27 modules (85%) compile to LLVM; there are 4 hash modules (
hash_32bit
, hash_64bit
, hashmaps
, hashmap_wrappers
, stringlist_type
) and one stringlist_type
module that does not compile to LLVM yet
- 24 modules pass all their tests; 3 modules (
sorting
, bitsets
, stats
) do not pass all tests yet, but simple examples that use the modules work
This is sixth third-party production-grade code that LFortran can compile after SciPy. The progress bar towards beta has thus reached 6/10.
[Read More]