BT
You are now in FULL VIEW
CLOSE FULL VIEW

ASPIRE:Exploiting Asynchronous Parallelism in Iterative Algorithms using a Relaxed Consistency-based DSM
Recorded at:

| by Sai Charan Koduru Follow 0 Followers , Rajiv Gupta Follow 0 Followers , Keval Vora Follow 0 Followers on May 14, 2015 |
18:19

Summary
The authors present a relaxed memory consistency model and consistency protocol that tolerate communication latency and minimize the use of stale values, outperforming other models.

Sponsored Content

Bio

Keval Vora, University of California, Riverside. Sai Charan Koduru, University of California, Riverside. Rajiv Gupta, University of California, Riverside.

SPLASH — the ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity — embraces all aspects of programming, languages, and software construction and delivery. It incorporates OOPSLA, Onward!, the Dynamic Languages Symposium, and a host of workshops, panels, tutorials, demonstrations and invited talks.

Login to InfoQ to interact with what matters most to you.


Recover your password...

Follow

Follow your favorite topics and editors

Quick overview of most important highlights in the industry and on the site.

Like

More signal, less noise

Build your own feed by choosing topics you want to read about and editors you want to hear from.

Notifications

Stay up-to-date

Set up your notifications and don't miss out on content that matters to you

BT