1 / 15

An Implementation of User-level Distributed Shared Memory

An Implementation of User-level Distributed Shared Memory. Wei Zhang & Shu Liu. DSM: Shared Memory + Distributed Memory. Problems & Solutions. Cont. Design Overview. For a read. For a write. Implementation. Data structures: Page Table in each node Pageinfo in server

zasha
Télécharger la présentation

An Implementation of User-level Distributed Shared Memory

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. An Implementation of User-level Distributed Shared Memory Wei Zhang & Shu Liu

  2. DSM: Shared Memory + Distributed Memory Final Report

  3. Problems & Solutions Final Report

  4. Cont. Final Report

  5. Design Overview Final Report

  6. For a read Final Report

  7. For a write Final Report

  8. Implementation • Data structures: • Page Table in each node • Pageinfo in server • Important system calls • mmap() • mprotect() • SIGSEGV signal: handle page fault • pthread: receive page fault request and send data Final Report

  9. Cont. • MPI: create a cluster and be responsible for communication • #include ”dsm.h”: a simple yet powerful API 2014/9/14 Final Report 9

  10. Cont. Include dsm header file Start dsm system Allocate shared memory Synchronize Free shared memory Exit Final Report

  11. Evaluation • Assumptions: • server congestion is not the bottleneck • network is reliable • Benchmarks: • Jacobi: partial differential equations: Ax=b • MM: parallel matrix multiply: C=AB • Scan: multi-iteration scan program • Focus: multi-iteration write program Final Report

  12. Cont. • Speedup Final Report

  13. Cont. • Page Fault 2014/9/14 Progress Report 13 Final Report

  14. Conclusion & Future work • Achieved what we claimed • Improvement: • Blocking Communication-> Non-blocking Communication • Other Memory Consistency Model (MRMW) • Decrease network communication

  15. Thank you! 2014/9/14 Final Report 15

More Related