Concept

Grappe de serveurs

Publications associées (223)

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

Implantation and electron emission in cluster-surface collisions

Microscopic processes induced by the controlled deposition of mass selected silver clusters on graphite (HOPG) and Pt(111) are investigated. The implantation of silver clusters into the HOPG surface is analyzed. The first step consists in a systematic stud ...

EPFL2004

C-JDBC: Flexible Database Clustering Middleware

Willy Zwaenepoel, Emmanuel Cecchet

Large web or e-commerce sites are frequently hosted on clusters. Successful open-source tools exist for clustering the front tiers of such sites (web servers and application servers). No comparable success has been achieved for scaling the backend database ...

2004

Cluster Management Software

Serge Vaudenay, Nicolas Bonvin, Pascal Junod

Cluster Management Software ...

2003

A parallel implementation of NEC for the analysis of large structures

Marcos Rubinstein, Abraham Rubinstein

We present a new, parallel version of the numerical electromagnetics code (NEC). The parallelization is based on a bidimensional block-cyclic distribution of matrices on a rectangular processor grid, assuring a theoretically optimal load balance among the ...

2003

Conflict-Aware Scheduling for Dynamic Content Applications

Willy Zwaenepoel

We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializa ...

2003

DPS - Dynamic Parallel Schedules

Roger Hersch, Sebastian Gerlach

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PC). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic ...

IEEE Press2003

Tracing attacks and restoring integrity with LASCAR

Philippe Oechslin, Alexandre Aellig

We present a novel method to trace the propagation of intrusions or malicious code in networked systems. Our solution is aimed at large numbers of loosely managed workstations typical of a research environment as found in CERN. The system tags events which ...

2003

Modeling of Si 2p core-level shifts at Si-(ZrO2)(x)(SiO2)(1-x) interfaces

Alfredo Pasquarello, Angelo Bongiorno

We model Si 2p core-level shifts at Si-(ZrO2)(x)(SiO2)(1-x) interfaces for varying Zr content x. Using a first-principles approach, we calculate Si 2p shifts for a model interface and for cluster models, and establish the validity of a linear dependence of ...

2002

General Method for Finding the Most Economical Distributed Router Architecture

In this work we present a novel method to determine the optimal parameters of a router architecture when certain router performance constraints are given. The total financial expense, or cost, is the optimality criterion. We introduce a general, essentiall ...

2002

A General Method for Finding the Most Economical Distributed Router Architecture

2002