<div class="csl-bib-body">
<div class="csl-entry">Träff, J. L. (2022). Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. In K. Agrawal & I.-T. A. Lee (Eds.), <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022)</i> (pp. 143–146). ACM. https://doi.org/10.1145/3490148.3538560</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/136183
-
dc.language.iso
en
-
dc.subject
all-to-all-broadcast
en
dc.subject
broadcast
en
dc.title
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.editoraffiliation
Washington University in St. Louis, United States of America (the)
-
dc.contributor.editoraffiliation
Washington University in St. Louis, United States of America (the)
-
dc.relation.isbn
978-1-4503-9146-7
-
dc.description.startpage
143
-
dc.description.endpage
146
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022)
-
tuw.relation.publisher
ACM
-
tuw.relation.publisherplace
New York, NY, United States
-
tuw.researchTopic.id
I2
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Computer Engineering and Software-Intensive Systems
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
90
-
tuw.researchTopic.value
10
-
tuw.publication.orgunit
E191-04 - Forschungsbereich Parallel Computing
-
tuw.publisher.doi
10.1145/3490148.3538560
-
dc.description.numberOfPages
4
-
tuw.author.orcid
0000-0002-4864-9226
-
tuw.editor.orcid
0000-0001-5882-6647
-
tuw.event.name
34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022)
