New List - CVIT

More documents

Recommendations

Info

100001000Time (Milliseconds)1001010.10.010.0011K 2K 4K 8K 16K 32K 64K 128K 256K 512K 1M 2M 4M 8M 16M 32M 64MGTX280 0.065 0.087 0.127 0.22 0.359 0.686 1.21 2.747 6.313 12.48 26.4 56.84 130.1 279.6 615.6 1359 2841Core i7 0.006 0.01 0.018 0.047 0.105 0.535 1.357 3.051 6.395 14.8 35.09 128.3 324.3 730.1 1582 3352 6929<strong>List</strong> Size
• For lists of size < 2 16• Pack rank and successor in a 32-bit integer• Potential applications in Sparse ForestsTime (Milliseconds)0.80.70.60.50.40.30.20.101K 2K 4K 8K 16K 32K32 bit 0.054 0.069 0.104 0.166 0.234 0.41764 bit 0.065 0.087 0.127 0.22 0.359 0.686<strong>List</strong> Size
Page 2 and 3: • Dedicated co-processorsthat han
Page 4 and 5: • Classic Irregular Algorithm•
Page 6: • Pointer Jumping Technique for t
Page 9 and 10: Thread Execution Control Unit1 2 M-
Page 11 and 12: CPU / HostKernel 1GridBlocks(0,0)GP
Page 13: • Simple Problem (Sequentially Sp
Page 17 and 18: • A basic technique in parallel c
Page 19: • A basic technique in parallel c
Page 22 and 23: • Use pointer jumping repeatedly
Page 26: • The original algorithm has n th
Page 29 and 30: 40961024256Time (Milliseconds)64164
Page 31 and 32: • Designed for SMPs - Sparse Ruli
Page 33 and 34: SuccessorArrayLocal Ranks2 4 8 1 9
Page 51 and 52: • Assume you select n/log n split
Page 55 and 56: • Each phase is coded as separate
Page 57 and 58: • Notice that choosing splitters
Page 59 and 60: • Two factors that contribute to
Page 61 and 62: • Ordered Lists are Lists with su
Page 64 and 65: • Parallel Processing of Graphs
Page 66 and 67: Each edge is replaced with a set of
Page 68 and 69: • Once an Euler Path is construct
Page 70 and 71: Load TreeConstruct Euler Path EPPer
Page 72: 120.00160.00100.00140.00Time (Milli
Page 75 and 76:
• Kernel Cycles consists of• Da
Page 77:
Memory Transactions128-byte segment
Page 80 and 81:
• Calculations
Page 82 and 83:
• Exploiting massive parallelism
Page 84:
• 2007 - 2008 Course Work at IIIT
show all

New List - CVIT

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?