( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On-the-Fly Pipeline Parallelism.

, , , , и . ACM Trans. Parallel Comput., 2 (3): 17:1-17:42 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Tao Tao

Luise Schardl

Barbara Schardl

Tao Huu Phung

Madelaine Taoubi

 

Другие публикации лиц с тем же именем

Upper Bounds on Number of Steals in Rooted Trees., , и . Theory Comput. Syst., 58 (2): 223-240 (2016)Efficient Access History for Race Detection., , , , , и . ALENEX, стр. 117-130. SIAM, (2022)TapirXLA: Embedding Fork-Join Parallelism into the XLA Compiler in TensorFlow Using Tapir., и . HPEC, стр. 1-8. IEEE, (2019)EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs., , , , , , , , и . AAAI, стр. 5363-5370. AAAI Press, (2020)Efficient Access History for Race Detection., , , , , и . SPAA, стр. 449-451. ACM, (2021)A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)., и . SPAA, стр. 303-314. ACM, (2010)Who Needs Crossings? Hardness of Plane Graph Rigidity., , , , , и . SoCG, том 51 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)OpenCilk: A Modular and Extensible Software Infrastructure for Fast Task-Parallel Code., и . PPoPP, стр. 189-203. ACM, (2023)Finding a Hamiltonian Path in a Cube with Specified Turns is Hard., , , , , и . Inf. Media Technol., 8 (3): 685-694 (2013)Ordering Heuristics for Parallel Graph Coloring., , , и . Massive Graph Analytics, Chapman and Hall/CRC, (2022)