Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Basic work partitioning for coarser-grained distribution #3

Open
GoogleCodeExporter opened this issue Sep 20, 2015 · 1 comment
Open

Comments

@GoogleCodeExporter
Copy link

What steps will reproduce the problem?
Work is distributed in small chunks to workers, so the communication and
latency of distributing work and receiving status updates can significantly
affect overall runtime.

What is the expected output? What do you see instead?
Performance should scale more linearly with additional nodes.  We should be
able to implement better I/O management.  Our first pass will involve KLFM
bi-partitioning.  We may implement other algorithms in the future, such as
those that allow replication or k-partitioning.



Original issue reported on code.google.com by [email protected] on 18 Jan 2008 at 10:20

@GoogleCodeExporter
Copy link
Author

Original comment by [email protected] on 18 Jan 2008 at 10:21

  • Added labels: Component-Logic, Performance

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant