Topology-aware task-assIGnment mappER (TIGER) v0.1
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
The general topology-aware task assignment problem is an NP-complete graph isomorphism problem. Existing task scheduling approaches are either heuristic or based on physical optimization algorithms, providing different speed and solution quality trade-offs. Physical Ising machines such as quantum and digital annealers have recently become available offering an alternative hardware solution to solve certain types of optimization problems. We propose an algorithm that allows expressing the problem in the compatible format. We present a domain specific partition strategy that enables to execute larger scale problems. TIGER - topology-aware task assignment mapper tool - implements the proposed algorithm and automatically integrates task- communication graph and an architecture graph into the quantum software environment.
- Short Name / Acronym:
- TIGER v0.1
- Project Type:
- Open Source, Publicly Available Repository
- Site Accession Number:
- 2019-071
- Software Type:
- Scientific
- License(s):
- BSD 3-clause "New" or "Revised" License
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOEPrimary Award/Contract Number:AC02-05CH11231
- DOE Contract Number:
- AC02-05CH11231
- Code ID:
- 27148
- OSTI ID:
- 1530854
- Country of Origin:
- United States
Similar Records
Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments
Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)