amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-04-19 23:28:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

More minor README.md updates.

Browse Source
This commit is contained in:
Field G. Van Zee
2020-09-25 14:25:24 -05:00
parent 9e940f8aad
commit 5efcdeffd5
1 changed files with 26 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
README.md
View File

@@ -64,7 +64,7 @@ compared to conventional approaches to developing BLAS libraries, as well as a
much-needed refinement of the BLAS interface, and thus constitutes a major
advance in dense linear algebra computation. While BLIS remains a
work-in-progress, we are excited to continue its development and further
cultivate its use within the community.
cultivate its use within the community.
The BLIS framework is primarily developed and maintained by individuals in the
[Science of High-Performance Computing](http://shpc.ices.utexas.edu/)
@@ -211,7 +211,7 @@ seeking to implement tensor contractions on multidimensional arrays.)
Furthermore, since BLIS tracks stride information for each matrix, operands of
different storage formats can be used within the same operation invocation. By
contrast, BLAS requires column-major storage. And while the CBLAS interface
supports row-major storage, it does not allow mixing storage formats.
supports row-major storage, it does not allow mixing storage formats.
* **Rich support for the complex domain.** BLIS operations are developed and
expressed in their most general form, which is typically in the complex domain.
@@ -253,7 +253,7 @@ of BLIS's native APIs directly. BLIS's typed API will feel familiar to many
veterans of BLAS since these interfaces use BLAS-like calling sequences. And
many will find BLIS's object-based APIs a delight to use when customizing
or writing their own BLIS operations. (Objects are relatively lightweight
`structs` and passed by address, which helps tame function calling overhead.)
`structs` and passed by address, which helps tame function calling overhead.)
* **Multilayered API, exposed kernels, and sandboxes.** The BLIS framework
exposes its
@@ -276,7 +276,7 @@ a nearly-complete template for instantiating high-performance BLAS-like
libraries. Furthermore, the framework is extensible, allowing developers to
leverage existing components to support new operations as they are identified.
If such operations require new kernels for optimal efficiency, the framework
and its APIs will be adjusted and extended accordingly.
and its APIs will be adjusted and extended accordingly.
* **Code re-use.** Auto-generation approaches to achieving the aforementioned
goals tend to quickly lead to code bloat due to the multiple dimensions of
@@ -445,14 +445,14 @@ about BLIS, please read this FAQ. If you can't find the answer to your question,
please feel free to join the [blis-devel](https://groups.google.com/group/blis-devel)
mailing list and post a question. We also have a
[blis-discuss](https://groups.google.com/group/blis-discuss) mailing list that
anyone can post to (even without joining).
anyone can post to (even without joining).
**Documents for github contributors:**
* **[Contributing bug reports, feature requests, PRs, etc](CONTRIBUTING.md).**
Interested in contributing to BLIS? Please read this document before getting
started. It provides a general overview of how best to report bugs, propose new
features, and offer code patches.
features, and offer code patches.
* **[Coding Conventions](docs/CodingConventions.md).** If you are interested or
planning on contributing code to BLIS, please read this document so that you can
@@ -553,7 +553,7 @@ Citations
For those of you looking for the appropriate article to cite regarding BLIS, we
recommend citing our
[first ACM TOMS journal paper](http://dl.acm.org/authorize?N91172)
[first ACM TOMS journal paper]( https://dl.acm.org/doi/10.1145/2764454?cid=81314495332)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis1_toms_rev3.pdf)):
```
@@ -569,10 +569,10 @@ recommend citing our
issue_date = {June 2015},
url = {http://doi.acm.org/10.1145/2764454},
}
```
```
You may also cite the
[second ACM TOMS journal paper](http://dl.acm.org/authorize?N16240)
[second ACM TOMS journal paper]( https://dl.acm.org/doi/10.1145/2755561?cid=81314495332)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis2_toms_rev3.pdf)):
```
@@ -591,10 +591,11 @@ You may also cite the
issue_date = {June 2016},
url = {http://doi.acm.org/10.1145/2755561},
}
```
```
We also have a third paper, submitted to IPDPS 2014, on achieving
[multithreaded parallelism in BLIS](https://www.cs.utexas.edu/users/flame/pubs/blis3_ipdps14.pdf):
[multithreaded parallelism in BLIS](https://dl.acm.org/doi/10.1109/IPDPS.2014.110)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis3_ipdps14.pdf)):
```
@inproceedings{BLIS3,
@@ -603,14 +604,15 @@ We also have a third paper, submitted to IPDPS 2014, on achieving
title = {Anatomy of High-Performance Many-Threaded Matrix Multiplication},
booktitle = {28th IEEE International Parallel \& Distributed Processing Symposium
(IPDPS 2014)},
year = 2014,
year = {2014},
url = {https://doi.org/10.1109/IPDPS.2014.110},
}
```
A fourth paper, submitted to ACM TOMS, also exists, which proposes an
[analytical model](http://dl.acm.org/citation.cfm?id=2925987)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf))
for determining blocksize parameters in BLIS:
[analytical model](https://dl.acm.org/doi/10.1145/2925987)
for determining blocksize parameters in BLIS
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf)):
```
@article{BLIS4,
@@ -629,7 +631,8 @@ for determining blocksize parameters in BLIS:
```
A fifth paper, submitted to ACM TOMS, begins the study of so-called
[induced methods for complex matrix multiplication](https://www.cs.utexas.edu/users/flame/pubs/blis5_toms_rev2.pdf):
[induced methods for complex matrix multiplication]( https://dl.acm.org/doi/10.1145/3086466?cid=81314495332)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis5_toms_rev2.pdf):
```
@article{BLIS5,
@@ -644,10 +647,12 @@ A fifth paper, submitted to ACM TOMS, begins the study of so-called
issue_date = {July 2017},
url = {http://doi.acm.org/10.1145/3086466},
}
```
```
A sixth paper, submitted to ACM TOMS, revisits the topic of the previous
article and derives a [superior induced method](https://www.cs.utexas.edu/users/flame/pubs/blis6_sisc_rev3.pdf):
article and derives a
[superior induced method](https://epubs.siam.org/doi/10.1137/19M1282040)
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis6_sisc_rev3.pdf):
```
@article{BLIS6,
@@ -662,10 +667,11 @@ article and derives a [superior induced method](https://www.cs.utexas.edu/users/
issue_date = {September 2020},
url = {https://doi.org/10.1137/19M1282040}
}
```
```
A seventh paper, submitted to ACM TOMS, explores the implementation of `gemm` for
[mixed-domain and/or mixed-precision](https://www.cs.utexas.edu/users/flame/pubs/blis7_toms_rev0.pdf) operands:
[mixed-domain and/or mixed-precision](https://www.cs.utexas.edu/users/flame/pubs/blis7_toms_rev0.pdf) operands
([unofficial backup link](https://www.cs.utexas.edu/users/flame/pubs/blis7_toms_rev0.pdf):
```
@article{BLIS7,