Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/8421

Title: Finding shuffle words that represent optimal scheduling of shared memory access
Authors: Reidenbach, Daniel
Schmid, Markus L.
Keywords: String algorithms
Memory access scheduling
Issue Date: 2011
Publisher: © Springer-Verlag
Citation: REIDENBACH, D. and SCHMID, M.L., 2011. Finding shuffle words that represent optimal scheduling of shared memory access. IN: Dediu, A-H., Martín-Vide, C. and Inenaga, S. (eds.). Language and Automata Theory and Applications: Lecture Notes in Computer Science, Vol. 6638. 5th International Conference, LATA 2011, Tarragona, Spain, 26th-31st May.
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.
Description: This is a conference paper. It was published in the Lecture Notes of Computer Science series [© Springer-Verlag]. Details of the publication can be found at www.springerlink.com.
Version: Accepted for publication
URI: https://dspace.lboro.ac.uk/2134/8421
Publisher Link: http://grammars.grlmc.com/lata2011/Programme.php?FLASH=yes
ISBN: 9783642212536
ISSN: 0302-9743
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_LATA_2011.pdf348.28 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.