Showing cs.DCShow all
3 papers · 1 filter
cs.DC2020
Balanced Partitioning of Several Cache-Oblivious Algorithms
Yuan Tang, Weiguo Gao
Frigo et al. proposed an ideal cache model and a recursive technique to design sequential cache-efficient algorithms in a cache-oblivious fashion. Ballard et al. pointed out that i…
cs.DC2019
Improving the Space-Time Efficiency of Processor-Oblivious Matrix Multiplication Algorithms
Yuan Tang
Classic cache-oblivious parallel matrix multiplication algorithms achieve optimality either in time or space, but not both, which promotes lots of research on the best possible bal…
cs.DC2016
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
David Dinh, Harsha Vardhan Simhadri, Yuan Tang
The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "" (parallel) and "" (serial)…