Solving Graph Partitioning Problems Arising in Tagless Cache Management

DOI10.1007/978-3-319-09174-7_5zbMath1445.68147OpenAlexW150208496MaRDI QIDQ3195315

Paolo Detti, Iacopo Casini, Sandro Bartolini

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_5

zbMATH Keywords

integer programminggraph partitioningcache memory

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Reformulated acyclic partitioning for rail-rail containers transshipment

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for the acyclic partitioning problem
• A cutting plane algorithm for a clustering problem
• Cliques and clustering: A combinatorial approach
• The node capacitated graph partitioning problem: A computational study
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Recent directions in netlist partitioning: a survey
• Exact algorithms for a discrete metric labeling problem

This page was built for publication: Solving Graph Partitioning Problems Arising in Tagless Cache Management