DOC PREVIEW
MIT 6 033 - Concurrency

This preview shows page 1-2-3-4 out of 11 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Sequence CoordinationPerformance MetricsPerformance BottlenecksI/O BottleneckConcurrencyIsolation PrimitivesCachingMIT OpenCourseWarehttp://ocw.mit.edu 6.033 Computer System Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.NETWeb ServerHTMLDiskSequence Coordinationeventcount Æ integerwait(eventcount, value)notify(eventcount)if ec ≤ valuewaitPerformanceConcurrencyCachingSchedulingPerformance MetricsCapacity: Amt of resourceUtilization: % of capacity usingLatency: time for a req. to completeThroughput: req/secsize in GBSinstrs/secPerformance BottlenecksI/O BottleneckCPUNET HTML DiskProc CacheRAMDiskNetwork10 ms1 ns20 ns100 ns100 ms100GB32512KB16MB?TBssmall fast108= 100 MX111 ms100 ms 10 ms1 msConcurrency pipelining - between modules / tput - 1 Olsec 4. R1, Hide latency time…101 121111100/sectput+R1 +R211 3121…+R3 +R10 +R11,-R1 +R12,-R2R1R2R10R3…1210Race ConditionOutcomes – 1) OK…1HTMLfirstlast10T1T2page Å buf[first]first Å first + 1ret. pagepage Å buf[first]first Å first + 1returnIsolation Primitiveslock tlACQ(tl)page Å buf[first]first Å first + 1REL(tl)RSL – read + set lockheld = falsewhile(!held)held = RSL(tl)endatomicisolate Æ lockslock Æ set,


View Full Document

MIT 6 033 - Concurrency

Documents in this Course
TRIPLET

TRIPLET

12 pages

End Layer

End Layer

11 pages

Quiz 1

Quiz 1

4 pages

Threads

Threads

18 pages

Quiz I

Quiz I

15 pages

Atomicity

Atomicity

10 pages

QUIZ I

QUIZ I

7 pages

Load more
Download Concurrency
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Concurrency and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Concurrency 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?