Record link: 
http://hdl.handle.net/20.500.12708/136183
-
Title: 
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules
en
Citation: 
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.), Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022) (pp. 143–146). ACM. https://doi.org/10.1145/3490148.3538560
-
Publisher DOI: 
10.1145/3490148.3538560
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Träff, Jesper Larsson 
-
Organisational Unit: 
E191-04 - Forschungsbereich Parallel Computing 
-
Published in: 
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022) 
-
ISBN: 
978-1-4503-9146-7
-
Date (published): 
11-Jul-2022
-
Event name: 
34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022) 
en
Event date: 
11-Jul-2022 - 14-Jul-2022
-
Event place: 
Philadelphia, PA, United States of America (the)
-
Number of Pages: 
4
-
Publisher: 
ACM, New York, NY, United States
-
Keywords: 
all-to-all-broadcast; broadcast
en
Research Areas: 
Computer Engineering and Software-Intensive Systems: 90%
Computer Science Foundations: 10%
-
Science Branch: 
1020 - Informatik: 100%
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

148
checked on Nov 21, 2023

Download(s)

17
checked on Nov 21, 2023

Google ScholarTM

Check