Transparente Erweiterung von GPGPU- Speicher durch Hauptspeicher

Transkript

1 Transparente Erweiterung von GPGPU- Speicher durch Hauptspeicher Bachelorarbeit von Jonathan Metter an der Fakultät für Informatik Erstgutachter: Zweitgutachter: Betreuender Mitarbeiter: Prof. Dr. Frank Bellosa Prof. Dr. Wolfgang Karl Dipl.-Inform. Jens Kehne Bearbeitungszeit: 14. April August 2014 KIT Universität des Landes Baden-Württemberg und nationales Forschungszentrum in der Helmholtz-Gemeinschaft

2

3

4

5

6

7

8

9

10

11

12 i nvcc

13 globale Kanalliste Playlist 0, 2, 5 Page Directory (pro Channel) Kanal 2 virtueller Adressraum: Anwendungsdaten {Pushbuffer 1 {Pushbuffer 2 FIFO Kontrollregister 0 ib_get ib_put 1 ib_get ib_put ib_get ib_put 2 Indirect Buffer nvcc

14 ib_get { alter PB 3 ib_put 2 1 {neuer PB Befehl 1 Befehl 2 FIFO Kontrollregister Indirect Buffer virtueller Addressraum ib_get ib_put ib_get ib_get ib_put ib_put ib_put

15 Page Directory PTE Format: Frame number Flags 4kB Page Table 128kB Page Table Comp. Tag S. Type Target present readonly access dirty

16

17

18 Userspace Kernelspace UMD Anwendung API PB Syscall KMD Grafikkarte

19 glbind- Buffer() validate

20 validate validate cudamalloc cudahostalloc validate mmap mmap mmap

21 }BO2 }BO1 virtueller Adressraum der Anwendung mmap mmap physischer Adressraum der CPU BO2 }BO1 virtueller GPU- Adressraum } BAR 1 VRAM BO1 SYSRAM BO2 mmap mmap

22

23

24 Anwendung Frontend API Gast Host Backend Treiber API Grafikkarte mmap

25 UMD (Gdev) Gast- Anwendung virtueller Adressraum des Gastanwendung Syscall paravirt. Treiber Gast- Betriebssystem physischer Adressraum des Gastes Hypercall virtuelles Gerät Qemu virtuelles BAR virtueller Adressraum von Qemu Syscall mmap pscnv Host- Betriebsystem VRAM DMA- Buffer pscnv_virt pscnv_virt pscnv_virt

26 mmap

27 SYSRAM Hintergrundspeicher von A Hintergrundspeicher von B 2 3 VRAM implizit geteilter Buffer 1 Zwischenablage B A A B

28 A A B A B A B A A B A A B

29 dirty nn nn

30 GPU Liste von Regionen map/ unmap GPU- Thread Heap <<shared>> Region 1 <<modified>> Region 2 Region Fault gemeinsamer Speichers Hintergrundspeicher <<shared>> Region 1 <<invalid>> Region 2 <<shared>> Region 3 Polling Thread CPU map() map() map() map() map()

31 map() map() «modified» map() unmap() «shared» «modified» «shared» map() map()

32

33

34

35

36 Accounting SO(s) für neuen Speicher anlegen Client 1 Client 2 SO SO SO SO SO Speicherallokation Swapout bei Speichermangel Wähle Opfer ReduceVRAM Wähle SO VRAM SYSRAM ReduceVRAM ReduceVRAM ReduceVRAM ReduceVRAM

37

38

39

40 ReduceVRAM IncreaseVRAM

41 ReduceVRAM ReduceVRAM ReduceVRAM ReduceVRAM IncreaseVRAM ReduceVRAM

42

43 ReduceVRAM

44 3 vram_alloc reducevram 6 wait() signal() 1 Client SO { demand 2 4 empty_fifo_work SwapOut completion 5 DMA Pause Thread pause() run_empty_fifo_work() continue() ReduceVRAM IncreaseVRAM Reduce- VRAM IncreaseVRAM empty_fifo_work vram_alloc reducevram ReduceVRAM empty_fifo_work IncreaseVRAM

45 empty_fifo_work ReduceVRAM empty_fifo_work IncreaseVRAM empty_fifo_work empty_fifo_work pause() empty_fifo_work run_empty_fifo_work() continue() empty_fifo_work reduce- VRAM

46 ReduceVRAM accessed dirty ReduceVRAM req ReduceVRAM demand demand demand empty_fifo_work

47 req will free selectedsos req < will free victim demand victim = so RandomPop(victim ) will free will free so victim victim so AddJob(victim SwapOut so) selectedsos selectedsos so so selectedsos Wait so req ib_put

48 is_shadowed = false pause() := is_shadowed = false continue() := is_shadowed = true continue() := is_shadowed = false ib_put ib_put ib_put empty_fifo_work

49 pause() continue() pause() continue() is_shadowed mmap mmap

50

51

52 cuctxsynchronize cudadevicesynchronize cuctxsynchronize cuctxsynchronize

53 A B A B C = A B A B A B

54

55 ± ± ± ± ± ± ± ± ± ±

56 alloc1 VRAM alloc2 VRAM VRAM [MB] Zeit [s] alloc1 SYSRAM alloc2 SYSRAM Swapped [MB] Zeit [s]

57 IncreaseVRAM

58 bfs1 VRAM bfs2 VRAM bfs3 VRAM VRAM [MB] Zeit [s] KC [1/s] Zeit [s] bfs1 KC/s bfs2 KC/s bfs3 KC/s mmul1 VRAM mmul2 VRAM mmul3 VRAM VRAM [MB] Zeit [s] mmul1 KC/s mmul2 KC/s mmul3 KC/s KC [1/s] Zeit [s]

59 ReduceVRAM

60 ReduceVRAM C

61

62 cuctxsynchronize cuctxsynchronize

63 accessed dirty accessed dirty

64

65

66

67 latest/ freedesktop.org/wiki/ pathscale/pscnv http: // product-specifications/vt-directed-io-spec.pdf CUDA_C_Best_Practices_Guide.pdf html#r_event_api documentation/gcn_architecture_whitepaper.pdf?raw=true

68 Kvm-forum-2013-Effective-multithreading-in-QEMU.pdf http: //dl.acm.org/citation.cfm?id= http: //lwn.net/articles/257417/ ff570589(v=vs.85).aspx object/bindless_graphics.html NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf acm.org/ /

69 googlecode.com/files/adsm-asplos10.pdf http: // a-trip-through-the-graphics-pipeline-2011-index/ GPGPU.pdf

70 default.aspx?id= GLAPI/glBindBuffer org/registry/cl/ / com/parallelforall/unified-memory-in-cuda-6/ tech/full_papers/jang.pdf papers/pro13.pdf

71 cfm?id= S2/S10 register_spilling.pdf ols2009-pages pdf CodeNames/

72 gem-overview.html eecs.berkeley.edu/pubs/techrpts/2008/eecs html

73