{"id":191155,"date":"2014-07-24T00:00:00","date_gmt":"2014-07-24T14:17:15","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/recent-advances-in-parallel-algorithms\/"},"modified":"2017-10-24T08:37:46","modified_gmt":"2017-10-24T15:37:46","slug":"recent-advances-in-parallel-algorithms","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/recent-advances-in-parallel-algorithms\/","title":{"rendered":"Recent Advances in Parallel Algorithms"},"content":{"rendered":"<div class=\"asset-content\">\n<p>Parallelism abounds in modern hardware\u2014from the datacenter to multi-cores, GPUs, and FPGAs. On the other hand, important algorithms, such as graph algorithms, dynamic programming, and finite-state machine processing involve fine-grained dependencies and do not directly map on to this parallel hardware. Harnessing the parallelism available for these algorithms requires new algorithms, new programming languages, and new runtime systems. This session will present recent advances in this area and will serve as forum for bringing together researchers from diverse disciplines\u2014such as algorithms, programming languages, compilers and runtime, machine-learning, architecture, and systems\u2014into this exciting research area.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Parallelism abounds in modern hardware\u2014from the datacenter to multi-cores, GPUs, and FPGAs. On the other hand, important algorithms, such as graph algorithms, dynamic programming, and finite-state machine processing involve fine-grained dependencies and do not directly map on to this parallel hardware. Harnessing the parallelism available for these algorithms requires new algorithms, new programming languages, and [&hellip;]<\/p>\n","protected":false},"featured_media":198489,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[],"msr-video-type":[238872],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-191155","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-video-type-faculty-summit","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/BLckiB0bH2M","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/191155"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":1,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/191155\/revisions"}],"predecessor-version":[{"id":434790,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/191155\/revisions\/434790"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/198489"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=191155"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=191155"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=191155"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=191155"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=191155"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=191155"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}