citefile6-EN.bib
@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -oc citefile6-EN -ob citefile6-EN.bib -s year -r -c "$type= 'TECHREPORT'" -q biblio-EN.bib}}
@techreport{RR-arxiv,
author = {Nof Abuzainab and Sai Rakshit Vinnakota and Corinne Touati},
title = {Coalition Formation Game for Cooperative Cognitive Radio Using Gibbs Sampling},
institution = {arXiv},
year = 2014,
type = {Research Report},
number = {1409.4331},
month = sep,
url = {http://arxiv.org/abs/1409.4331}
}
@techreport{bertin:inria-00627532,
hal_id = {inria-00627532},
url = {http://hal.inria.fr/inria-00627532},
title = {{From Flow Control in Multi-path Networks to Multiple Bag-of-tasks Application Scheduling on Grids}},
author = {Bertin, R{\'e}mi and Hunold, Sascha and Legrand, Arnaud and Touati, Corinne},
abstract = {{A very large number of applications that are currently deployed on large scale distributed systems such as grids or volunteer computing systems are Bag-of-Tasks (BoT) applications. Up until now, simple mechanisms have been used to ensure a fair sharing of resources amongst these applications. Although these mechanisms have proved efficient for CPU-bound applications, they are known to be ineffective in the presence of network-bound applications. In this article, we propose a fully distributed algorithm for fairly scheduling BoT applications on a computing grid while respecting resource constraints. This algorithm is inspired by techniques used in flow control mechanisms in multi-path networks. Yet, we prove that the context of BoT scheduling is significantly more difficult in practice and that a set of non-trivial adaptations are required to ensure convergence. We prove their effectiveness through an extensive set of simulations that enables to deeply understand the potential benefits as well as the limitations of this technique in the context of grid computing.}},
keywords = {Lagrangian optimization, steady-state scheduling, distributed scheduling, grid computing},
language = {English},
affiliation = {Laboratoire d'Informatique de Grenoble - LIG , MESCAL - INRIA Grenoble Rh{\^o}ne-Alpes / LIG laboratoire d'Informatique de Grenoble},
pages = {26},
type = {Research Report},
institution = {INRIA},
number = {RR-7745},
year = {2011},
month = sep,
pdf = {http://hal.inria.fr/inria-00627532/PDF/RR-7745.pdf}
}
@techreport{RR-INRIA-6653,
author = {Coucheney, Pierre and Touati, Corinne and Gaujal, Bruno},
title = {A Distributed Algorithm for Fair and Efficient User-Network Association in Multi-Technology Wireless Networks},
institution = {INRIA},
year = 2008,
type = {Research Report},
number = 6653,
month = sep,
url = {https://hal.inria.fr/inria-00322403}
}
@techreport{RR-INRIA-6537,
author = {Bertin, Rémi and Legrand, Arnaud and Touati, Corinne},
title = {Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids},
year = {2008},
month = may,
institution = {INRIA},
number = {6537},
type = {Research Report},
url = {https://hal.inria.fr/inria-00279993}
}
@techreport{RR-INRIA-6216,
author = {Legrand, Arnaud and Touati, Corinne},
title = {How to measure efficiency?},
institution = {INRIA},
year = 2007,
type = {Research Report},
number = 6216,
month = jun,
url = {https://hal.inria.fr/inria-00153720}
}
@techreport{LT_RR_06,
author = {Legrand, Arnaud and Touati, Corinne},
title = {Non-Cooperative Scheduling of Multiple Bag-of-Task
Applications},
institution = {INRIA},
year = 2006,
number = 5819,
month = jan,
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5819.pdf},
abstract = {Multiple applications that execute concurrently on
heterogeneous platforms compete for CPU and network
resources. In this paper we analyze the behavior of K
non-cooperative schedulers using the optimal strategy that
maximize their efficiency. Meanwhile fairness is ensured at
a system level ignoring applications characteristics. We
limit our study to simple single-level master-worker
platforms and the case where applications consist of a
large number of independent tasks. The tasks of a given
application all have the same computation and communication
requirements, but these requirements can vary from one
application to another. Therefore, each scheduler aims at
maximizing its throughput. We give closed-form formula of
the equilibrium reached by such a system and study its
performances. We characterize the situations where this
Nash equilibrium is Pareto-optimal and show that even
though no catastrophic situation (Braess-like paradox) can
occur, such an equilibrium can be arbitrarily bad for any
classical performance measure.},
resume = {Lorsque plusieurs applications s'exécutent
simultanément sur une plate-forme de calcul
hétérogène, elles entrent en compétition
pour l'accès aux ressources de calcul et de
communication. Dans ce rapport, nous analysons le
comportement de K ordonnanceurs ne coopérant pas et
utilisant la stratégie qui optimise leur performance.
L'équité d'accès aux ressources est donc
assurée au niveau du système sans tenir compte des
spécificités des différentes applications. Nous
limitons notre étude aux simples plates-formes
maître-esclave arborescentes à un seul niveau et
au cas où chaque application est constituée d'un
très grand nombre de tâches indépendantes. Les
tâches d'une même application ont toutes les
mêmes besoins en terme de calcul et de communications
mais ces besoins peuvent varier d'une application à
l'autre. Dans un tel contexte, il est naturel que chaque
application cherche à optimiser son propre débit.
Nous donnons des formes closes de l'équilibre atteint
par un tel système et nous étudions ses
performances. Nous caractérisons les situations où
cet équilibre de Nash est Pareto-optimal et montre que
même si aucune situation catastrophique de type
paradoxe de Braess ne peut se produire, cet équilibre
est arbitrairement mauvais pour toutes les mesures de performances classiques.},
keywords = {Nash equilibria, scheduling, bag-of-tasks applications, Braess paradox}
}
@techreport{TKI_RR_05,
author = {Touati, Corinne and Kameda, Hisao and Inoie, Atsushi},
title = {Fairness in non-convex systems},
institution = {\iflanguage{francais}{Université de Tsukuba}{University of Tsukuba}},
year = 2005,
month = sep,
number = {CS-TR-05-4},
pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/CSTR054.pdf},
keywords = {fairness, non-convex optimization}
}
@techreport{AAGLT_RR_04,
author = {Alouf, Sara and Altman, Eitan and Galtier, Jérôme
and Lalande, Jean-François and Touati, Corinne},
title = {Un algorithme d'allocation de bande passante
satellitaire},
institution = {INRIA},
year = 2004,
month = apr,
number = {RR-5172},
pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/RR-5172.pdf},
ps = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/RR-5172.ps},
keywords = {combinatorial optimization, satellite networks, {MFTDMA} systems, linear programming}
}
@techreport{TAG_RR_02,
author = {Touati, Corinne and Altman, Eitan and Galtier,
Jérôme},
title = {Fair Bandwidth allocation between service providers in a
geostationary satellite network},
institution = {INRIA},
year = 2002,
month = mar,
number = {RR-4421},
pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/RR-4421- MFTDMA.pdf},
keywords = {fairness, satellite networks, resource allocation, combinatorial optimization}
}
@techreport{TAG_RR_01,
author = {Touati, Corinne and Altman, Eitan and Galtier,
Jérôme},
title = {On fairness in bandwidth allocation},
institution = {INRIA},
year = 2001,
month = sep,
number = {RR-4269},
pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/RR-4269 - fairness .pdf},
keywords = {fairness, generalized Nash Bargaining Solution}
}