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/12757

Title: Finding shuffle words that represent optimal scheduling of shared memory access
Authors: Reidenbach, Daniel
Schmid, Markus L.
Issue Date: 2013
Publisher: © Taylor & Francis
Citation: REIDENBACH, D. and SCHMID, M.L., 2013. Finding shuffle words that represent optimal scheduling of shared memory access. International Journal of Computer Mathematics, 90 (6), pp.1292-1309.
Abstract: In the present paper, we introduce and study the problem of computing, for any given nite set of words, a shu e word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of di erent symbols that parenthesise any position in the shu e 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 an Author's Accepted Manuscript of an article published in International Journal of Computer Mathematics [© Taylor & Francis], available online at: http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.698007
Version: Accepted for publication
DOI: 10.1080/00207160.2012.698007
URI: https://dspace.lboro.ac.uk/2134/12757
Publisher Link: http://dx.doi.org/10.1080/00207160.2012.698007
ISSN: 0020-7160
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_IJCM_2011.pdfAccepted version389.86 kBUnknownView/Open


SFX Query

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