Concept

Data-flow analysis

Publications associées (66)

Fault-tolerant dynamic parallel schedules

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers such as clusters of PCs. DPS applications are defined by using directed acyclic flow graphs composed of user-defined operations. ...

EPFL2006

Fault-tolerant parallel applications with dynamic parallel schedules: a programmer's perspective

Roger Hersch, Sebastian Gerlach

Dynamic parallel schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automatic pipelined parallel execution of applications. DPS supports graceful degr ...

Sptinger-Verlag2006

Fault-tolerant parallel applications with dynamic parallel schedules

Roger Hersch, Sebastian Gerlach

Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore drive the MTBF of such clusters to unacceptable levels. The software framewo ...

Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States2005

On Local Features for Face Verification

{W}e compare four local feature extraction techniques for the task of face verification, namely (ordered in terms of complexity): raw pixels, raw pixels with mean removal, 2D Discrete Cosine Transform (DCT) and local Principal Component Analysis (PCA). The ...

IDIAP2004

On parallel computation of blood flow in human arterial network based on 1-D modelling

Alfio Quarteroni, Luca Formaggia

Parallel computation of blood flow in a 1D model of human arterial network has been carried out employing a Taylor Galerkin finite element method. Message passing interface libraries have been used on Origin 2000 SGI machine. A Greedy strategy for load-dis ...

Springer-Verlag2003

Numerical simulation and flow analysis of an elbow diffuser

Sebastiano Mauri

Numerical simulation of the unsteady turbulent flow in a three-dimensional elbow diffuser is performed. The investigation is carried out with a commercial finite volume solver implementing the Reynolds averaged Navier-Stokes equations. Against the backgrou ...

EPFL2002

A reliable method of extracting the rheological properties of fruit purees from flow loop data

Paolo Perona

A method based on Tikhonov regularization is used to process the volumetric flow rate against pressure drop data of different fruit purees generated by large-scale flow loops. These data are converted into shear-rate-against-shear-stress curves. Curves fro ...

2002

Contention elimination by replication of sequential sections in distributed shared memory programs

Willy Zwaenepoel

In shared memory programs contention often occurs at the transition between a sequential and a parallel section of the code. As all threads start executing the parallel section, they often access data just modified by the thread that executed the sequentia ...

2001

Solving supply and load imperfections using universal power quality conditioning system

Alfred Rufer

The aim of this paper is to present a universal power quality conditioning system (UPQS) which consists of a unified power quality conditioner (UPQC) extended by adding a shunt active filter at the load side. Such system has higher harmonic compensation ch ...

2000

Universal power quality system - an extension to universal power quality conditioner

Alfred Rufer

2000

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