Publication

Optimal application-oriented resource brokering in a high performance computing grid

Publications associées (118)

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

Montgomery Multiplication on the Cell

Joppe Willem Bos, Marcelo Kaihara

A technique to speed up Montgomery multiplication targeted at the Synergistic Processor Elements (SPE) of the Cell Broadband Engine is proposed. The technique consists of splitting a number into four consecutive parts. These parts are placed one by one in ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

A Novel Parallel QR Algorithm For Hybrid Distributed Memory HPC Systems

Daniel Kressner, Bo Kågström

A novel variant of the parallel QR algorithm for solving dense nonsymmetric eigenvalue problems on hybrid distributed high performance computing systems is presented. For this purpose, we introduce the concept of multiwindow bulge chain chasing and paralle ...

2010

A hardware-software codesign framework for cellular computing

Pierre-André Mudry

Until recently, the ever-increasing demand of computing power has been met on one hand by increasing the operating frequency of processors and on the other hand by designing architectures capable of exploiting parallelism at the instruction level through h ...

EPFL2009

Performance prediction and race detection in message-passing parallel applications

Basile Schäli

The combination of low cost clusters and multicore processors lowers the barrier for accessing massive amounts of computing power. As computational sciences advance, the use of in silico simulations to complement in vivo experiments promises parallel progr ...

EPFL2009

Parallel eigenvalue reordering in real Schur forms

Daniel Kressner, Bo Kågström

A parallel algorithm for reordering the eigenvalues in the real Schur form of a matrix is presented and discussed. Our novel approach adopts computational windows and delays multiple outside-window updates until each window has been completely reordered lo ...

2009

A Rapid Bootstrap Algorithm for the RAxML Web Servers

Jacques Rougemont, Alexandros Stamatakis

Despite recent advances achieved by application of high-performance computing methods and novel algorithmic techniques to maximum likelihood (ML)-based inference programs, the major computational bottleneck still consists in the computation of bootstrap su ...

Taylor and Francis, Oxford2008

A new parallelized 3D SPH model: resolution of water entry problems ans scalability study

Pierre Maruzewski

The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...

2008

A simulator for adaptive parallel applications

Roger Hersch, Sebastian Gerlach

Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify allocation strategies and problem decomposition parameters that increase the ...

2007

Integration of Grid Cost Model into ISS/VIOLA Meta-scheduler Environment

Vincent Keller, Michela Thiémard

The Broker with the cost function model of the ISS/VIOLA Meta-Scheduling System implementation is described in details. The Broker includes all the algorithmic steps needed to determine a well suited machine for an application component. This judicious cho ...

Springer2007

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a strongly-typed event-based communication paradigm with abstractions for frugal contro ...

2007