Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access

Daniel Reidenbach, Markus L. Schmid. Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. In Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide, editors, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings. Volume 6638 of Lecture Notes in Computer Science, pages 465-476, Springer, 2011. [doi]

Abstract

Abstract is missing.