Scheduling on the Grid : Historical Trace and Dynamic Heuristics
Identifieur interne : 001220 ( Crin/Checkpoint ); précédent : 001219; suivant : 001221Scheduling on the Grid : Historical Trace and Dynamic Heuristics
Auteurs : Yves Caniou ; Emmanuel JeannotSource :
English descriptors
- KwdEn :
Abstract
We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common acknowledgment of the characteristics of the tasks submitted to the agent, but also on the construction of the underlying historical trace of the different tasks submitted to each server. We study each heuristic and compare them on several metrics to an instantiation of MCT (Minimum Completion time), chosen as reference heuristic. The simulation experiments we have conducted show that they are likely to give good results when tested in a real environment.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:caniou02bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="244">Scheduling on the Grid : Historical Trace and Dynamic Heuristics</title></titleStmt><publicationStmt><idno type="RBID">CRIN:caniou02b</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003706</idno><idno type="wicri:Area/Crin/Curation">003706</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003706</idno><idno type="wicri:Area/Crin/Checkpoint">001220</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001220</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Scheduling on the Grid : Historical Trace and Dynamic Heuristics</title><author><name sortKey="Caniou, Yves" sort="Caniou, Yves" uniqKey="Caniou Y" first="Yves" last="Caniou">Yves Caniou</name></author><author><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>dynamic scheduling heuristics</term><term>historical trace manager</term><term>mct</term><term>netsolve</term><term>time-shared resources</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1767">We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common acknowledgment of the characteristics of the tasks submitted to the agent, but also on the construction of the underlying historical trace of the different tasks submitted to each server. We study each heuristic and compare them on several metrics to an instantiation of MCT (Minimum Completion time), chosen as reference heuristic. The simulation experiments we have conducted show that they are likely to give good results when tested in a real environment.</div></front></TEI><BibTex type="techreport"><ref>caniou02b</ref><crinnumber>A02-R-551</crinnumber><category>15</category><equipe>RESEDAS</equipe><author><e>Caniou, Yves</e><e>Jeannot, Emmanuel</e></author><title>Scheduling on the Grid : Historical Trace and Dynamic Heuristics</title><year>2002</year><type>Rapport de recherche</type><month>Nov</month><keywords><e>time-shared resources</e><e>dynamic scheduling heuristics</e><e>historical trace manager</e><e>mct</e><e>netsolve</e></keywords><abstract>We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common acknowledgment of the characteristics of the tasks submitted to the agent, but also on the construction of the underlying historical trace of the different tasks submitted to each server. We study each heuristic and compare them on several metrics to an instantiation of MCT (Minimum Completion time), chosen as reference heuristic. The simulation experiments we have conducted show that they are likely to give good results when tested in a real environment.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001220 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 001220 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:caniou02b
|texte= Scheduling on the Grid : Historical Trace and Dynamic Heuristics
}}
| This area was generated with Dilib version V0.6.33. |  |