tslp throttling automatic vectorization when less is more
play

TSLP Throttling Automatic Vectorization: When Less is More - PowerPoint PPT Presentation

Jun 07, 2023 •411 likes •1.55k views

TSLP Throttling Automatic Vectorization: When Less is More Vasileios Porpodas and Timothy M. Jones University of Cambridge LLVM Developers Meeting 2015 www.cl.cam.ac.uk/ vp331/ slide 1 of 16 Why SIMD Vectorization? Scalar Reg. File

  1. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * + + L L * * + + S S Total Cost: −1 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  2. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * + + L L * * + + + + −1 S S Total Cost: −2 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  3. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * + + L L * * −1 L L + + + + −1 S S Total Cost: −3 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  4. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: −4 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  5. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * + + −1 + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: −5 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  6. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L * L * −1 * * + + −1 + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: −6 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  7. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L L L * L * +1 i i +1 −1 * * + + −1 + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: −4 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  8. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L +1 +1 L L i i L L L * L * +1 i i +1 −1 * * + + −1 + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: −2 S S −1 www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  9. SLP not profitable for whole graph A[i] =B[i] + (C[2*i]*(D[2*i]+(E[2*i]*C[2*i]))) A[i+1]=B[i+1] + (C[3*i]*(D[3*i]+(E[3*i]*C[3*i]))) L L L L L L +1 +1 L L i i +1 i i +1 L L L * L * +1 i i +1 −1 * * + + −1 + + L L * * −1 L L −1 * * + + + + −1 S S Total Cost: 0 S S −1 Unprofitable ! www.cl.cam.ac.uk/ ∼ vp331/ slide 6 of 16

  10. TSLP removes unprofitable region SLP L L L L +1 +1 i i +1 i i +1 L L +1 i i +1 −1 * * −1 + + −1 L L −1 * * + + −1 S S −1 Total Cost: 0 Unprofitable! www.cl.cam.ac.uk/ ∼ vp331/ slide 7 of 16

  11. TSLP removes unprofitable region TSLP L L L L +1 +1 i i +1 i i +1 L L +1 i i +1 −1 * * −1 + + −1 L L −1 * * TSLP CUT + + −1 S S −1 Total Cost: www.cl.cam.ac.uk/ ∼ vp331/ slide 7 of 16

  12. TSLP removes unprofitable region L L L L TSLP L L * * + + * * i +1 i +1 −1 L L TSLP CUT + + −1 S S −1 Total Cost: www.cl.cam.ac.uk/ ∼ vp331/ slide 7 of 16

  13. TSLP removes unprofitable region L L L L TSLP L L * * + + * * i +1 i +1 −1 L L TSLP CUT + + −1 S S −1 Total Cost: −1 Profitable ! www.cl.cam.ac.uk/ ∼ vp331/ slide 7 of 16

  14. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  15. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  16. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  17. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts 4. Throttle (cut) the SLP graph www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  18. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts 4. Throttle (cut) the SLP graph Calculate cost of vectorization 5. www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  19. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. Calculate cost of vectorization 5. 6. Save cut with best cost www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  20. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. Calculate cost of vectorization 5. 6. Save cut with best cost 7. NO Tried all cuts? www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  21. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. • Vanilla SLP Calculate cost of vectorization 5. 6. Save cut with best cost 7. NO Tried all cuts? YES 8. cost < threshold? www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  22. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. • Vanilla SLP Calculate cost of vectorization 5. 6. Save cut with best cost 7. NO Tried all cuts? YES 8. cost < threshold? YES 9. Replace scalars with vectors www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  23. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. • Vanilla SLP Calculate cost of vectorization 5. 6. Save cut with best cost 7. NO Tried all cuts? YES 8. cost < threshold? YES 9. Replace scalars with vectors DONE www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  24. Scalar IR TSLP Algorithm Find seed instructions for vectorization 1. • Extension to SLP 2. Generate the SLP graph • Try out many cuts 3. Calculate all valid cuts • Keep best cut Throttle (cut) the SLP graph 4. • Vanilla SLP Calculate cost of vectorization 5. 6. Save cut with best cost 7. NO Tried all cuts? YES 8. NO cost < threshold? YES 9. Replace scalars with vectors DONE www.cl.cam.ac.uk/ ∼ vp331/ slide 8 of 16

  25. Cost calculation example TotalCost L L L L L L * * + + * * L L + + S S www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  26. Cost calculation example TotalCost Vector L L L L V+ S +G −Scalar L L * * + + * * L L + + S S www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  27. Cost calculation example TotalCost Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * − 18 L L − 18 − 18 + + − 18 S S − 18 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  28. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * − 18 L L − 18 − 18 + + − 18 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  29. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * − 18 L L − 18 − 18 + + cut1 1 +16+ 2 − 18 = +1 VEC S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  30. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * − 18 L L − 18 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  31. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * − 18 L L cut3 2 + 14 + 4 − 18 = +2 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  32. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + − 18 * * TSLP cut4 3 + 12 + 2 − 18 = −1 L L cut3 2 + 14 + 4 − 18 = +2 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  33. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * − 18 + + cut5 4 + 10+ 4 − 18 = 0 * * TSLP cut4 3 + 12 + 2 − 18 = −1 L L cut3 2 + 14 + 4 − 18 = +2 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  34. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar − 18 L L * * cut6 5 + 8 + 6 − 18 = +1 + + cut5 4 + 10+ 4 − 18 = 0 * * TSLP cut4 3 + 12 + 2 − 18 = −1 L L cut3 2 + 14 + 4 − 18 = +2 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  35. Cost calculation example TotalCost SCALAR Vector L L L L V+ S +G −Scalar no cut SLP (SLP) 6 + 6 + 6 − 18 = 0 L L * * cut6 5 + 8 + 6 − 18 = +1 + + cut5 4 + 10+ 4 − 18 = 0 * * TSLP cut4 3 + 12 + 2 − 18 = −1 L L cut3 2 + 14 + 4 − 18 = +2 cut2 5 + 8 + 8 − 18 = +3 VECTOR + + cut1 1 +16+ 2 − 18 = +1 S S cut0 0 + 18+ 0 − 18 = 0 www.cl.cam.ac.uk/ ∼ vp331/ slide 9 of 16

  36. Subgraph (Cuts) Generation Algorithm L L L * + L * + S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  37. Subgraph (Cuts) Generation Algorithm L L L * + L * + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  38. Subgraph (Cuts) Generation Algorithm L L L * + L * + S + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  39. Subgraph (Cuts) Generation Algorithm L L L * + L L * + + S S + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  40. Subgraph (Cuts) Generation Algorithm L L L L * + L L L * * + + + S S S + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  41. Subgraph (Cuts) Generation Algorithm L L L L L L * + + L L L L * * * + + + + S S S S + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  42. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  43. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L + S S * + S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  44. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L + L S S + * * + + S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  45. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  46. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  47. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  48. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  49. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  50. Subgraph (Cuts) Generation Algorithm L L L L L L L L L * * + + + L L L L L * * * * + + + + + S S S S S L L L L + L L S S * + + * * * + + + S S S • Only connected subgraphs that include the root • Worst time complexity O (2 B xN ) (N=Nodes, B=Neighbors) www.cl.cam.ac.uk/ ∼ vp331/ slide 10 of 16

  51. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  52. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO subgraphs > T ? www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  53. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO subgraphs > T ? ... ... X Y subgraph www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  54. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO subgraphs > T ? ... ... ... ... X Y X Y subgraph subgraph www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  55. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO subgraphs > T ? ... ... ... ... ... ... X Y X Y X Y subgraph subgraph subgraph www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  56. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO YES subgraphs > T ? ... ... ... ... ... ... X Y X Y X Y subgraph subgraph subgraph • After T subgraphs, attach all neighbors www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  57. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO YES subgraphs > T ? ... ... ... ... ... ... ... ... X Y X Y X Y X Y subgraph subgraph subgraph subgraph • After T subgraphs, attach all neighbors www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  58. Fast Subgraph (Cuts) Generation Algorithm ... ... X Y subgraph NO YES subgraphs > T ? ... ... ... ... ... ... ... ... X Y X Y X Y X Y subgraph subgraph subgraph subgraph • After T subgraphs, attach all neighbors • Complexity reduced to linear O ( T + N ) www.cl.cam.ac.uk/ ∼ vp331/ slide 11 of 16

  59. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  60. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  61. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz • Compiler flags: -O3 -allow-partial-unroll -march=core-avx2 -mtune-core-i7 www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  62. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz • Compiler flags: -O3 -allow-partial-unroll -march=core-avx2 -mtune-core-i7 • Kernels, SPEC 2006 and NPB2.3-C • We evaluated the following cases: www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  63. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz • Compiler flags: -O3 -allow-partial-unroll -march=core-avx2 -mtune-core-i7 • Kernels, SPEC 2006 and NPB2.3-C • We evaluated the following cases: 1 All loop, SLP and TSLP vectorizers disabled (O3) www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  64. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz • Compiler flags: -O3 -allow-partial-unroll -march=core-avx2 -mtune-core-i7 • Kernels, SPEC 2006 and NPB2.3-C • We evaluated the following cases: 1 All loop, SLP and TSLP vectorizers disabled (O3) 2 O3 + SLP enabled (SLP) www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

  65. Experimental Setup • Implemented TSLP in the trunk version of the LLVM 3.6 compiler. • Target: Intel Core i5-4570 @ 3.2Ghz • Compiler flags: -O3 -allow-partial-unroll -march=core-avx2 -mtune-core-i7 • Kernels, SPEC 2006 and NPB2.3-C • We evaluated the following cases: 1 All loop, SLP and TSLP vectorizers disabled (O3) 2 O3 + SLP enabled (SLP) 3 O3 + TSLP enabled (TSLP) www.cl.cam.ac.uk/ ∼ vp331/ slide 12 of 16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P .

Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P .

Using Machine Learning to Improve Automatic Vectorization Kevin Stock Louis-Nol Pouchet P . Sadayappan The Ohio State University January 24, 2012 HiPEAC Conference Paris, France Introduction: HiPEAC12 Vectorization Observations

346 views • 22 slides
PSLP: Padded SLP Automatic Vectorization Vasileios Porpodas , Alberto Magni and Timothy M.

PSLP: Padded SLP Automatic Vectorization Vasileios Porpodas , Alberto Magni and Timothy M.

PSLP: Padded SLP Automatic Vectorization Vasileios Porpodas , Alberto Magni and Timothy M. Jones University of Cambridge University of Edinburgh EuroLLVM APR 2015 slide 1 of 17 www.cl.cam.ac.uk/ vp331/ Why SIMD

1.29k views • 90 slides
Is vectorization easy? Is vectorization enough? Sbastien Ponce Florian Lemaitre Plan

Is vectorization easy? Is vectorization enough? Sbastien Ponce Florian Lemaitre Plan

Is vectorization easy? Is vectorization enough? Sbastien Ponce Florian Lemaitre Plan Introduction Matrix-Vector product Batch processing Hand-made Vectorization Check vectorization Conclusion &amp; Guidelines Plan Introduction 1 What

601 views • 42 slides
Automatic SIMD vectorization for Haskell Leaf Petersen, Dominic Orchard , Neal Glew ICFP 2013 -

Automatic SIMD vectorization for Haskell Leaf Petersen, Dominic Orchard , Neal Glew ICFP 2013 -

Automatic SIMD vectorization for Haskell Leaf Petersen, Dominic Orchard , Neal Glew ICFP 2013 - Boston, MA, USA Work done at Intel Labs SIMD Trend towards parallel architectures (multi-core &amp; instruction-level parallelism) SIMD:

559 views • 29 slides
AUTOMATIC VECTORIZATION OF TREE TRAVERSALS Youngjoon Jo, Michael Goldfarb and Milind Kulkarni

AUTOMATIC VECTORIZATION OF TREE TRAVERSALS Youngjoon Jo, Michael Goldfarb and Milind Kulkarni

AUTOMATIC VECTORIZATION OF TREE TRAVERSALS Youngjoon Jo, Michael Goldfarb and Milind Kulkarni PACT, Edinburgh, U.K. September 11 th , 2013 2 Youngjoon Jo Commodity processors and SIMD Commodity processors support SIMD (Single Instruction

1.38k views • 112 slides
Exploiting automatic vectorization to employ SPMD on SIMD registers Stefan Sprenger

Exploiting automatic vectorization to employ SPMD on SIMD registers Stefan Sprenger

Exploiting automatic vectorization to employ SPMD on SIMD registers Stefan Sprenger (sprengsz@informatik.hu-berlin.de) Steffen Zeuch (steffen.zeuch@dfki.de) Ulf Leser (leser@informatik.hu-berlin.de) HardBD &amp; Active 18 April 16, 2018

407 views • 21 slides
Lecture 3 SIMD and Vectorization GPU Architecture Todays lecture Vectorization and SSE

Lecture 3 SIMD and Vectorization GPU Architecture Todays lecture Vectorization and SSE

Lecture 3 SIMD and Vectorization GPU Architecture Todays lecture Vectorization and SSE Computing with Graphical Processing Units (GPUs) Scott B. Baden / CSE 262 / UCSD, Wi '15 2 Performance programming for Mtx Multiply

700 views • 41 slides
Throttling numbers for cop vs gambler James Lin Carl Joshua Quines Espen Slettnes mentor: Jesse

Throttling numbers for cop vs gambler James Lin Carl Joshua Quines Espen Slettnes mentor: Jesse

Throttling numbers for cop vs gambler James Lin Carl Joshua Quines Espen Slettnes mentor: Jesse Geneson May 1920, 2018 MIT PRIMES Conference J. Lin, C. J. Quines, E. Slettnes Throttling numbers for cop vs gambler 1 / 21 Cop vs robber

255 views • 21 slides
MetaCAPTCHA: A Metamorphic Throttling Service for the Web Akshay Dua, Thai Bui, Tien Le, Nhan

MetaCAPTCHA: A Metamorphic Throttling Service for the Web Akshay Dua, Thai Bui, Tien Le, Nhan

Introduction System Architecture Evaluations References MetaCAPTCHA: A Metamorphic Throttling Service for the Web Akshay Dua, Thai Bui, Tien Le, Nhan Huynh, Wu-chang Feng { akshay, buithai, letien, nhhuyng, wuchang } @cs.pdx.edu Portland

913 views • 57 slides
LLVM Auto-Vectorization Past Present Future Renato Golin www.linaro.org LLVM

LLVM Auto-Vectorization Past Present Future Renato Golin www.linaro.org LLVM

LLVM Auto-Vectorization Past Present Future Renato Golin www.linaro.org LLVM Auto-Vectorization Plan: What is auto-vectorization? Short-history of the LLVM vectorizer What do we support today, and an overview of how it works

386 views • 22 slides
Outline Introduction Contribution: Novel Vectorization and Mapping Workflow.

Outline Introduction Contribution: Novel Vectorization and Mapping Workflow.

11/4/14 Vectorization and Mapping of Software Defined Radio Applications on GPU Platforms Shuvra S. Bhattacharyya Professor, ECE and UMIACS University of Maryland at College Park ssb@umd.edu , http://www.ece.umd.edu/~ssb With

632 views • 19 slides
Function Call Re-Vectorization Pupil: Rubens Emilio Alves Moreira Advisor: Fernando Magno Quinto

Function Call Re-Vectorization Pupil: Rubens Emilio Alves Moreira Advisor: Fernando Magno Quinto

Function Call Re-Vectorization Pupil: Rubens Emilio Alves Moreira Advisor: Fernando Magno Quinto Pereira Function Call Re-Vectorization Programmability Efficiency Function Call Re-Vectorization CUDA: kernel &lt;&lt;&lt;#warps,

1.62k views • 118 slides
Using Throttling and Traffic Shaping to Combat Spam Ken Simpson, Founder and CEO, for USENIX LISA

Using Throttling and Traffic Shaping to Combat Spam Ken Simpson, Founder and CEO, for USENIX LISA

Using Throttling and Traffic Shaping to Combat Spam Ken Simpson, Founder and CEO, for USENIX LISA November 14, 2007 Overview 1. Spammus Historicum 2. Spammus Economicus 3. Spammus Interruptus 4. Question &amp; Answer Beer &amp; Spam at

509 views • 33 slides
Hardware Execution Throttling for Multicore Resource Management Xiao Zhang Sandhya Dwarkadas

Hardware Execution Throttling for Multicore Resource Management Xiao Zhang Sandhya Dwarkadas

Hardware Execution Throttling for Multicore Resource Management Xiao Zhang Sandhya Dwarkadas Kai Shen 1 The Multi-Core Challenge Multi-core chip Dominant on market Last level on-chip cache is commonly shared by sibling cores,

286 views • 13 slides
ADVANCED DATABASE SYSTEMS Vectorization vs. Compilation @ Andy_Pavlo // 15- 721 // Spring

ADVANCED DATABASE SYSTEMS Vectorization vs. Compilation @ Andy_Pavlo // 15- 721 // Spring

Lect ure # 21 ADVANCED DATABASE SYSTEMS Vectorization vs. Compilation @ Andy_Pavlo // 15- 721 // Spring 2019 CMU 15-721 (Spring 2019) 2 O BSERVATIO N Vectorization can speed up query performance. Compilation can speed up query

605 views • 36 slides
Zero forcing, propagation time, and throttling on a graph Leslie Hogben Iowa State University

Zero forcing, propagation time, and throttling on a graph Leslie Hogben Iowa State University

Zero forcing, propagation time, and throttling on a graph Leslie Hogben Iowa State University and American Institute of Mathematics New York Combinatorics Seminar August 28, 2020 Leslie Hogben (Iowa State University and American Institute of

752 views • 53 slides
Max flow min cut in higher dimensions Art Duval 1 Caroline Klivans 2 Jeremy Martin 3 1 University

Max flow min cut in higher dimensions Art Duval 1 Caroline Klivans 2 Jeremy Martin 3 1 University

Graphs Algebra Higher dimensions Max flow min cut in higher dimensions Art Duval 1 Caroline Klivans 2 Jeremy Martin 3 1 University of Texas at El Paso 2 Brown University 3 University of Kansas 12th Joint UTEP/NMSU Workshop on Mathematics,

426 views • 23 slides
Cycles, Cuts and Spanning Trees Sections 4 and 5 of Algebraic Graph Theory by N. Biggs

Cycles, Cuts and Spanning Trees Sections 4 and 5 of Algebraic Graph Theory by N. Biggs

Cycles, Cuts and Spanning Trees Cycles, Cuts and Spanning Trees Sections 4 and 5 of Algebraic Graph Theory by N. Biggs Leena Salmela March 13th, 2006 March 13th, 2006 Leena Salmela Slide 1 Cycles, Cuts and Spanning Trees Finite sets

618 views • 16 slides
1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

CS 224W Graph clustering Austin Benson Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster

317 views • 9 slides
Welcome back. Turn in homework! I am away April 15-20. Midterm out when I get back. Few days

Welcome back. Turn in homework! I am away April 15-20. Midterm out when I get back. Few days

Welcome back. Turn in homework! I am away April 15-20. Midterm out when I get back. Few days and take home. Shiftable. Have handle on projects before that. Progress report due Monday. Example Problem: clustering. Points: documents, dna,

515 views • 19 slides
Volumetric Image Visualization Alexandre Xavier Falc ao LIDS - Institute of Computing -

Volumetric Image Visualization Alexandre Xavier Falc ao LIDS - Institute of Computing -

Volumetric Image Visualization Alexandre Xavier Falc ao LIDS - Institute of Computing - UNICAMP afalcao@ic.unicamp.br Alexandre Xavier Falc ao MO815 - Volumetric Image Visualization Planar cuts, reslicing, and interpolation In the

521 views • 21 slides
Introduction to BCP MCF Example Laszlo Ladanyi 1 cois Margot 2 Fran July 18, 2006 1: IBM

Introduction to BCP MCF Example Laszlo Ladanyi 1 cois Margot 2 Fran July 18, 2006 1: IBM

Introduction to BCP MCF Example Laszlo Ladanyi 1 cois Margot 2 Fran July 18, 2006 1: IBM T.J. Watson Research Center 2: Tepper School of Business, Carnegie Mellon University BCP: Branch-Cut-Price Software for branch-and-cut-and-price

1.14k views • 67 slides
Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost

Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost

Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* r and c*/c r where c* is the optimal cost. We focus on ratio (as opposed to difference) because that appears to be more

999 views • 18 slides
Global Virtual Time Wallclock time T (GVT t ) during the execution of a Time Warp simulation is

Global Virtual Time Wallclock time T (GVT t ) during the execution of a Time Warp simulation is

Global Virtual Time Wallclock time T (GVT t ) during the execution of a Time Warp simulation is defined as the minimum time stamp among all unprocessed and partially Advanced Simulation processed messages and anti-messages in the system at

198 views • 5 slides

More recommend