Skip to main content
SpringerLink
Log in

Solving Graph Partitioning Problems Arising in Tagless Cache Management

  • Conference paper
  • First Online:
Book cover Combinatorial Optimization (ISCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Included in the following conference series:

Abstract

The instruction cache is a critical component in any microprocessor. It must have high performance to enable fetching of instructions on every cycle. In this paper, we consider an optimization problem arising in the management of a new hybrid hardware and linker-assisted approach for cache memory management. A graph partitioning formulation is presented and different ILP formulations are proposed, obtained by strengthening and/or relaxing constraints and by reducing the number of integer variables. The formulations are tested on large benchmarks (with thousands of nodes and edges) arising from real applications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alfieri, A., Nicosia, G., Pacifici, A.: Exact algorithms for a discrete metric labeling problem. Discrete Optim. 3(3), 181–194 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integr. VLSI J. 19, 1–81 (1995)

    Article  MATH  Google Scholar 

  3. Grotschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1), 59–96 (1989)

    Article  MathSciNet  Google Scholar 

  4. Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74(3), 247–266 (1996)

    Article  MATH  Google Scholar 

  5. Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Prog. Series B 81, 229–256 (1998)

    MATH  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman and co., New York (1979)

    MATH  Google Scholar 

  7. Holm, S., Sorensen, M.M.: The optimal graph partitioning problem. OR Spectrum 15(1), 1–8 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jones, T.M., Bartolini, S., Maebe, J., Chanet, D.: Link-time optimization for power efficiency in a tagless instruction cache. In: 2011 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp. 32–41 (2011)

    Google Scholar 

  9. Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22, 1–12 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nossack, J., Pesch, E.: A branch-and-bound algorithm for the acyclic problem. Comput. OR 41, 174–184 (2014)

    Article  MathSciNet  Google Scholar 

  11. Wulf, W.A., McKee, S.A.: Hitting the memory wall: Implications of the obvious. SIGARCH Comput. Archit. News 23(1), 20–24 (1995)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Tim M. Jones and Jonas Maebe for the discussion about the tagless cache operation and for the preparation of the input data used in this work. This work was partially supported by IT FIRB PHOTONICA project (RBFR08LE6V).

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Informazione Scienze Matematiche, University of Siena, Siena, Italy

    Sandro Bartolini, Iacopo Casini & Paolo Detti

Authors
  1. Sandro Bartolini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iacopo Casini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Detti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paolo Detti .

Editor information

Editors and Affiliations

  1. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bartolini, S., Casini, I., Detti, P. (2014). Solving Graph Partitioning Problems Arising in Tagless Cache Management. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation