Publications associées à Fortran

The splay-list: a distribution-adaptive concurrent skip-list

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...

ASSOC COMPUTING MACHINERY2022

Parallel Hybrid Simulations of Block Copolymer Nanocomposites using Coarray Fortran

Ignacio Pagonabarraga Mora

Computer simulations of experimentally comparable system sizes in soft matter often require considerable elapsed times. The use of many cores can reduce the needed time, ideally proportionally to the number of processors. In this paper a parallel computati ...

WILEY-V C H VERLAG GMBH2021

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain, Jonathan Immanuel Brachthäuser

2021

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Felix Schürmann, Michael Lee Hines

Modern asynchronous runtime systems allow the re-thinking of large-scale scientific applications. With the example of a simulator of morphologically detailed neural networks, we show how detaching from the commonly used bulk-synchronous parallel (BSP) exec ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

The LifeV library: engineering mathematics beyond the proof of concept

Simone Deparis, Davide Forti, Luca Formaggia

LifeV is a library for the finite element (FE) solution of partial differential equations in one, two, and three dimensions. It is written in C++ and designed to run on diverse parallel architectures, including cloud and high performance computing faciliti ...

2018

Algorithmic Resource Verification

Ravichandhran Kandhadai Madhavan

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

EPFL2017

A C++11 implementation of arbitrary-rank tensors for high-performance computing

Alejandro Marcos Aragon

This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a s ...

Elsevier Science Bv2014

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Fortran

Automated Formal Verification of Software Network Functions

The splay-list: a distribution-adaptive concurrent skip-list

Type-Level Programming with Match Types

Parallel Hybrid Simulations of Block Copolymer Nanocomposites using Coarray Fortran

Type-Level Programming with Match Types

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

The LifeV library: engineering mathematics beyond the proof of concept

Algorithmic Resource Verification

Reliable and Real-Time Distributed Abstractions

A C++11 implementation of arbitrary-rank tensors for high-performance computing

Graph Chatbot

Chattez avec Graph Search

The splay-list: a distribution-adaptive concurrent skip-list

Type-Level Programming with Match Types

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Automated Formal Verification of Software Network Functions

The LifeV library: engineering mathematics beyond the proof of concept

Parallel Hybrid Simulations of Block Copolymer Nanocomposites using Coarray Fortran

A C++11 implementation of arbitrary-rank tensors for high-performance computing

Type-Level Programming with Match Types

Reliable and Real-Time Distributed Abstractions

Algorithmic Resource Verification