1 / 16

CS 241 Section (10/20/11)

CS 241 Section (10/20/11). MP6. MP6. What is MapReduce? Framework for Data Intensive Jobs. MapReduce. We give you. input. reduce(). map(). map(). map(). You need to. Fork(). Pipe() and Select(). Banker's Algorithm. Current Allocation. Can P2 request (A:3 B:0 C:0) ?.

dirk
Download Presentation

CS 241 Section (10/20/11)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 241 Section(10/20/11)

  2. MP6

  3. MP6 • What is MapReduce? • Framework for Data Intensive Jobs

  4. MapReduce

  5. We give you input reduce() map() map() map()

  6. You need to Fork() Pipe() and Select()

  7. Banker's Algorithm

  8. Current Allocation Can P2 request (A:3 B:0 C:0) ?

  9. Current Allocation Can P2 request (A:3 B:0 C:0) ?

  10. Current Allocation Can P2 request (A:3 B:0 C:0) ?

  11. Current Allocation Can P2 request (A:3 B:0 C:0) ?

  12. Current Allocation Can P2 request (A:3 B:0 C:0) ?

  13. Current Allocation Can P2 request (A:3 B:0 C:0) ? No

  14. Current Allocation Can P2 request (A:3 B:0 C:0) ? No What is the maximum number of A's that P2 could take?

  15. Exams Please come get them

  16. Fun Terminal 1 mkfifo filename echo “a” >filename Terminal 2 cat filename cat filename

More Related