Value prediction in HLS allocation problems using intellectual properties

Zs Palotai, T. Kandár, Z. Mohr, T. Visegrády, G. Ziegler, P. Arató, A. Lőrincz

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A value approximation-based global search algorithm is suggested to solve resource-constrained allocation in high level synthesis problems. Value approximation is preferred, because it can start by using expert heuristics, can estimate the global structure of the search problem, and can optimize heuristics. We are concerned by those allocation problems that have hidden global structure that value approximation may unravel. The value approximation applied here computes the cost of the actual solution and estimates the cost of the solution that could be achieved upon performing a global search on the hidden structure starting from the actual solution. We transcribed the allocation problem into a special form of weighted CNF formulae to suit our approach. We also extended the formalism to pipeline operations. Comparisons are made with expert heuristics. Scaling of computation time and performance are compared.

Original languageEnglish
Pages (from-to)117-157
Number of pages41
JournalApplied Artificial Intelligence
Volume16
Issue number2
DOIs
Publication statusPublished - Feb 2002

Fingerprint

Intellectual property
Costs
Pipelines

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Value prediction in HLS allocation problems using intellectual properties. / Palotai, Zs; Kandár, T.; Mohr, Z.; Visegrády, T.; Ziegler, G.; Arató, P.; Lőrincz, A.

In: Applied Artificial Intelligence, Vol. 16, No. 2, 02.2002, p. 117-157.

Research output: Contribution to journalArticle

Palotai, Z, Kandár, T, Mohr, Z, Visegrády, T, Ziegler, G, Arató, P & Lőrincz, A 2002, 'Value prediction in HLS allocation problems using intellectual properties', Applied Artificial Intelligence, vol. 16, no. 2, pp. 117-157. https://doi.org/10.1080/08839510252824544
Palotai Z, Kandár T, Mohr Z, Visegrády T, Ziegler G, Arató P et al. Value prediction in HLS allocation problems using intellectual properties. Applied Artificial Intelligence. 2002 Feb;16(2):117-157. https://doi.org/10.1080/08839510252824544
Palotai, Zs ; Kandár, T. ; Mohr, Z. ; Visegrády, T. ; Ziegler, G. ; Arató, P. ; Lőrincz, A. / Value prediction in HLS allocation problems using intellectual properties. In: Applied Artificial Intelligence. 2002 ; Vol. 16, No. 2. pp. 117-157.
@article{1ac6e79966624e1faa2418976c45b73c,
title = "Value prediction in HLS allocation problems using intellectual properties",
abstract = "A value approximation-based global search algorithm is suggested to solve resource-constrained allocation in high level synthesis problems. Value approximation is preferred, because it can start by using expert heuristics, can estimate the global structure of the search problem, and can optimize heuristics. We are concerned by those allocation problems that have hidden global structure that value approximation may unravel. The value approximation applied here computes the cost of the actual solution and estimates the cost of the solution that could be achieved upon performing a global search on the hidden structure starting from the actual solution. We transcribed the allocation problem into a special form of weighted CNF formulae to suit our approach. We also extended the formalism to pipeline operations. Comparisons are made with expert heuristics. Scaling of computation time and performance are compared.",
author = "Zs Palotai and T. Kand{\'a}r and Z. Mohr and T. Visegr{\'a}dy and G. Ziegler and P. Arat{\'o} and A. Lőrincz",
year = "2002",
month = "2",
doi = "10.1080/08839510252824544",
language = "English",
volume = "16",
pages = "117--157",
journal = "Applied Artificial Intelligence",
issn = "0883-9514",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Value prediction in HLS allocation problems using intellectual properties

AU - Palotai, Zs

AU - Kandár, T.

AU - Mohr, Z.

AU - Visegrády, T.

AU - Ziegler, G.

AU - Arató, P.

AU - Lőrincz, A.

PY - 2002/2

Y1 - 2002/2

N2 - A value approximation-based global search algorithm is suggested to solve resource-constrained allocation in high level synthesis problems. Value approximation is preferred, because it can start by using expert heuristics, can estimate the global structure of the search problem, and can optimize heuristics. We are concerned by those allocation problems that have hidden global structure that value approximation may unravel. The value approximation applied here computes the cost of the actual solution and estimates the cost of the solution that could be achieved upon performing a global search on the hidden structure starting from the actual solution. We transcribed the allocation problem into a special form of weighted CNF formulae to suit our approach. We also extended the formalism to pipeline operations. Comparisons are made with expert heuristics. Scaling of computation time and performance are compared.

AB - A value approximation-based global search algorithm is suggested to solve resource-constrained allocation in high level synthesis problems. Value approximation is preferred, because it can start by using expert heuristics, can estimate the global structure of the search problem, and can optimize heuristics. We are concerned by those allocation problems that have hidden global structure that value approximation may unravel. The value approximation applied here computes the cost of the actual solution and estimates the cost of the solution that could be achieved upon performing a global search on the hidden structure starting from the actual solution. We transcribed the allocation problem into a special form of weighted CNF formulae to suit our approach. We also extended the formalism to pipeline operations. Comparisons are made with expert heuristics. Scaling of computation time and performance are compared.

UR - http://www.scopus.com/inward/record.url?scp=0036464613&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036464613&partnerID=8YFLogxK

U2 - 10.1080/08839510252824544

DO - 10.1080/08839510252824544

M3 - Article

AN - SCOPUS:0036464613

VL - 16

SP - 117

EP - 157

JO - Applied Artificial Intelligence

JF - Applied Artificial Intelligence

SN - 0883-9514

IS - 2

ER -