Finding shuffle words that represent optimal scheduling of shared memory access

Authors:
Daniel Reidenbach;Markus L. Schmid
Affiliations:
Department of Computer Science, Loughborough University, Leicestershire, UK;Department of Computer Science, Loughborough University, Leicestershire, UK
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 4
Cited 1

Birthday paradox, coupon collectors, caching algorithms and self-organizing search

Discrete Applied Mathematics
Index Register Allocation

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
The geoviz toolkit: using component-oriented coordination methods for geographic visualization and analysis

International Journal of Geographical Information Science

Patterns with bounded treewidth

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present paper, we introduce and study the problem of computing, for any given finite set of words, a shuffle word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of different symbols that parenthesise any position in the shuffle word. This problem is motivated by an application of a new automaton model and can be regarded as the problem of scheduling shared memory accesses of some parallel processes in a way that minimises the number of memory cells required. We investigate the complexity of this problem and show that it can be solved in polynomial time.