Software Open Access

JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release

Jianyi Cheng

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <controlfield tag="005">20200125072316.0</controlfield>
  <controlfield tag="001">3561115</controlfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">46511</subfield>
    <subfield code="z">md5:f1aaed4338f7336b4a80c19dfdea60b8</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-12-03</subfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">software</subfield>
    <subfield code="o"></subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Imperial College London</subfield>
    <subfield code="a">Jianyi Cheng</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release</subfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u"></subfield>
    <subfield code="a">GNU General Public License v2.0 or later</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;First release of my HLS benchmarks. The benchmarks include:&lt;/p&gt;

	&lt;li&gt;&lt;em&gt;gSum&lt;/em&gt; sums a number of polynomial results from the array elements that meet the given conditions where the difference between two elements from the arrays is non-negative.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;gSumIf&lt;/em&gt; is similar to &lt;em&gt;gSum&lt;/em&gt; but the SS function returns one of two polynomial expressions based on the value of the difference.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;sparseMatrixPower&lt;/em&gt; performs dot product of two matrices, which skips the operation when the weight is zero.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;histogram&lt;/em&gt; sums various weight onto the corresponding features but also in a sparse form.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;getTanh&lt;/em&gt; performs the approximated function &lt;em&gt;tanh(x)&lt;/em&gt; onto an array of integers using the CORDIC algorithm and a polynomial function.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;getTanh(double)&lt;/em&gt; is similar to &lt;em&gt;getTanh&lt;/em&gt; but uses an array of doubles.&lt;/li&gt;
	&lt;li&gt;&lt;em&gt;BNNKernel&lt;/em&gt; is a small BNN kernel with LUT function as XOR.&lt;/li&gt;
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">url</subfield>
    <subfield code="i">isSupplementTo</subfield>
    <subfield code="a"></subfield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.3561114</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.3561115</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">software</subfield>
All versions This version
Views 125113
Downloads 2727
Data volume 1.3 MB1.3 MB
Unique views 111104
Unique downloads 2626


Cite as