Finding shuffle words that represent optimal scheduling of shared memory access

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...

Full description

Bibliographic Details

Main Authors:	Daniel Reidenbach, Markus L. Schmid
Format:	Default Conference proceeding
Published:	2011
Subjects:	Other information and computing sciences not elsewhere classified String algorithms Shuffle Memory access scheduling Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/8421
Tags:	Add Tag No Tags, Be the first to tag this record!