Software Open Access

JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release

Jianyi Cheng


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.3561115</identifier>
  <creators>
    <creator>
      <creatorName>Jianyi Cheng</creatorName>
      <affiliation>Imperial College London</affiliation>
    </creator>
  </creators>
  <titles>
    <title>JianyiCheng/HLS-benchmarks: HLS_Benchmarks_First_Release</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <dates>
    <date dateType="Issued">2019-12-03</date>
  </dates>
  <resourceType resourceTypeGeneral="Software"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3561115</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsSupplementTo">https://github.com/JianyiCheng/HLS-benchmarks/tree/v1.0</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3561114</relatedIdentifier>
  </relatedIdentifiers>
  <version>v1.0</version>
  <rightsList>
    <rights rightsURI="https://opensource.org/licenses/GPL-2.0">GNU General Public License v2.0 or later</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;First release of my HLS benchmarks. The benchmarks include:&lt;/p&gt;

&lt;ul&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;
&lt;/ul&gt;</description>
  </descriptions>
</resource>
125
27
views
downloads
All versions This version
Views 125113
Downloads 2727
Data volume 1.3 MB1.3 MB
Unique views 111104
Unique downloads 2626

Share

Cite as