---
_id: '22309'
abstract:
- lang: eng
  text: Approximate computing (AC) has acquired significant maturity in recent years
    as a promising approach to obtain energy and area-efficient hardware. Automated
    approximate accelerator synthesis involves a great deal of complexity on the size
    of design space which exponentially grows with the number of possible approximations.
    Design space exploration of approximate accelerator synthesis is usually targeted
    via heuristic-based search methods. The majority of existing frameworks prune
    a large part of the design space using a greedy-based approach to keep the problem
    tractable. Therefore, they result in inferior solutions since many potential solutions
    are neglected in the pruning process without the possibility of backtracking of
    removed approximate instances. In this paper, we address the aforementioned issue
    by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based
    search algorithm, in the context of automated synthesis of approximate accelerators.
    This enables the synthesis frameworks to deeply subsamples the design space of
    approximate accelerator synthesis toward most promising approximate instances
    based on the required performance goals, i.e., power consumption, area, or/and
    delay. We investigated the challenges of providing an efficient open-source framework
    that benefits analytical and search-based approximation techniques simultaneously
    to both speed up the synthesis runtime and improve the quality of obtained results.
    Besides, we studied the utilization of machine learning algorithms to improve
    the performance of several critical steps, i.e., accelerator quality testing,
    in the synthesis framework. The proposed framework can help the community to rapidly
    generate efficient approximate accelerators in a reasonable runtime.
author:
- first_name: Muhammad
  full_name: Awais, Muhammad
  id: '64665'
  last_name: Awais
  orcid: https://orcid.org/0000-0003-4148-2969
- first_name: Marco
  full_name: Platzner, Marco
  last_name: Platzner
citation:
  ama: 'Awais M, Platzner M. MCTS-Based Synthesis Towards Efficient Approximate Accelerators.
    In: <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>. IEEE;
    2021:384-389.'
  apa: Awais, M., &#38; Platzner, M. (2021). MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators. <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, 384–389.
  bibtex: '@inproceedings{Awais_Platzner_2021, title={MCTS-Based Synthesis Towards
    Efficient Approximate Accelerators}, booktitle={Proceedings of IEEE Computer Society
    Annual Symposium on VLSI}, publisher={IEEE}, author={Awais, Muhammad and Platzner,
    Marco}, year={2021}, pages={384–389} }'
  chicago: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators.” In <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, 384–89. IEEE, 2021.
  ieee: M. Awais and M. Platzner, “MCTS-Based Synthesis Towards Efficient Approximate
    Accelerators,” in <i>Proceedings of IEEE Computer Society Annual Symposium on
    VLSI</i>, Tampa, Florida USA (Virtual), 2021, pp. 384–389.
  mla: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators.” <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, IEEE, 2021, pp. 384–89.
  short: 'M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium
    on VLSI, IEEE, 2021, pp. 384–389.'
conference:
  end_date: 2021-07-09
  location: Tampa, Florida USA (Virtual)
  name: IEEE Computer Society Annual Symposium on VLSI
  start_date: 2021-07-07
date_created: 2021-06-14T14:05:17Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '78'
keyword:
- Approximate computing
- Design space exploration
- Accelerator synthesis
language:
- iso: eng
page: 384-389
publication: Proceedings of IEEE Computer Society Annual Symposium on VLSI
publisher: IEEE
status: public
title: MCTS-Based Synthesis Towards Efficient Approximate Accelerators
type: conference
user_id: '64665'
year: '2021'
...
---
_id: '2261'
author:
- first_name: Tobias
  full_name: Schumacher, Tobias
  last_name: Schumacher
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Schumacher T, Plessl C, Platzner M. An Accelerator for k-th Nearest Neighbor
    Thinning Based on the IMORC Infrastructure. In: <i>Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL)</i>. IEEE; 2009:338-344.'
  apa: Schumacher, T., Plessl, C., &#38; Platzner, M. (2009). An Accelerator for k-th
    Nearest Neighbor Thinning Based on the IMORC Infrastructure. <i>Proc. Int. Conf.
    on Field Programmable Logic and Applications (FPL)</i>, 338–344.
  bibtex: '@inproceedings{Schumacher_Plessl_Platzner_2009, title={An Accelerator for
    k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure}, booktitle={Proc.
    Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE},
    author={Schumacher, Tobias and Plessl, Christian and Platzner, Marco}, year={2009},
    pages={338–344} }'
  chicago: Schumacher, Tobias, Christian Plessl, and Marco Platzner. “An Accelerator
    for K-Th Nearest Neighbor Thinning Based on the IMORC Infrastructure.” In <i>Proc.
    Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 338–44. IEEE,
    2009.
  ieee: T. Schumacher, C. Plessl, and M. Platzner, “An Accelerator for k-th Nearest
    Neighbor Thinning Based on the IMORC Infrastructure,” in <i>Proc. Int. Conf. on
    Field Programmable Logic and Applications (FPL)</i>, 2009, pp. 338–344.
  mla: Schumacher, Tobias, et al. “An Accelerator for K-Th Nearest Neighbor Thinning
    Based on the IMORC Infrastructure.” <i>Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL)</i>, IEEE, 2009, pp. 338–44.
  short: 'T. Schumacher, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL), IEEE, 2009, pp. 338–344.'
date_created: 2018-04-06T15:15:47Z
date_updated: 2023-09-26T13:52:52Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
keyword:
- IMORC
- NOC
- KNN
- accelerator
language:
- iso: eng
page: 338-344
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publication_identifier:
  isbn:
  - 978-1-4244-3892-1
  issn:
  - 1946-1488
publisher: IEEE
quality_controlled: '1'
status: public
title: An Accelerator for k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2428'
abstract:
- lang: eng
  text: ' In this paper we present instance-specific accelerators for minimum-cost
    covering problems. We first define the covering problem and discuss a branch&bound
    algorithm to solve it. Then we describe an instance-specific hardware architecture
    that implements branch&bound in 3-valued logic and uses reduction techniques usually
    found in software solvers. Results for small unate covering problems reveal significant
    raw speedups. '
author:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Plessl C, Platzner M. Instance-Specific Accelerators for Minimum Covering.
    In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>. CSREA Press; 2001:85-91.'
  apa: Plessl, C., &#38; Platzner, M. (2001). Instance-Specific Accelerators for Minimum
    Covering. In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and
    Algorithms (ERSA)</i> (pp. 85–91). CSREA Press.
  bibtex: '@inproceedings{Plessl_Platzner_2001, title={Instance-Specific Accelerators
    for Minimum Covering}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Plessl, Christian
    and Platzner, Marco}, year={2001}, pages={85–91} }'
  chicago: Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators
    for Minimum Covering.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>, 85–91. CSREA Press, 2001.
  ieee: C. Plessl and M. Platzner, “Instance-Specific Accelerators for Minimum Covering,”
    in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>, 2001, pp. 85–91.
  mla: Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators for
    Minimum Covering.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems
    and Algorithms (ERSA)</i>, CSREA Press, 2001, pp. 85–91.
  short: 'C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA), CSREA Press, 2001, pp. 85–91.'
date_created: 2018-04-17T15:39:17Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '518'
- _id: '78'
keyword:
- minimum covering
- accelerator
- funding-sundance
page: 85-91
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
  (ERSA)
publisher: CSREA Press
status: public
title: Instance-Specific Accelerators for Minimum Covering
type: conference
user_id: '24135'
year: '2001'
...