Skip to content
View plampite's full-sized avatar

Block or report plampite

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
plampite/README.md

Hi there 👋

Pinned Loading

  1. vtkForMPI vtkForMPI Public

    An example of vtk visualization server for a fortran client application, using MPI

    C++ 2

  2. A simple, multi-dimensional linear i... A simple, multi-dimensional linear interpolation function in Fortran. Roughly inspired by FINT in Cernlib, but hopefully more readable and easy to understand.
    1
    !Copyright 2024 Paolo Lampitella
    2
    !This code is licensed under the terms of the MIT license
    3
    
                  
    4
    MODULE mod_fint
    5
    IMPLICIT NONE
  3. earlyFIT earlyFIT Public

    A framework to fit an ensemble of epidemic models to one or multiple regions at once

    MATLAB

  4. A Fortran example of a reduce step i... A Fortran example of a reduce step in MPI implemented trough simple mpi_send/recv calls. Useful when using mpi_type_create_struct and mpi_op create might be unconvenient or impossible. This version uses the basic binomial tree algorithm in MPICH.
    1
    program myreduce2
    2
       !Program to show a simple implementation of mpi_reduce, with only mpi_send/recv
    3
       !Useful for cases where one would need mpi_type_create_struct and mpi_op_create to achieve the same result
    4
       !This version uses the same MPICH binomial tree algorithm (order from 0 to nproc-1), which allows an easy
    5
       !customization of the processing order (just map each process to a different id)
  5. A Fortran example of a deadlock avoi... A Fortran example of a deadlock avoiding MPI loop among all processes, using a single-line round robin algorithm to schedule the order of communications for each process
    1
    program myalltoall
    2
       !Program to show a simple implementation of a deadlock avoiding mpi loop among all processes which,
    3
       !in principle, is similar to an alltoall loop. However, the main purpose of the technique shown here is to
    4
       !properly reorder shortest (i.e., each process with just few others) non-blocking communication loops,
    5
       !in order to alleviate the burden on the communication side (as each exchange is matched, everything