• Home
  • Search
  • Memory minimization for tensor contractions using integer linear programming
  • Cite Icon8
  • https://doi.org/10.1109/ipdps.2006.1639717Copy DOI Icon

Memory minimization for tensor contractions using integer linear programming

  • Jan 1, 2006
  • A Allam +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and configuration interaction methods in quantum chemistry. In this class of computations, loop computations perform a multi-dimensional sum of product of input arrays. There are many different ways to get the same final results that differ in the required number of arithmetic operations required. In addition, for a given number of arithmetic operations, different expressions of the loop have different memory requirements. Loop fusion is a plausible solution for reducing memory usage. By fusing loops between producer loop nest and consumer loop nest, the required storage of intermediate array is reduced by the range of the fused loop. Because resultant loops have to be legal after fusion, some loops can not be fused at the same time. In this paper, we have developed a novel integer linear programming (ILP) formulation that is shown to be highly effective on a number of test cases producing the optimal solutions using very small execution times. The main idea in the ILP formulation is the encoding of legality rules for loop fusion of a special class of loops using logical constraints over binary decision variables and a highly effective approximation of memory usage

Similar Papers
  • Research Article
  • Citations2

Guaranteed Protection in Survivable WDM Mesh Networks – New ILP Formulations for Link Protection and Path Protection

  • Dec 30, 2011
  • Journal of Telecommunications and Information Technology
  • Baibaswata Mohapatra +2
  • Conference Article
  • Citations9

Reducing the complexity of ILP formulations for synthesis

  • Nov 22, 2002
  • A Mignotte +1
  • Conference Article

A Polynomial Time Routing Algorithm for Meda Biochips Based on Dijkstra's Algorithm

  • Jan 03, 2026
  • Issei Nakamura +3
  • Conference Article
  • Citations1

Scheduling using mixed arithmetic: an ILP formulation

  • Jan 01, 1997
  • A Mignotte +1
  • Research Article
  • Citations9

Multicast wavelength assignment with sparse wavelength converters to maximize the network capacity using ILP formulation in WDM mesh networks

  • Sep 09, 2006
  • Photonic Network Communications
  • I‐Shyan Hwang +2
  • Conference Article
  • Citations4

Mocarabe: High-Performance Time-Multiplexed Overlays for FPGAs

  • May 01, 2021
  • Frederick Tombs +2
  • Research Article

On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics

  • Oct 08, 2019
  • RAIRO - Operations Research
  • Daniel Morais Dos Reis +3
  • Conference Article
  • Citations3

ILP-based Synthesis for Sample Preparation Applications on Digital Microfluidic Biochips

  • Jan 01, 2016
  • Abhimanyu Yadav +3
  • Research Article
  • Citations1

The Prize-collecting Scheduling Problem with Deadlines

  • Nov 01, 2016
  • Electronic Notes in Discrete Mathematics
  • Pierre Hosteins +2
  • Research Article
  • Citations2

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments

  • Jun 03, 2021
  • INFORMS Journal on Computing
  • Matthias Bentert +4
  • Conference Article
  • Citations43

Multicast traffic grooming in WDM networks

  • Oct 03, 2003
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Ahmed E Kamal +1
  • Research Article
  • Citations46

A Two-Stage Integer Linear Programming-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic Biochips

  • Feb 01, 2011
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Tsung-Wei Huang +1
  • Supplementary Content

Acknowledgment to referees

  • Dec 01, 1981
  • European Journal of Operational Research
  • Research Article
  • Citations6

ILP-based Substrate Routing with Mismatched Via Dimension Consideration for Wire-bonding FBGA Package Design

  • Sep 08, 2023
  • ACM Transactions on Design Automation of Electronic Systems
  • Jun-Sheng Wu +2
  • PDF
  • Research Article
  • Citations4

Concise integer linear programming formulation for clique partitioning problems

  • Apr 01, 2022
  • Constraints
  • Miyuki Koshimura +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.