Lamiel Toch

École Normale Supérieure de Lyon, LIP, Post-Doc

Followers

Following

Public Views

Hello

less

Interests

Uploads

Papers by Lamiel Toch

Contributions to scheduling techniques on parallel or distributed platforms

Les travaux présentés dans ce document portent sur l'ordonnancement d'applications parallèles sur... more Les travaux présentés dans ce document portent sur l'ordonnancement d'applications parallèles sur des plates-formes parallèles (cluster) ou distribuées (grilles de calcul). Dans nos travaux de recherche nous nous sommes concentrés sur l'ordonnancement d'applications modélisées par un DAG, graphe orienté sans cycle, pour les grilles de calcul et sur l'ordonnancement pour les (cluster, machines multiprocesseurs) de programmes parallèles (jobs parallèles) représentés sous la forme de surface rectangulaire dont les deux dimensions sont le nombre de processeurs requis et la durée d'exécution. Les recherches s'articulent autour de trois grands axes. Le premier axe concerne l'ordonnancement d'un ensemble d'instances d'une application pour les grilles de calcul. Le deuxième axe est l'ordonnancement de jobs parallèles dans les clusters. Le troisième est l'ordonnancement d'un lot de jobs parallèles pour les machines parallèles. Cette thèse apporte des contributions sur les trois axes. La première contribution associée au premier axe est l'étude expérimentale avancée de trois algorithmes pour l'ordonnancement d'un ensemble d'instances d'une application sur une plate-forme hétérogène où les coûts de communication sont négligeables : un algorithme de liste, un algorithme de régime permanent et un algorithme génétique. D'autre part nous apportons l'intégration des communications dans cet algorithme génétique. La deuxième contribution associée au deuxième axe est la conception d'une nouvelle technique d'ordonnancement de jobs parallèles pour les clusters : le pliage de jobs qui utilise la virtualisation des processeurs. La dernière contribution porte sur la conception d'une nouvelle technique inspirée du domaine des statistiques et du traitement du signal appliquée à l'ordonnancement de jobs parallèles dans une machine multiprocesseur. Enn nous donnons quelques travaux de recherches qui on été réalisés mais qui n'ont pas abouti à des résultats signicatifs pour l'ordonnancement. Mots clés : Ordonnancement, graphes de tâches, job parallèle, lots de graphes de tâches, grilles de calcul, cluster, machine multiprocesseur.

Download

A Genetic Algorithm with Communication Costs to Schedule Workflows on a SOA-Grid

Lecture Notes in Computer Science, 2012

ABSTRACT In this paper we study the problem of scheduling a collection of workflows, identical or... more ABSTRACT In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA (Service Oriented Architecture) grid . A workflow (job) is represented by a directed acyclic graph (DAG) with typed tasks. All of the grid hosts are able to process a set of typed tasks with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal of our study is to minimize the maximum completion time (makespan) of the workflows. To solve this problem we propose a genetic approach. The contributions of this paper are both the design of a Genetic Algorithm taking the communication costs into account and its performance analysis.

Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model

Lecture Notes in Computer Science, 2012

Download

Seeding the Cloud: An Innovative Approach to Grow Trust in Cloud Based Infrastructures

Lecture Notes in Computer Science, 2013

Complying with security and privacy requirements of appliances such as mobile handsets, personal ... more Complying with security and privacy requirements of appliances such as mobile handsets, personal computers, servers for customers, enterprises and governments is mandatory to prevent from theft of sensitive data and to preserve their integrity. Nowadays, with the rising of the Cloud Computing approach in business fields, security and privacy are even more critical. The aim of this article is then to propose a way to build a secure and trustable Cloud. The idea is to spread and embed Secure Elements (SE) on each level of the Cloud in order to make a wide trusted infrastructure which complies with access control and isolation policies. This article presents therefore this new approach of trusted Cloud infrastructure based on a Network of Secure Elements (NoSE), and it illustrates this approach through different use cases.

Download

Comparaison de performance entre OpenStack et OpenNebula et les architectures multi-Cloud : Application à la cosmologie

With the increasing numbers of Cloud Service Providers and the migration of the Grids to the Clou... more With the increasing numbers of Cloud Service Providers and the migration of the Grids to the Cloud paradigm, it is necessary to be able to leverage these new resources. Moreover, a large class of High Performance Computing (hpc) applications can run these resources without (or with minor) modifications. But using these resources come with the cost of being able to interact with these new resource providers. In this paper we introduce the design of a hpc middleware that is able to use resources coming from an environment that compose of multiple Clouds as well as classical hpc resources. Using the Diet middleware, we are able to deploy a large-scale, distributed hpc platform that spans across a large pool of resources aggregated from different providers. Furthermore, we hide to the end users the difficulty and complexity of selecting and using these new resources even when new Cloud Service Providers are added to the pool. Finally, we validate the architecture concept through cosmolo...

Download

A Genetic Algorithm to Schedule Workflow Collections on a SOA-Grid with Communication Costs

In this paper we study the problem of scheduling a collection of workflows, identical or not, on ... more In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA grid. A workflow (job) is represented by a directed acyclic graph (DAG) with typed tasks. All of the grid hosts are able to process a set of task types with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal is to minimize the maximum completion time (makespan) of the workflows. To solve this problem we propose a genetic approach. The contributions of this paper are both the design of a Genetic Algorithm taking the communication costs into account and the performance analysis. Key-words: Batch scheduling, grid computing, heterogeneous platform, genetic algorithm Laboratoire d’Informatique de l’Universite de Franche-Comte, UFR Sciences et Techniques, 16, route de Gray, 25030 Besancon Cedex (France) Telephone : +33 (0)3 81 66 64 55 — Telecopie : +33 (0)3 81 66 64 50 Algorithme Genetique ...

Download

Comparison on OpenStack and OpenNebula performance to improve multi-Cloud architecture on cosmological simulation use case

With the increasing numbers of Cloud Service Providers and the migration of the Grids to the Clou... more With the increasing numbers of Cloud Service Providers and the migration of the Grids to the Cloud paradigm, it is necessary to be able to leverage these new resources. Moreover, a large class of High Performance Computing (HPC) applications can run these resources without (or with minor) modifications. But using these resources come with the cost of being able to interact with these new resource providers. In this paper we introduce the design of a HPC middleware that is able to use resources coming from an environment that compose of multiple Clouds as well as classical \\hpc resources. Using the \\diet middleware, we are able to deploy a large-scale, distributed HPC platform that spans across a large pool of resources aggregated from different providers. Furthermore, we hide to the end users the difficulty and complexity of selecting and using these new resources even when new Cloud Service Providers are added to the pool. Finally, we validate the architecture concept through cosmo...

Using Virtualization and Job Folding for Batch Scheduling

In this paper we study the problem of batch scheduling within a homogeneous cluster. In this cont... more In this paper we study the problem of batch scheduling within a homogeneous cluster. In this context, the problem is that the more processors the job requires the more difficult it is to find an idle slot to run it on. As a consequence the resources are often inefficiently used as some of them remain unallocated in the final schedule. To address this issue we propose a technique called job folding that uses virtualization to reduce the number of processors allocated to a parallel job and thus allows to execute it earlier. Our goal is to optimize the resource use. In this paper we propose several heuristics based on job folding and we compare their performance with classical on-line scheduling algorithms as FCFS or backfilling. The contributions of the paper are both on the design of the job folding algorithms and on their performance analysis.

Download

Assessing new approaches to schedule a batch of identical intree-shaped workflows on a heterogeneous platform

International Journal of Parallel, Emergent and Distributed Systems, 2012

In this paper, we consider the makespan optimisation when scheduling a batch of identical workflo... more In this paper, we consider the makespan optimisation when scheduling a batch of identical workflows on a heterogeneous platform as a service-oriented grid or a micro-factory. A job is represented by a directed acyclic graph (DAG) with typed tasks and no fork nodes (in-tree precedence constraints). The processing resources are able to process a set of task types, each with

Assessing new approaches to schedule a batch of identical intree-shaped workflows on a heterogeneous platform

International Journal of Parallel, Emergent and Distributed Systems, 2011

Lamiel Toch

Uploads

Papers by Lamiel Toch

Log In