CSC/ECE 506 Spring 2012/10a dr

From Expertiza_Wiki
Revision as of 23:56, 2 April 2012 by Rchakar (talk | contribs)
Jump to navigation Jump to search

Prefetching and consistency models

Introduction

In

Prefetching

a

B

h

C

If k


D

controversial.

Consistency models <ref>http://titanium.cs.berkeley.edu/papers/kamil-su-yelick-sc05.pdf</ref>

The interface for memory in a shared memory multiprocessor is called a memory consistency model. The memory consistency model in shared memory parallel programming controls the order in which memory operations performed by one thread may be observed by another. Consistency models are used in distributed systems like distributed shared memory systems or distributed data stores (such as a filesystems, databases, optimistic replication systems or Web caching). The system supports a given model, if operations on memory follow specific rules. The data consistency model specifies a contract between programmer and system, wherein the system guarantees that if the programmer follows the rules, memory will be consistent and the results of memory operations will be predictable.

F

When

G

So

Conclusion

H

Using

I

Even

External links

1. Sequential hardware prefetching in shared-memory multiprocessors

2. Making Sequential Consistency Practical in Titanium

References

<references/>