INVESTIGATIONS INTO PARALLELIZING RANK-ONE TENSOR DECOMPOSITIONS

Thumbnail
Files
Permanent Link
http://hdl.handle.net/11603/15517
Collections
Metadata
Show full item record
Author/Creator
Unknown author
Date
2017-01-01
Type of Work
Text
thesis
Department
Computer Science and Electrical Engineering
Program
Computer Science
Rights
This item may be protected under Title 17 of the U.S. Copyright Law. It is made available by UMBC for non-commercial research and education. For permission to publish or reproduce, please see http://aok.lib.umbc.edu/specoll/repro.php or contact Special Collections at speccoll(at)umbc.edu
Distribution Rights granted to UMBC by the author.
Abstract
Tensor Decompositions are a solved problem in terms of evaluating for a result. Performance, however, is not. There are several projects to parallelize tensor decompositions, using a variety of different methods. This work focuses on investigating other possible strategies for parallelization of rank-one tensor decompositions, measuring performance across a variety of tensor sizes, and reporting the best avenues to continue investigation