, our
algorithm results in an execution on @math processors that requires
@math~~ units of memory, and
@math time, including scheduling overheads.
Finally, we demonstrate that our schedulin
algorithm is efficient in practice. We have implemented a runtime system
that uses our algorithm to schedule parallel
threads. The results of executing parallel programs on this system show that
our scheduling algorithm significantly reduces memory usage compared to
previous techniques, without compromising performance.
@blankspace(2line)
@begin(transparent,size=10)
@b(Keywords:@ )@c
@end(transparent)
@blankspace(1line)
@end(text)
@flushright(@b[(34 pages)])
~~