Finding shuffle words that represent optimal scheduling of shared memory access
From MaRDI portal
Publication:2855755
DOI10.1080/00207160.2012.698007zbMath1286.68242MaRDI QIDQ2855755
Markus L. Schmid, Daniel Reidenbach
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/8421
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
68Q42: Grammars and rewriting systems