VLDB 2015 | SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures - Abstract国際会è°VLDB2015ã«2本目ã®è«–æ–‡ãŒæŽ¡æŠžã•ã‚Œã¾ã—ãŸã€‚VLDBã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã®åˆ†é‡Žã§ã¯SIGMODã¨ä¸¦ã‚“ã§é‡è¦ãªä¼šè°ã§ã™ã€‚1本目ã®è«–æ–‡ã«å¼•ã続ãã€ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã‚ˆã使ã‚れる処ç†ã‚’SIMD命令ã§é«˜é€ŸåŒ–ã™ã‚‹å†…容ã§ã€ä»Šåº¦ã®å¯¾è±¡ã¯ã‚½ãƒ¼ãƒˆã§ã™ã€‚ (7/2 追記) è«–æ–‡ã®PDFãŒPVLDBã®ã‚µã‚¤ãƒˆã§å…¬é–‹ã•ã‚Œã¾ã—㟠http://www.vldb.org/pvldb/vol8/p1274-inoue.pdf 1本目ã®è«–æ–‡ã®è§£èª¬è¨˜äº‹ã¯ã“ã¡ã‚‰â†’ VLDB 2015 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions è«–æ–‡ã®æ¦‚è¦ ã‚„ã‚ŠãŸã„ã“㨠SIMD命令を使ã£ã¦ã€æ§‹é€ 体ã®é…列ã®ã‚½ãƒ¼ãƒˆã‚’高速ã«è¡Œã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ã®è«–æ–‡ã§ã™ã€‚ソートã®ã‚ーã¯å„æ§‹é€ ä½“ã«è¦ç´ ã¨ã—ã¦å«ã¾ã‚Œã¦ã„ã‚‹å ´åˆã‚’考ãˆã¦ã„ã¦ï¼Œã‚¢ãƒ«
高速ãªå®‰å®šã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "TimSort" ã®è§£èª¬ - Preferred Networks Research & Development
quick sortよりも高速ã§merge sortã®ã‚ˆã†ã«å®‰å®šã—ã¦ã„るソートアルゴリズムtim sort [勘é•ã„] - Islands in the byte stream![quick sortよりも高速ã§merge sortã®ã‚ˆã†ã«å®‰å®šã—ã¦ã„るソートアルゴリズムtim sort [勘é•ã„] - Islands in the byte stream](https://cdn-ak-scissors.b.st-hatena.com/image/square/f9103c273a45047a455a47c2322a4ec545cd77ee/height=288;version=1;width=512/https%3A%2F%2Fogimage.blog.st-hatena.com%2F17680117127143682567%2F17680117127143702106%2F1558185862)
{{#tags}}- {{label}}
{{/tags}}