{"id":261,"date":"2017-05-18T22:52:32","date_gmt":"2017-05-18T13:52:32","guid":{"rendered":"http:\/\/www.sgu-ictrobotics.sci.waseda.ac.jp\/wp\/?p=261"},"modified":"2022-12-26T20:39:57","modified_gmt":"2022-12-26T11:39:57","slug":"170530_michellestrout","status":"publish","type":"post","link":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/news\/261","title":{"rendered":"5\u670830\u65e5\u306bArizona\u5927\u5b66\u306eMichelle Strout\u6559\u6388\u306e\u8b1b\u6f14\u4f1a\u306e\u304a\u77e5\u3089\u305b"},"content":{"rendered":"
\n\n\n\n\n\n\n
\u65e5 \u6642<\/th>\n2017\u5e745\u670830\u65e5 \uff08\u706b\uff09\u300013:00 – 2:30<\/td>\n<\/tr>\n
\u30bf\u30a4\u30c8\u30eb<\/th>\nThe Sparse Polyhedral Framework: Composing compiler-generated inspector-executor code<\/td>\n<\/tr>\n
\u5834 \u6240<\/th>\n\u65e9\u7a32\u7530\u5927\u5b6640\u53f7\u9928\uff08\u30b0\u30ea\u30fc\u30f3\u30fb\u30b3\u30f3\u30d4\u30e5\u30fc\u30c6\u30a3\u30f3\u30b0\u30fb\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6a5f\u69cb\uff09 \uff08\u5730\u56f3<\/a>\uff09<\/td>\n<\/tr>\n
\u5bfe\u8c61\u8005<\/th>\n\u5b66\u751f\u3001\u5927\u5b66\u9662\u751f\u3001\u6559\u8077\u54e1<\/td>\n<\/tr>\n
\u53c2\u52a0\u8cbb<\/th>\n\u7121\u6599<\/td>\n<\/tr>\n<\/tbody>\n<\/table><\/div>\n
\"\"<\/a>

Professor Michelle Strout<\/p><\/div>\n

Department of Computer Science
\nUniversity of Arizona
\nUSA<\/p>\n

\u201cThe Sparse Polyhedral Framework: Composing compiler-generated inspector-executor code\u201d<\/i><\/strong><\/p>\n

Abstract:<\/h4>\n
Irregular applications such as big graph analysis, material simulations, molecular dynamics simulations, and finite element analysis have performance problems due to their use of sparse data\u3000structures. Inspector-executor strategies are used to improve sparse computation performance through parallelization and data locality optimizations. An inspector re-schedules and reorders data at runtime, and an executor is a transformed version of the original computation that uses the newly reorganized data structures and schedules. Inspector-executor transformations are commonly written in a domain-specific or even application-specific fashion. Significant progress has been made in incorporating such inspector-executor transformations into existing compiler transformation frameworks, thus enabling their use with compile-time only transformations. However, composing inspector-executor transformations with each other is done on a case-by-case basis so as to reduce inspector overhead. <\/p>\n

The Sparse Polyhedral Framework (SPF) is a compiler loop and array transformation model that can generally compose inspector-executor transformations with each other. In this talk, I review the history and current state of the art for inspector-executor strategies, review how the SPF enables the composition of inspector-executor transformations, and present current research to better balance the generality-performance tradeoff that is being done with the Sparse Polyhedral Framework.<\/p>\n<\/div>\n

Biography:<\/h4>\n
\u535a\u58eb\u53d7\u9818\u5927\u5b66\uff1a\u3000\u30ab\u30ea\u30d5\u30a9\u30eb\u30cb\u30a2\u5927\u5b66\u30b5\u30f3\u30c7\u30a3\u30a8\u30b4\u6821 \u30b3\u30f3\u30d4\u30e5\u30fc\u30bf\u7406\u5de5\u5b66\u5c02\u653b
\n\u8cc7\u683c\uff1a\u30a2\u30ea\u30be\u30ca\u5927\u5b66\u3000\u6559\u6388
\n\u5c02\u9580\u5206\u91ce\uff1a\u30bd\u30d5\u30c8\u30a6\u30a8\u30a2
\n\u7814\u7a76\u5206\u91ce\uff1a\u30cf\u30a4\u30d1\u30d5\u30a9\u30fc\u30de\u30f3\u30b9\u30b3\u30f3\u30d4\u30e5\u30fc\u30c6\u30a3\u30f3\u30b0\u5411\u3051\u30b3\u30f3\u30d1\u30a4\u30e9 <\/p>\n

Prof. Michelle Mills Strout\u306f\u73fe\u5728department of Computer Science, University of Arizona\u306e\u6559\u6388\u3092\u3055\u308c\u3066\u3044\u308b\u3001\u4e16\u754c\u306eHigh Performance Computing\u306e\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u7814\u7a76\u306b\u304a\u3044\u3066\u6700\u3082\u8457\u540d\u306f\u5973\u6027\u7814\u7a76\u8005\u3067\u3059\u3002<\/p>\n

Prof. Strout \u306fPh.D. \u3092 the University of California, San Diego\u304b\u30892003\u5e74\u306b\u6388\u4e0e\u3055\u308c, \u7c73\u56fdHPC\u6700\u9ad8\u5cf0\u306e\u7814\u7a76\u6240\u3067\u3042\u308bArgonne National Laboratory\u306b\u304a\u3044\u3066Enrico Fermi Postdoctoral Scholar\u3001\u540c\u6642\u306ba Research Associate at the University of Chicago\u3068\u3057\u30662\u5e74\u9593\u7814\u7a76\u3092\u3057\u305f\u306e\u3061\u3001Colorado State University\u3000Assistant Professor\u306b2005\u5e74\u306b\u5c31\u4efb\u3057\u3001 2011\u306bAssociate Professor,\u30002015\u5e74\u306b University of Arizona\u306eFull Professor \u306b\u306a\u3089\u308c\u3066\u3044\u307e\u3059\u3002<\/p>\n

\u53d7\u8cde\u6b74\u3082DOE Early Career Award,NSF CAREER Award,AT&T Labs Grant and Fellowship, National Science Foundation Fellowship\u7b49\u304c\u3042\u308a\u307e\u3059\u3002<\/p>\n

\u5b66\u4f1a\u6d3b\u52d5\u3082\u975e\u5e38\u306b\u30a2\u30af\u30c6\u30a3\u30d6\u3067\u4e16\u754c\u6700\u5927\u306eHPC\u306b\u95a2\u3059\u308b\u56fd\u969b\u4f1a\u8b70\u3067\u3042\u308bIEEE\u3000ACM Supercomputing 2016\u3067Chair for the Programming Systems track\u53ca\u3073\u3000Doctoral Showcase Program Committee\u4e26\u5217\u51e6\u7406\u306e\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u8a00\u8a9e\u53ca\u3073\u30b3\u30f3\u30d1\u30a4\u30e9\u306e\u56fd\u969b\u4f1a\u8b70\u3067\u3042\u308bLCPC\u306eGeneral\u3000Chair, Program Chair\u3092\u59cb\u3081\u591a\u304f\u306e\u30d7\u30ed\u30b0\u30e9\u30e0\u59d4\u54e1\u3001NSF\u306e\u7814\u7a76\u8cbb\u5be9\u67fb\u59d4\u54e1\u7b49\u591a\u304f\u306e\u6307\u5c0e\u7684\u30dd\u30b8\u30b7\u30e7\u30f3\u306b\u5c31\u4efb\u3057\u3066\u3044\u308b\u4e16\u754c\u3067\u3082\u6700\u3082\u8457\u540d\u306a\u5973\u6027\u7814\u7a76\u8005\u306e\u4e00\u4eba\u3067\u3059\u3002<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

\u65e5 \u6642 2017\u5e745\u670830\u65e5 \uff08\u706b\uff09\u300013:00 – 2:30 \u30bf\u30a4\u30c8\u30eb The Sparse Polyhedral Framework: Composing compiler-generated inspe […]<\/p>\n","protected":false},"author":1,"featured_media":1976,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[1],"tags":[24],"class_list":["post-261","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-news","tag-events"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/posts\/261","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/comments?post=261"}],"version-history":[{"count":2,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/posts\/261\/revisions"}],"predecessor-version":[{"id":1981,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/posts\/261\/revisions\/1981"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/media\/1976"}],"wp:attachment":[{"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/media?parent=261"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/categories?post=261"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.waseda.jp\/fsci\/ict-robotics\/wp-json\/wp\/v2\/tags?post=261"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}