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

Discuss/determine laws for ParFuture & ParIVar #119

Open
rrnewton opened this issue Jul 29, 2015 · 1 comment
Open

Discuss/determine laws for ParFuture & ParIVar #119

rrnewton opened this issue Jul 29, 2015 · 1 comment

Comments

@rrnewton
Copy link
Member

UPDATE: This is important enough that I moved it to a Wiki page.

We could still use this issue as a DISCUSSION THREAD for that wiki page.

@rrnewton
Copy link
Member Author

One point of tension here is that the idempotence-requiring schedulers can ONLY implement the idempotent APIs.

If IdempotentParIVar is a subclass of ParIVar that's actually backwards. The traditional LVish idempotency-assuming scheduler could implement the former interface but not the latter. That is, if it implemented the latter random multiple-put exceptions could happen at any time.

(Of course, a fully correct IdempotentParIVar requires VerifiedEq, which we don't have yet.)

We should probably start using VerifiedEq -- just as an alias at first -- to keep track of where we need it.

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