Fetching the paper…
Reading the bibliography…
In VLSI physical design, many algorithms require the solution of difficult combinatorial optimization problems such as max/min-cut, max-flow problems etc.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics
1953
Earlier work this paper cites.
F. Barahona, “On the computational complexity of ising spin glass models,” Journal of Physics A: Mathematical and General
1982
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science
1983
Earlier work this paper cites.
F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research
1988
Earlier work this paper cites.
F. Barahona, “On via minimization,” IEEE Transactions on Circuits and Systems
1990
Earlier work this paper cites.
Taylor & Francis, 1993
J. A. Mydosh, Spin Glasses: An Experimental Introduction · 1993
Earlier work this paper cites.
Dover Publications, 1998
C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity · 1998
Earlier work this paper cites.
J.-D. Cho, S. Raje, and M. Sarrafzadeh, “Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for vlsi applications,” IEEE Transactions on Computers
1998
Earlier work this paper cites.
Oxford University Press, 2001
N. Nishimori, Statistical Physics of Spin Glasses and Information Processing: AN Introduction · 2001
Earlier work this paper cites.
N. Harrison, “A simple via duplication tool for yield enhancement,” in Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
2001
Earlier work this paper cites.
2001
Earlier work this paper cites.
http://web.stanford.edu/ yyye/yyye/Gset/
“G-set,” 2003 · 2003
Cited alongside, same era.
New York, NY, USA: Cambridge University Press, 2005
D. Landau and K. Binder, A Guide to Monte Carlo Simulations in Statistical Physics · 2005
Cited alongside, same era.
E. Boros, P. L. Hammer, and G. Tavares, “Local search heuristics for quadratic unconstrained binary optimization (qubo),” Journal of Heuristics
2007
Cited alongside, same era.
B. Block, P. Virnau, and T. Preis, “Multi-gpu accelerated multi-spin monte carlo simulations of the 2d ising mode,” Computer Physics Communications
2010
Cited alongside, same era.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. H. an K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, J. W. S. Uchaikin, B. Wilson, and G. Rose, “Quantum annealing with manufactured spins,” Nature
J. Cai, W. G. Macread, and A. Roy, “A practical heuristic for finding graph minors,” 2014
2014
Later among the works it cites.
http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer
IBM, “Ilog cplex optimizer,” 2015 · 2015
Later among the works it cites.
V. S. Denchev, S. Boixo, S. V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven, “What is the computational value of finite-range tunneling?,” Phys. Rev. X
2016
Later among the works it cites.
M. Yamaoka, C. Yoshimura, M. Hayashi, T. Okuyama, H. Aoki, and H. Mizuno, “A 20k-spin ising chip to solve combinatorial optimization problems with cmos annealing,” IEEE Journal of Solid-State Circuits
2016
Later among the works it cites.
C. Yoshimura, M. Hayashi, T. Okuyama, and M. Yamaoka, “Implementation and evaluation of fpga-based annealing processor for ising model by use of resource sharing,” Internation Journal of Networking and Computing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
http://www.nvidia.com/object/cuda_home.html
NVIDIA Corporation, “CUDA (Compute Unified Device Architecture),” 2011 · 2011
Cited alongside, same era.
M. Weigel, “Performance potential for simulating spin models on gpu,” Journal of Computational Physics
2012
Cited alongside, same era.
A. Lucas, “Ising formulations of many np problems,” Frontiers in Physics
2014
Cited alongside, same era.
S. Boixo, F. F. Ronnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, “Evidence for quantum annealing with more than one hundred quibits,” Nature Physics
2014
Cited alongside, same era.
White Paper
NVIDIA Corporation., “NVIDIA’s next generation CUDA compute architecture: Kepler gk110/210,” 2014 · 2014
Cited alongside, same era.
2017
Later among the works it cites.
L. Y. Barash, M. Weigel, M. Borovský, W. Janke, and L. N. Shchur, “Gpu accelerated population annealing algorithm,” Computer Physics Communications
2017
Later among the works it cites.
http://www.dwavesys.com
“D-Wave Computer,” 2018 · 2018
Closest in time.
H. Gyoten, M. Hiromoto, and T. Sato, “Area efficient annealing processor for ising model without random number generator,” IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science(IEICE)
2018
Closest in time.
H. GYOTEN, M. HIROMOTO, and T. SATO, “Enhancing the solution quality of hardware ising-model solver via parallel tempering,” in Proc. Int. Conf. on Computer Aided Design (ICCAD)
2018
Closest in time.
NVIDIA, “CUDA C programming guide.” docs.nvidia.com/cuda/cuda_c_programming_guide/index.html
2018
Closest in time.