A Library of Parallel Algorithms
A Library of Parallel Algorithms This is the toplevel page for accessing code for a collection of parallel algorithms. The algorithms are implemented in the parallel programming language NESL and developed by the Scandal project. For each algorithm we give a brief description along with its complexity (in terms of asymptotic work and parallel depth). In many cases the NESL code is set up so you ca
生物データベース論（並列分散計算フレームワーク）
2014å¹´7月5æ—¥ã«è¡Œã‚ã‚ŒãŸOSCåå¤å±‹ã€åŠã³2014å¹´7月12æ—¥ã«ã‚«ãƒ¼ãƒãƒ«/VM探検隊@北陸 1ã§ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã§ã™ã€‚ 楽ã—ã•æ±‚ã‚ã¦ã€ã‚‚ã†ã¡ã‚‡ã£ã¨ã¯ã˜ã‘ã¡ã‚ƒãˆ(ã´ã‚‡ã‚“ã´ã‚‡ã‚“ã¨)
oreilly.com
New! O’Reilly announces launch of the AI Academy. Read now Introducing the AI Academy Help your entire org put GenAI to work Every employee today needs to know how to prompt GenAI, use it to enhance critical thinking and productivity, and more. With the AI Academy they can. For less. O’Reilly AI-powered Answers just got even smarter O’Reilly Answers instantly generates information teams can trust,
ã¯ã˜ã‚ã¦ã®ã«ã(2013-02-15)
_ PTT http://ptt.prosym.jp/arc/388/ タイトルã«é…ã‹ã‚Œã¦ã²ã•ã³ã•ã«è¡Œã£ãŸã‚‰ã€ã™ã”ã„楽ã—ã‹ã£ãŸ! ã¯ã˜ã‚㦠HTM å«ã‚€ TM ã«ä¾¡å€¤ãŒã‚ã‚‹ã¨æ€ãˆã‚‹è©±ã ã£ãŸã€‚未ã ã« STM ã¯ä¿¡ã˜ã¦ãªã„ã‘ã©ã€å¾Œã®å‘‘ã¿ä¼šã§ STM ãŒé€Ÿããªã‚Šã†ã‚‹ã‚±ãƒ¼ã‚¹ã¯ã‚るよんã¨æ•™ãˆã¦ã‚‚らã£ã¦ã€ãªã‚‹ã»ã©ãªãã¨ã‹ãã†ã„ã†ã€‚ ã¡ã‚‡ã†ã©ã‚ˆãã‚ã‹ã£ã¦ãªãã¦ã€ãªã‚“ã¨ãªã知りãŸã„ãªãƒ¼ã¨æ€ã£ã¦ãŸã‚ãŸã‚Šã‚’ã‚ã‹ã‚Šã‚„ã™ãã€ã‹ã¤è©³ã—ãã¯ãªã„ã‘ã©ãªã‚“ã¨ãªã言葉ã¯çŸ¥ã£ã¦ã‚‹ ruby ã®æ–‡è„ˆã§èªžã£ã¦ãã‚ŒãŸã®ã§ã€åƒ•ã«ã¨ã£ã¦ã‚ã‹ã‚Šã‚„ã™ã‚ã§ãƒ©ãƒƒã‚ーã ã£ãŸã¨ã„ã†ã®ã‚‚ã‚ã‚‹ã¨ã¯æ€ã†ã‘ã©ã€ã™ã”ã良ã„話ã ã£ãŸã¨æ€ã†ã€‚後ã§ãƒªã‚¯ã‚¨ã‚¹ãƒˆã—よã†ã¨æ€ã£ã¦ãŸã‘ã©å¿˜ã‚Œã¦ãŸã‚“ã ã‘ã©ã€ç™ºè¡¨è³‡æ–™ã©ã£ã‹ã«ä¸ŠãŒã‚‹ã¨ã„ã„ãªãƒ¼ã€‚ é…ã‚Œã¦è¡Œã£ã¦ã€æœ€åˆã®é ƒã¯ç™ºè¡¨ã‚ˆã‚Š GSL ã£ã¦ã„ㆠSC2 ã®å¤§ä¼šã®ä»Šæ—¥ã®å‹•å‘ã®æ–¹ãŒæ°—ã«ãªã£ã¦ãŸã‘ã©ã€å¾Œã®æ–¹ã¯ GSL ã©ã†ã§ã‚‚よããª
SkeTo
2006-02-04 è¿‘æ³ MapReduce ã®è©±ã‚’èžã„ãŸã‚ã¨, 並列プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ã¤ã„ã¦å¦„想ã—ã¤ã¤ã‚¦ã‚§ãƒ–を徘徊ã—ã¦ã„ãŸã‚‰ 国産㮠"SkeTo" ã¨ã„ã†ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã‚’ã¿ã¤ã‘ãŸ. ç ”ç©¶ã®ä¸€ç’°ã¨ã—ã¦ã¨ã—㦠MPI をラップã™ã‚‹ C++ ã®ãƒ©ã‚¤ãƒ–ラリを作ã£ã¦ã„るらã—ã„. 論文もã„ãã¤ã‹è¿½ã„ã¦ã‚ã‚‹. "助ã£äººï¼šæ§‹æˆçš„ãªä¸¦åˆ—スケルトンã«ã‚ˆã‚‹ä¸¦åˆ—プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ©ã‚¤ãƒ–ラリ" ã¯æ¦‚è¦ãŒã‚³ãƒ³ãƒ‘クトã«ã¾ã¨ã¾ã£ã¦ã„ã¦è‰¯ã„. "A Compositional Framework for Developing Parallel Programs on Two Dimensional Arrays|http://www.ipl.t.u-tokyo.ac.jp/~emoto/metr05-09.pdf" ã¯ã‚‚ã†å°‘ã—ç†è«–ã«è¸ã¿è¾¼ã‚“ã 内容ã«ãªã£ã¦ã„ã‚‹. SkeTo 㯠MPI ã®ä¸Šã«ä½œã‚‰ã‚ŒãŸä¸¦åˆ—計算è¦ã®ãƒ¦ãƒ¼ãƒ†ã‚£ãƒªãƒ†ã‚£
IBMã®æ–°ãƒ¡ã‚¤ãƒ³ãƒ•ãƒ¬ãƒ¼ãƒ ã€å•†ç”¨åˆã®ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒŠãƒ«ãƒ¡ãƒ¢ãƒªæ載ã§Javaを超高速実行。JavaOne 2012
IBMã®ãƒ¡ã‚¤ãƒ³ãƒ•ãƒ¬ãƒ¼ãƒ ã«ã¯Javaを高速ã«å®Ÿè¡Œã™ã‚‹ä»•çµ„ã¿ãŒçµ„ã¿è¾¼ã¾ã‚Œã¦ã„る。JavaOne基調講演ã«ç¶šã„ã¦è¡Œã‚ã‚ŒãŸIBMã®è¬›æ¼”ã§ã¯ã€ãã‚“ãªèˆˆå‘³æ·±ã„技術ãŒç´¹ä»‹ã•ã‚Œã¾ã—ãŸã€‚ ã“ã®ãƒ¡ã‚¤ãƒ³ãƒ•ãƒ¬ãƒ¼ãƒ ã¯8月末ã«ç™ºè¡¨ã•ã‚ŒãŸã°ã‹ã‚Šã®æ–°åž‹ã§ã€1ç体ã§æœ€å¤§10万もã®ä»®æƒ³ã‚µãƒ¼ãƒã‚’実行å¯èƒ½ã¨ã„ã†æ€ªç‰©ã®ã‚ˆã†ãªæ€§èƒ½ã®ãƒžã‚·ãƒ³ã€‚ã“ã‚Œã²ã¨ã¤ã§ãã®è¾ºã®ãƒ‡ãƒ¼ã‚¿ã‚»ãƒ³ã‚¿ãƒ¼ä¸¦ã®æ€§èƒ½ã‚’æŒã¤ã¨ã„ã£ã¦ã‚‚éŽè¨€ã§ã¯ãªã•ãã†ã§ã™ã€‚ ã—ã‹ã‚‚ã€å•†ç”¨ãƒžã‚·ãƒ³ã¨ã—ã¦ã¯åˆã®ãƒãƒ¼ãƒ‰ã‚¦ã‚§ã‚¢ã«ã‚ˆã‚‹ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ãƒ¡ãƒ¢ãƒªã‚’æ載。ランタイム・インストゥルメンテーションãªã©å¤šãã®æ©Ÿèƒ½ã«ã‚ˆã£ã¦Java実行ã®é«˜é€ŸåŒ–を実ç¾ã—ãŸã¨ã®ã“ã¨ã€‚æ¥å‹™ç”¨ã‚¢ãƒ—リケーションを実行ã™ã‚‹ãƒ¡ã‚¤ãƒ³ãƒ•ãƒ¬ãƒ¼ãƒ ã«ã¨ã£ã¦ã€Java性能ãŒé‡è¦ã§ã‚ã‚‹ã“ã¨ã‚’示ã—ã¦ã„るよã†ã§ã™ã€‚ IBMã®è¬›æ¼”ã®ä¸€éƒ¨ã‚’紹介ã—ã¾ã—ょã†ã€‚ 4å¹´å‰ã‹ã‚‰å–り組む IBM Distinguished Engineerã€Java CTOã®Jo
MapReduceã¯ä»Šå¾Œã©ã†ãªã‚‹ã®ã‹ï¼Ÿ - 急ãŒã°å›žã‚Œã€é¸ã¶ãªã‚‰è¿‘é“
2012å¹´ã®ç¾åœ¨ã€å‰²ã¨æ‚©ã‚“ã§ã„ã‚‹ã®ã§ãƒ¡ãƒ¢ã£ã¦ãŠã。 年度末ãらã„ã«å†èª¿æŸ»ã®äºˆå®šã€‚・・ãªã®ã§æš«å®šã§ã™ã‚ˆã€‚ ã¾ãšå‰æã¨ã—ã¦ã€ç¾è¡Œã®Hadoopã®å®Ÿè¡Œãƒ•ãƒ¬ãƒ¼ãƒ ワークã§ã‚ã‚‹MapReduceã¯ã€å®Ÿè¡ŒåŠ¹çŽ‡ã¯æ±ºã—ã¦è‰¯ãã¯ãªã„ã§ã™ã€‚ã“ã®è¾ºãŒå‰²ã¨è¾›ã„。 ã¨ã¯ã„ãˆã€å¤§è¦æ¨¡ä¸¦åˆ—処ç†ã‚’一般的ã«è¡Œã†ã¨ã„ã†è¦³ç‚¹ã§ã®å“質やå–り回ã—を考ãˆãŸå ´åˆã€â€çµæžœã¨ã—ã¦â€éžå¸¸ã«ãƒãƒ©ãƒ³ã‚¹ãŒã¨ã‚Œã¦ãŠã‚Šã€æ™®åŠã—ã¦ã„る。ãã®ä¸Šã§ã€ã“ã®MapReduceã§ã™ãŒã€ä»Šå¾Œã®è¦‹é€šã—ã«ã¤ã„ã¦ã¯ã€æ½®æµã¯ä»Šã®ã¨ã“ã‚二ã¤ã«å‰²ã‚Œã¦ã„るよã†è¦‹ãˆã‚‹ã€‚ã®ã§ã€ãã®è¾ºã®ãƒ¡ãƒ¢ã€‚ â– YARN 一ã¤ã®æ–¹å‘性ã¯ã€ç¾åœ¨ã®Hadoop2.0ç³»ã§å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹MapReduce2.0ã€ã¨ã„ã†ã‹ã€MapReduceã¨ã¯åˆ¥ã®å®Ÿè¡ŒåŸºç›¤ã‚’利用ã™ã‚‹ã¨ã„ã†æ–¹å‘ã§ã™ã。ã™ãªã‚ã¡BSPã‚„ã€MPIを利用ã™ã‚‹ã€‚è¦ã¯ã€ä»Šã¾ã§ã®ä¸¦åˆ—処ç†ã®æˆæžœã‚’ãã®ã¾ã¾åˆ©ç”¨ã—ã¾ã—ょã†ã€ã¨ã„ã†æµã‚Œã«è¿‘ã„。 MapReduce
ä½è—¤ä¸€éƒŽ: Web日記 (2009å¹´) 2009å¹´11月13æ—¥
ã”訪å•ã„ãŸã ã„ãŸãŠå®¢æ§˜ã¸ã®ãŠçŸ¥ã‚‰ã› Information for customers visiting this Web site from SpinNet アクセスã„ãŸã ã„ãŸWebサービスã¯æ供を終了ã„ãŸã—ã¾ã—ãŸã€‚ é•·å¹´ã«ã‚ãŸã‚Šã€å¤šãã®çš†æ§˜ã«ã”利用ã„ãŸã ãã¾ã—ãŸã“ã¨ã‚’心よりãŠç¤¼ç”³ã—上ã’ã¾ã™ã€‚ SpinNetトップページ㸠The Web service you are trying to access has been terminated. We would like to thank all of you for your patronage over the years. Go to the SpinNet
Block Cyclic Data Distribution - 最é©åŒ–å•é¡Œã«å¯¾ã™ã‚‹è¶…高速＆安定計算
ScaLAPACK ã§ä½¿ç”¨ã—ã¦ã„ã‚‹ two-dimensional block-cyclic data layout ã«ã¤ã„ã¦ã¯ä»¥ä¸‹ã®ã‚µã‚¤ãƒˆãŒå‚考ã«ãªã‚‹ã€‚ The Two-dimensional Block-Cyclic Distribution The Two-dimensional Block-Cyclic Distribution　ã®ä¸€èˆ¬çš„ãªèª¬æ˜Žã«ã¤ã„㦠Local Storage Scheme and Block-Cyclic Mapping 直接 The Two-dimensional Block-Cyclic Distribution ã®é…列ã«å€¤ã‚’代入ã™ã‚‹ã¨ãã«ã€ãã®é…列ã®å…·ä½“çš„ãªè¦ç´ 番å·ã‚’知るãŸã‚ã«å¿…è¦ãªæƒ…å ±ã«ã¤ã„㦠Block Cyclic Data Distribution 以下ã®æƒ…å ±ã‚’å…¥åŠ›ã™ã‚‹ã¨ã€The table lists the data on each proc
連載講座: 高生産並列言語を使ã„ã“ãªã™(1)
Contents 1 ã¯ã˜ã‚ã« 1.1 背景 1.2 高水準言語ã®å¿…è¦æ€§ã¨å¥½æ©Ÿ 1.3 本連載ã«ã¤ã„㦠1.4 本稿ã®æ§‹æˆ 2 並列言語・ライブラリã®åˆ†é¡žè»¸ 2.1 並列性ã®è¨˜è¿°æ–¹æ³•ã«ã‚ˆã‚‹åˆ†é¡ž 2.2 データã®ã‚¢ã‚¯ã‚»ã‚¹æ–¹æ³•ãƒ»è¦–点ã«ã‚ˆã‚‹åˆ†é¡ž 3 ã¾ã¨ã‚ã¨å±•æœ› Bibliography 1 ã¯ã˜ã‚ã« 1.1 背景 ç¾åœ¨, 並列処ç†ã‚’è¡Œã†ãŸã‚ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ–¹æ³•ã¨ã—ã¦ã¯, 1ノード内ã®å…±æœ‰ãƒ¡ãƒ¢ãƒªã‚’å‰æã¨ã—ãŸä¸¦åˆ—処ç†ã«é™ã‚Œã°OpenMP [3,5,21,22]ãŒ, 複数ノードã«ã¾ãŸãŒã‚‹ä¸¦åˆ—処ç†ã«å¯¾ã—ã¦ã¯MPI [13,18,23]ãŒæœ€ã‚‚広ã用ã„られã¦ã„ã‚‹. ãれらã®ã€ŒæˆåŠŸã€ã¨é–¢ä¿‚ã—ã¦ã„ã‚‹ã¨æ€ã‚れる特徴をã‚ã’ã‚‹ã¨ä»¥ä¸‹ãªã©ãŒæŒ™ã’られよã†. æ–°ã—ã„プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã¯ãªã, æ—¢å˜ã®ä¸»æµè¨€èªž(C言語やFortran) ã®å°è¦æ¨¡ãªæ‹¡å¼µã‚„ライブラリã¨ã—ã¦æä¾›ã•ã‚Œã¦ã„ã‚‹. 並列処ç†ã®è¨˜è¿°æ–¹æ³•ã¯ãƒ¦ãƒ¼ã‚¶ãƒ•ãƒ¬ãƒ³ãƒ‰ãƒª
Asakusa Framework — Asakusa Framework v0.2.6-r1 documentation
Asakusa Framework¶ Asakusa Frameworkã¯åˆ†æ•£å‡¦ç†æŠ€è¡“ã‚’æ´»ã‹ã—ãŸãƒãƒƒãƒã‚¢ãƒ—リケーションを開発ã™ã‚‹ãŸã‚ã®ãƒ•ãƒ¬ãƒ¼ãƒ ワークã§ã™ã€‚ 主ã«ã€æ¥å‹™ã‚·ã‚¹ãƒ†ãƒ ãªã©ã®åˆ†é‡Žã§ã®åˆ©ç”¨ã‚’想定ã—ã€ãƒ†ã‚¹ãƒˆæ©Ÿæ§‹ã€å¤–部システム連æºã€é‹ç”¨ã‚·ã‚¹ãƒ†ãƒ 連æºãªã©ã®æ©Ÿèƒ½ã‚’æä¾›ã—ã¦ã„ã¾ã™ã€‚ ã“ã®ã‚µã‚¤ãƒˆã«ã¤ã„ã¦Â¶ ã“ã®ã‚µã‚¤ãƒˆã§ã¯ã€Asakusa Frameworkã®é–‹ç™ºé‹ç”¨æ™‚ã®åˆ©ç”¨æ–¹æ³•ã‚„ã€ãƒ•ãƒ¬ãƒ¼ãƒ ワーク内部ã®æŠ€è¡“çš„ãªæƒ…å ±ã‚’æä¾›ã—ã¾ã™ã€‚ Asakusa Frameworkã®é©ç”¨äº‹ä¾‹ãªã©ã«ã¤ã„ã¦ã¯ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£ã‚µã‚¤ãƒˆ (http://asakusafw.com) ã‚‚å‚考ã«ã—ã¦ãã ã•ã„。
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - stanford-ppl/Green-Marl: A DSL for efficient Graph Analysis
Transactional Memory Bibliography
Data Distributions and Software Conventions
dblp: Guojing Cong
Page Personnelle de Philippe Gaucher
Peter Bubenik's home page
https://www.worldscientific.com/doi/abs/10.1142/S0129626412400075
iProject PaPDAS: Parallel Program Development with Algorithmic Skeletons
Ashish Agarwal
{{#tags}}- {{label}}
{{/tags}}