Upper bounds on number of steals in rooted trees

DOI10.1007/s00224-015-9613-9zbMath1336.68278arXiv1706.03184OpenAlexW2043762736MaRDI QIDQ255260

Tao B. Schardl, Warut Suksompong, Charles E. Leiserson

Publication date: 9 March 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.03184

zbMATH Keywords

parallel algorithmextremal combinatoricsbinomial coefficientwork stealing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

On the efficiency of localized work stealing ⋮ Arithmetic for rooted trees

Cites Work

• Unnamed Item
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Scheduling multithreaded computations by work stealing
• On some techniques useful for solution of transportation network problems
• Thread scheduling for multiprogrammed multiprocessors

This page was built for publication: Upper bounds on number of steals in rooted trees