Finding shuffle words that represent optimal scheduling of shared memory access

DOI10.1080/00207160.2012.698007zbMath1286.68242OpenAlexW2010930012MaRDI QIDQ2855755

Daniel Reidenbach, Markus L. Schmid

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

zbMATH Keywords

shufflestring algorithmsmemory access scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
• The Complexity of Some Problems on Subsequences and Supersequences
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Index Register Allocation

This page was built for publication: Finding shuffle words that represent optimal scheduling of shared memory access