Novel algebras for advanced analytics in Julia
Name
JuliaSemiring_HPEC2013_Paper(1).pdf
Size
143.8 KB
Format
Adobe PDF
Checksum (MD5)
0bc08387f4ab505938cf8a03c441082e
Author(s)
Shah, Viral B.
Karpinski, Stefan
Edelman, Alan
Bezanson, Jeffrey Werner
Kepner, Jeremy
Date Issued
November 2013
Journal
2013 IEEE High Performance Extreme Computing Conference (HPEC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Shah, Viral B., Alan Edelman, Stefan Karpinski, Jeff Bezanson, and Jeremy Kepner. “Novel Algebras for Advanced Analytics in Julia.” 2013 IEEE High Performance Extreme Computing Conference (HPEC) (September 2013). doi:10.1109/hpec.2013.6670347.
Version
Author's final manuscript
Abstract
A linear algebraic approach to graph algorithms that exploits the sparse adjacency matrix representation of graphs can provide a variety of benefits. These benefits include syntactic simplicity, easier implementation, and higher performance. One way to employ linear algebra techniques for graph algorithms is to use a broader definition of matrix and vector multiplication. We demonstrate through the use of the Julia language system how easy it is to explore semirings using linear algebraic methodologies.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/HPEC.2013.6670347
