Advertisement

Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access

  • Daniel Reidenbach
  • Markus L. Schmid
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6638)

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.

Keywords

String Algorithms Shuffle Memory Access Scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley Publishing Company, Reading (1967)zbMATHGoogle Scholar
  2. 2.
    Flajolet, P., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Applied Mathematics 39, 207–229 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Horwitz, L.P., Karp, R.M., Miller, R.E., Winograd, S.: Index register allocation. Journal of the ACM 13, 43–61 (1966)CrossRefzbMATHGoogle Scholar
  5. 5.
    Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM 25, 322–336 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Pereira, F.M.Q.: A survey on register allocation (2008), http://compilers.cs.ucla.edu/fernando/publications/drafts/survey.pdf
  7. 7.
    Reidenbach, D., Schmid, M.L.: A polynomial time match test for large classes of extended regular expressions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 241–250. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Daniel Reidenbach
    • 1
  • Markus L. Schmid
    • 1
  1. 1.Department of Computer ScienceLoughborough UniversityLoughboroughUK

Personalised recommendations