Github user nilmeier commented on the pull request:
https://github.com/apache/spark/pull/8563#issuecomment-137193351
This approach has some similarity to the CALU paper that you posted, and
follows what the paper describes as "classic right looking algorithms",
(p3). There are differences to our approach, which I discussed in a *How
it Works* section in the documentation. We don't have a publication for
this work as of yet.
In terms of running time, I have some single node (i7 macbook) data
(attached). The scaling here for the LU calc appears to be n^3.5, where n
is the number of rowBlocks. The current approach is n^3 at best.
We're running timings on a 10 node (24 core ea.) cluster, and should have
some more comprehensive data for you shortly. Please let me know if I can
provide anything else in the meantime, or if you'd like to meet to discuss.
Sincerely, Jerome
On Wed, Sep 2, 2015 at 10:19 AM, Shivaram Venkataraman <
[email protected]> wrote:
> @nilmeier <https://github.com/nilmeier> Do you have a reference to a
> paper which analyses the running time and communication costs for the
> algorithm implemented here ?
>
> â
> Reply to this email directly or view it on GitHub
> <https://github.com/apache/spark/pull/8563#issuecomment-137176779>.
>
--
Jerome Nilmeier, PhD
Cell: 510-325-8695
Home: 925-292-5321
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
