Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Processor mapping"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gou, Changjiang, Al Zoobi, Ali, Benoit, Anne, Faverge, Mathieu, Marchal, Loris, Pichon, Grégoire, Ramet, Pierre
Publikováno v:
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
In order to express parallelism, parallel sparse direct solvers take advantage of the elimination tree to exhibit tree-shaped task graphs, where nodes represent computational tasks and edges represent data dependencies. One of the pre-processing stag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::84d2600c7a50648cd9e61b117ea6aae0
https://inria.hal.science/hal-02973315/file/paper.pdf
https://inria.hal.science/hal-02973315/file/paper.pdf
Publikováno v:
The Journal of Supercomputing. 18:115-139
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper presents an architecture-independent software tool for contention-free mapping of arbitrary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d9739af05244ddb4b653691113f9478
https://doi.org/10.1023/a:1008171232465
https://doi.org/10.1023/a:1008171232465
Publikováno v:
Concurrency: Practice and Experience. 11:155-165
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a178de0632fcf6609cc529e0d4909351
https://doi.org/10.1002/(sici)1096-9128(199903)11:3<155::aid-cpe424>3.0.co
https://doi.org/10.1002/(sici)1096-9128(199903)11:3<155::aid-cpe424>3.0.co
Autor:
Lionel M. Ni, E. T. Kalns
Publikováno v:
IPPS
Run-time data redistribution can enhance algorithm performance in distributed-memory machines. Explicit redistribution of data can be performed between algorithm phases when a different data decomposition is expected to deliver increased performance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::553196f1f427a7d31beccecfa36c5710
https://doi.org/10.1109/71.476166
https://doi.org/10.1109/71.476166
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SBAC-PAD
Bioinformatics is among the most active research areas in computer science. In this study, we investigate a suite of workloads in bioinformatics on two multiprocessor systems with different configurations, and examine the effects of the configuration
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::642f3f45cc5172e3a7f7a74558c897a0
https://doi.org/10.1109/sbac-pad.2007.30
https://doi.org/10.1109/sbac-pad.2007.30
Publikováno v:
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc303ff372f923f2a8bea167e425e563
https://doi.org/10.1109/ipdps.2006.1639547
https://doi.org/10.1109/ipdps.2006.1639547
Publikováno v:
Performance Analysis and Grid Computing ISBN: 9781461350385
In this work we present a performance model that encompasses the key characteristics of a Sn transport application using unstructured meshes. Sn transport is an important part of the ASCI workload. This builds on previous analysis which has been done
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4942a2e2b82e9d79a2a436fc45ed5e4a
https://doi.org/10.1007/978-1-4615-0361-3_2
https://doi.org/10.1007/978-1-4615-0361-3_2
Publikováno v:
Parallel and Distributed Processing and Applications ISBN: 9783540241287
ISPA
ISPA
In this paper, we present an OptimalProcessor Mapping (OPM) scheme to minimize data transmission cost for general BLOCK-CYCLIC data realignment. We examine a size oriented greedy matching method and the maximum bipartite matching theory to explore lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6983995708d8decc4a0fc133f191dce5
https://doi.org/10.1007/978-3-540-30566-8_33
https://doi.org/10.1007/978-3-540-30566-8_33