Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Tchiboukdjian, Marc"'
Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized
Externí odkaz:
http://arxiv.org/abs/1107.3734
Autor:
Tchiboukdjian, Marc1 marc.tchiboukdjian@imag.fr, Gast, Nicolas2 nicolas.gast@epfl.ch, Trystram, Denis3 denis.trystram@imag.fr
Publikováno v:
Annals of Operations Research. Aug2013, Vol. 207 Issue 1, p237-259. 23p. 2 Diagrams, 1 Chart, 3 Graphs.
Publikováno v:
International Conference on Supercomputing (ICS)
International Conference on Supercomputing (ICS), 2011, Tucson, Arizona, United States
International Conference on Supercomputing (ICS), 2011, Tucson, Arizona, United States
International audience; no abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6d8d07c7977ee32dcc0bcf930acb5f43
https://hal.inria.fr/hal-00796865
https://hal.inria.fr/hal-00796865
Publikováno v:
[Research Report] RR-7256, INRIA. 2010, pp.17
Reordering instructions and data layout can bring significant performance improvement for memory bounded applications. Parallelizing such applications requires a careful design of the algorithm in order to keep the locality of the sequential executio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::67dcb3e2a4e90e21a5c841167cc22066
https://hal.inria.fr/inria-00473617/file/RR-7256.pdf
https://hal.inria.fr/inria-00473617/file/RR-7256.pdf
Publikováno v:
[Research Report] RR-7208, INRIA. 2010, pp.20
Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors in new parallel platforms, the cost for man
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::842cd46538b8c287c6482366c234721d
https://inria.hal.science/inria-00458133
https://inria.hal.science/inria-00458133
Publikováno v:
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10)
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Norrköping, Sweden
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Norrköping, Sweden
International audience; no abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8709ed706055a004822f286c151e48da
https://inria.hal.science/hal-00798445
https://inria.hal.science/hal-00798445
Publikováno v:
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10)
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Unknown, Sweden
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Norrköping, Unknown Region
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Unknown, Sweden
Eurographics 2010 Symposium on Parallel Graphics and Visualization (EGPGV'10), 2010, Norrköping, Unknown Region
International audience; no abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8468604d4a5cb41aec6876c5af9ec132
https://hal.inria.fr/hal-00953437
https://hal.inria.fr/hal-00953437
Publikováno v:
EGPGV'10-Eurographics 2010 Symposium on Parallel Graphics and Visualization
EGPGV'10-Eurographics 2010 Symposium on Parallel Graphics and Visualization, 2010, Norrköping, Norway
EGPGV'10-Eurographics 2010 Symposium on Parallel Graphics and Visualization, 2010, Norrköping, Norway
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c3e842f912e6c2171ea76edaa4aae410
https://inria.hal.science/hal-00685934
https://inria.hal.science/hal-00685934
Publikováno v:
[Research Report] RR-7118, INRIA. 2009
One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cache-aware (CA) and cache-oblivious (CO) algorithms take into consideration the memory hierarchy to design cache efficient algorithms. CO ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7489992e62de61efe60383c3d17e1bd1
https://hal.inria.fr/inria-00436052/file/RR-7118.pdf
https://hal.inria.fr/inria-00436052/file/RR-7118.pdf
Publikováno v:
International Workshop on Super Visualization (IWSV'08)
International Workshop on Super Visualization (IWSV'08), Jun 2008, Kos, Greece
International Workshop on Super Visualization (IWSV'08), Jun 2008, Kos, Greece
International audience; One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cache-aware (CA) and cache-oblivious (CO) algorithms take into consideration the memory hierarchy to design cache eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c98328196389a31f0f146c5953e3fa89
https://hal.inria.fr/inria-00436053/document
https://hal.inria.fr/inria-00436053/document