Concept

Job Control Language

Publications associées (10)

Workflows in AiiDA: Engineering a high-throughput, event-based engine for robust and modular computational workflows

Nicola Marzari, Giovanni Pizzi, Martin Uhrin, Sebastiaan Philippe Huber

Over the last two decades, the field of computational science has seen a dramatic shift towards incorporating high-throughput computation and big-data analysis as fundamental pillars of the scientific discovery process. This has necessitated the developmen ...

2020

Hybrid, Job-Aware, and Preemptive Datacenter Scheduling

Pamela Isabel Delgado Borda

Scheduling in datacenters is an important, yet challenging problem. Datacenters are composed of a large number, typically tens of thousands, of commodity computers running a variety of data-parallel jobs. The role of the scheduler is to assign cluster reso ...

EPFL2018

HCloud: Resource-Efficient Provisioning in Shared Cloud Systems

Christos Kozyrakis

Cloud computing promises flexibility and high performance for users and cost efficiency for operators. To achieve this, cloud providers offer instances of different sizes, both as long-term reservations and short-term, on-demand allocations. Unfortunately, ...

Assoc Computing Machinery2016

Towards biomimetic behavior of an active deployable tensegrity structure

Nicolas Willy Veuve

Tensegrity structures have non-conventional structural properties since they require self-stress in order to be stable. When a tensegrity structure integrates sensors, actuators, (structural members able to change their length) and a control system, deploy ...

EPFL2016

The IceProd framework: Distributed data processing for the IceCube neutrino observatory

Matthias Wolf, Shirit Cohen, Sofia Vallecorsa, Mark Tobin, Mathieu Ribordy, Xiaoxia Bai

IceCube is a one-gigaton instrument located at the geographic South Pole, designed to detect cosmic neutrinos, identify the particle nature of dark matter, and study high-energy neutrinos themselves. Simulation of the IceCube detector and processing of dat ...

Academic Press Inc Elsevier Science2015

RCMP: Enabling Efficient Recomputation Based Failure Resilience for Big Data Analytics

Florin Dinu

Data replication, the main failure resilience strategy used for big data analytics jobs, can be unnecessarily inefficient. It can cause serious performance degradation when applied to intermediate job outputs in multi-job computations. For instance, for I/ ...

2014

Toward development of a biomimetic tensegrity footbridge

Ian Smith, Nicolas Willy Veuve, Seif Dalil Safaei

Biomimetic structures interact with their environment, change their properties, learn and self-repair, thereby providing properties that are similar to living organisms. Interactions with the environment involve unique challenges in the field of computatio ...

International Center for Numerical Methods in Engineering (CIMNE)2014

Interactivity on the Grid: Limitations and Opportunities

Marco Meoni

Grid computing has the intrinsic disadvantages of a batch system: the undetermined delay between the time a job is submitted and the time it is completed. Our approach to this problem is iGrid, a framework that proposes to change the Grid from a batch syst ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Deployment of job priority mechanisms in the Italian Cloud of the ATLAS experiment

Alessandro Barchiesi, Simone Campana

An optimized use of the Grid computing resources in the ATLAS experiment requires the enforcement of a mechanism of job priorities and of resource sharing among the different activities inside the ATLAS VO. This mechanism has been implemented through the V ...

2010

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Jongho Shin, Byung Jun Joo

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while the ...

2009

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