Concept

Embarrassingly parallel

Publications associées (274)

Task scheduling for highly concurrent analytical and transaction workloads

Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...

2020

An Optimizing Multi-platform Source-to-source Compiler Framework for the NEURON MODeling Language

Felix Schürmann, James Gonzalo King, Michael Lee Hines, Pramod Shivaji Kumbhar, Jorge Blanco Alonso, Omar Awile, Liam Roger George Keegan

Domain-specific languages (DSLs) play an increasingly important role in the generation of high performing software. They allow the user to exploit domain knowledge for the generation of more efficient code on target architectures. Here, we describe a new c ...

Springer2020

Manycore clique enumeration with fast set intersections

Paolo Ienne, Kubilay Atasu, Radu Ioan Stoica, Jovan Blanusa

Listing all maximal cliques of a given graph has important applications in the analysis of social and biological networks. Parallelisation of maximal clique enumeration (MCE) algorithms on modern manycore processors is challenging due to the task-level par ...

ACM2020

The Error-Feedback Framework: Better Rates for SGD with Delayed Gradients and Compressed Updates

Sebastian Urban Stich, Sai Praneeth Reddy Karimireddy

We analyze (stochastic) gradient descent (SGD) with delayed updates on smooth quasi-convex and non-convex functions and derive concise, non-asymptotic, convergence rates. We show that the rate of convergence in all cases consists of two terms: (i) a stocha ...

MICROTOME PUBL2020

MATHICSE technical Report : Stabilized explicit multirate methods for stiff differential equations

Assyr Abdulle, Giacomo Rosilho De Souza

Stabilized Runge–Kutta (aka Chebyshev) methods are especially efficient for the numerical solution of large systems of stiff differential equations because they are fully explicit; hence, they are inherently parallel and easily accommodate nonlinearity. Fo ...

MATHICSE2020

Massively parallel coherent laser ranging using a soliton microcomb

Tobias Kippenberg, Junqiu Liu, Maxim Karpov, Erwan Guillaume Albert Lucas, Wenle Weng, Anton Lukashchuk

Coherent ranging, also known as frequency-modulated continuous-wave (FMCW) laser-based light detection and ranging (lidar)(1) is used for long-range three-dimensional distance and velocimetry in autonomous driving(2,3). FMCW lidar maps distance to frequenc ...

NATURE PUBLISHING GROUP2020

Essays on adaptation to rare disasters

Takafumi Usui

This thesis aims to further investigate rare natural disasters and studies adaptation decisions under uncertainty by solving several computational economic models. The modeling of rare natural disasters depends on the treatment of catastrophic outcomes wit ...

EPFL2019

Improving Main-memory Database System Performance through Cooperative Multitasking

Georgios Psaropoulos

Database systems access memory either sequentially or randomly. Contrary to sequential access and despite the extensive efforts of computer architects, compiler writers, and system builders, random access to data larger than the processor cache has been s ...

EPFL2019

Bridging the Latency Gap between NVM and DRAM for Latency-bound Operations

Anastasia Ailamaki, Georgios Psaropoulos

Non-Volatile Memory (NVM) technologies exhibit 4× the read access latency of conventional DRAM. When the working set does not fit in the processor cache, this latency gap between DRAM and NVM leads to more than 2× runtime increase for queries dominated by ...

ACM2019

GPU-Accelerated Finite Volume Particle Simulation of Free Jet Deviation by Multi-jet Rotating Pelton Runner

Siamak Alimirzazadeh

Numerical simulation of Pelton turbine hydrodynamics is helpful to identify the energy loss mechanisms in the runner and minimize their effect. However, it is a challenging task that involves handling the unsteady free surface flow and moving boundaries re ...

EPFL2019

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search