GitHub - yrnkrn/zapcc: zapcc is a caching C++ compiler based on clang, designed to perform faster compilationsYou signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
OpenXLA Project
Send feedback XLA Stay organized with collections Save and categorize content based on your preferences. XLA (Accelerated Linear Algebra) is an open-source compiler for machine learning. The XLA compiler takes models from popular frameworks such as PyTorch, TensorFlow, and JAX, and optimizes the models for high-performance execution across different hardware platforms including GPUs, CPUs, and ML
Prepack · Partial evaluator for JavaScript
*Prepack is still in an early development stage and not ready for production use just yet. Please try it out, give feedback, and help fix bugs. What does it do? Prepack is a tool that optimizes JavaScript source code: Computations that can be done at compile-time instead of run-time get eliminated. Prepack replaces the global code of a JavaScript bundle with equivalent code that is a simple sequen
Numba — Numba
Numba makes Python code fast Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code. Learn More Try Numba » Accelerate Python Functions Numba translates Python functions to optimized machine code at runtime using the industry-standard LLVM compiler library. Numba-compiled numerical algorithms in Python can approach the speeds of C or FORTRAN.
AdaGradãŒ12å€é€Ÿããªã‚‹é”法
AdaGradã¯å¦ç¿’率を自動調整ã—ã¦ãれる勾é…法ã®äºœç¨®ã§ã€ã„ã‚ã‚“ãªäººãŒçµ¶è³›ã—ã¦ã„ã¾ã™ã€‚ 勾é…を足ã—込む時ã«ã€å„次元ã”ã¨ã«ä»Šã¾ã§ã®å‹¾é…ã®2乗和をã¨ã£ã¦ãŠã„ã¦ã€ãã®å¹³æ–¹æ ¹ã§å‰²ã£ã¦ã‚ã’ã‚‹ã ã‘ã¨ã€æã‚ã—ãシンプルã§ã™ã€‚ Adaptive Subgradient Methods for Online Learning and Stochastic Optimization John Duchi, Elad Hazan, Yoram Singer. JMLR 2011. ä¸åº¦ã€ @echizen_tm ã•ã‚“ãŒãƒ–ãƒã‚°ã‚’書ã„ã¦ã¾ã—ãŸã€‚ AdaGrad+RDAを実装ã—ã¾ã—ãŸã€‚ 通常ã®SGDãªã©ã¯å¦ç¿’率をã ã‚“ã ん減衰ã•ã›ãªãŒã‚‰å‹¾é…を足ã—ã¦ã„ãã‚ã‘ã§ã™ãŒã€ã©ã®æ§˜ã«æ¸›è¡°ã•ã›ã‚‹ã‹ã¨ã„ã†å•é¡Œã«ã„ã¤ã‚‚é ã‚’æ‚©ã¾ã›ã¾ã™ã€‚ AdaGradã§ã¯æœ€åˆã®å¦ç¿’率ã“ã外ã‹ã‚‰ä¸Žãˆã¾ã™ãŒã€æ¸›è¡°ã®ã•ã›æ–¹ã‚„減衰率ã¨ã„ã£ãŸãƒã‚¤ãƒ‘ーパラメータã‹ã‚‰
JSX 速ã•ã®ç§˜å¯† - 高速ãªJavaScriptを書ã方法
JavaScript ã§é«˜é€Ÿãªã‚³ãƒ¼ãƒ‰ã‚’書ã“ã†ã¨ã™ã‚‹éš›ã«ã€ã¯ã¾ã‚ŠãŒã¡ãªç½ ã¨ã€JSX ã®ã‚³ãƒ³ãƒ‘イラã§ã©ã®ã‚ˆã†ã«å¯¾å‡¦ã—ã¦ã„ã‚‹ã®ã‹ã‚’紹介
restrictã‚ーワード - yohhoyã®æ—¥è¨˜
C99ã§è¿½åŠ ã•ã‚ŒãŸ restrict ã‚ーワードã«ã¤ã„ã¦ã®ãƒ¡ãƒ¢ã€‚ コンパイラã«å¯¾ã—ã¦ã€ŒaliasãŒå˜åœ¨ã—ãªã„ã¨ä»®å®šã—ãŸæœ€é©åŒ–を許ã™ã€ã¨ä¼ãˆã‚‹ãŸã‚ã®ã‚ーワード。C99以é™ã§ã®ã¿æœ‰åŠ¹ãªã‚ーワードã§ã‚ã‚Šã€C++11ç¾åœ¨ã§ã‚‚C++ã«ã¯åŒã‚ーワードãŒå˜åœ¨ã—ãªã„。（ãŸã ã—コンパイラã®ç‹¬è‡ªæ‹¡å¼µã¨ã—ã¦ã€C++言語ã§ã‚‚restirctã‚ーワードを使ãˆã‚‹ã‚±ãƒ¼ã‚¹ã¯ã‚る。） è¦ç´„： 構文的ã«ã¯constã‚„volatileã‚ーワードã¨åŒåˆ—ã§ã€ãƒã‚¤ãƒ³ã‚¿åž‹ã«å¯¾ã—ã¦ã®ã¿åž‹ä¿®é£¾ã‚’è¡Œãˆã‚‹ã€‚int * restrictãªã©ã€‚restrict intã‚„int restrict *ã¯ill-formed*1。 コンパイラã§ã®æœ€é©åŒ–を助ã‘ã‚‹ãŸã‚ã®ã‚‚ã®ã€‚restrictã‚ーワードを削除ã—ã¦ã‚‚プãƒã‚°ãƒ©ãƒ ã®æ„味ã¯å¤‰åŒ–ã—ãªã„。 用法ã¨æ„味 restrictã‚ーワードã®ç”¨æ³•ã¯ã€C標準ライブラリmemcpy関数ï¼memmove関数ã«ãŠã‘る動作仕
)
Aliasing (computing) - Wikipedia
For the term used in signals processing and computer graphics, see Aliasing. For aliasing in statistical design, see Aliasing (factorial experiments). For the command, see Alias (command). In computing, aliasing describes a situation in which a data location in memory can be accessed through different symbolic names in the program. Thus, modifying the data through one name implicitly modifies the
JIT ã®è©±ã‚ã‚Œã“ã‚Œ
Egtra (ysk-noh) @egtra @phoenixstarhiro Javaãªã‚“ã‹ã¯çŠ¶æ³æ¬¡ç¬¬ã§C++より速ã„ã®ã§ã¯ãªã„ã§ã—ょã†ã‹ï¼Ÿå®Ÿè¡Œæ™‚ã«ã—ã‹åˆ†ã‹ã‚‰ãªã„æƒ…å ±ã‚’ä½¿ã£ã¦JITã§æœ€é©åŒ–ã—ãŸã‚Šã€GCã‚ã‚Šã§ãƒ¡ãƒ¢ãƒªç¢ºä¿ã‚‚速ãã§ããŸã‚Šã™ã‚‹ã—（ãã‚Œã¨ã‚‚Javaã¯æœ€è¿‘èžã言語ã«å…¥ã‚‰ãªã„ã£ã¦ï¼Ÿï¼‰ ã·ã‚Šã‚“大王・鰹節大臣(兼任) @phoenixstarhiro . @egtra ã†ã‚ã€ã™ã¿ã¾ã›ã‚“。通知ãŒãªãæ°—ã¥ãã¾ã›ã‚“ã§ã—ãŸãƒ»ãƒ»ãƒ»ã€‚ä¸å‹‰å¼·ã§æ縮ã§ã™ãŒã€ç¾åœ¨ã®JITã§ãƒã‚¤ãƒ†ã‚£ãƒ–コードより速ããªã‚‹ã‚±ãƒ¼ã‚¹ã£ã¦çµæ§‹ã‚ã‚‹ã‚‚ã®ãªã‚“ã§ã—ょã†ã‹ï¼Ÿ GCã¯ãƒ¡ãƒ¢ãƒªã®å›žåŽã«æ™‚é–“ãŒã‹ã‹ã‚‹ã®ã§ã€å¹³å‡çš„ã«ã¯ãƒžã‚¤ãƒŠã‚¹ã ã¨æ€ã†ã®ã§ã™ãŒã€ã„ã‹ãŒã§ã—ょã†ã‹ï¼Ÿ Shuhei Takahashi @nya3jp JIT ã¯å®Ÿè¡Œæ™‚æƒ…å ±ã‚’ä½¿ã£ã¦æœ€é©åŒ–ã§ãã‚‹ã‹ã‚‰é™çš„コード生æˆã‚ˆã‚Šé€Ÿã„コードをåã‘ã‚‹ã“ã¨ãŒã‚るよã€ã¨ã„ã†è©±ã¯ã‚ˆãèžãã—ã‚‚ã£ã¨ã‚‚ã ã¨æ€
Cilk Plus/LLVM
View on GitHub Cilk Plus/LLVM An implementation of the Intel® Cilk™ Plus C/C++ language extensions in LLVM Intel® Cilk™ Plus is an extension to the C and C++ languages to support data and task parallelism. It is one of the easiest, quickest way to harness the power of both multicore and vector processing. Visit cilkplus.org for details. This project implements the Intel® Cilk™ Plus language extens
Partial-redundancy elimination - Wikipedia
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (May 2015) (Learn how and when to remove this template message) In compiler theory, partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necess
mirichiã®æ—¥è¨˜
「シミュレーションã•ã‚ŒãŸå®‡å®™ãŒã‚ã£ãŸã¨ã—ã¦ã€ãã®ä¸ã®ç”Ÿç‰©ãŒåˆ¥ã®å®‡å®™ã‚’シミュレーションã™ã‚‹ã€‚ãã—ã¦ãã®ä¸ã®ç”Ÿç‰©ãŒã¾ãŸåˆ¥ã®å®‡å®™ã‚’シミュレーションã—…ã“ã®é–¢ä¿‚ã¯ç„¡é™ã«ç¶šãã¨è€ƒãˆã‚‰ã‚Œã‚‹ã€‚我々ã®å®‡å®™ãŒã“ã®é€£éŽ–ã®ä¸ã«å«ã¾ã‚Œã¦ã„ãªã„ã¨ã„ã†ã»ã†ãŒä¸è‡ªç„¶ã§ã‚ã‚‹ã€ãªã‚“ã¦è¨€ã£ãŸã®ã¯èª°ã ã£ãŸã‹ã€‚çªã£è¾¼ã¿ã©ã“ã‚ã¯å¤šã™ãŽã ã‘ã©ã‚‚ã¡ã‚‡ã£ã¨é¢ç™½ã‹ã£ãŸã‹ãªã€‚ éžå¸¸ã«å¯’ã„æ—¥ãŒç¶šã„ã¦ã„ã‚‹ã‘ã©ã¨ã‚Šã‚ãˆãšDXRuby1.4.7をリリース。ç¾æ™‚点ã§Ruby2.5ãŒã‚µãƒãƒ¼ãƒˆã•ã‚Œã¦ã„る関係上ã€å¯¾å¿œã™ã‚‹Rubyã¯2.5～3.0ã¨ã—ã¦ã‚る。機能的ã«ã¯å¤‰æ›´ç„¡ã—。 大ããªãƒã‚¤ãƒ³ãƒˆã¯Ruby2.6～3.0ã§64bit版ã«å¯¾å¿œã—ãŸæ‰€ã§ã€Ruby2.5ã ã‘ãªãœã‹DXRubyãŒã‚³ã‚±ã‚‹ç—‡çŠ¶ãŒå‡ºãŸã®ã§2.5ã ã‘ã¯32bitã®ã¿ã¨ãªã£ã¦ã„る。ã™ãサãƒãƒ¼ãƒˆåˆ‡ã‚Œã‚‹ã—ã¾ã‚ã„ã„ã‹ã€ã¨ã„ã†æ„Ÿã˜ã§ã€‚3.0ã§å‹•ãよã†ã«ã¯ãªã£ã¦ã‚‹ã‘ã©ã‚‚ã€Ractorã«ã¯å¯¾å¿œã—ã¦ã„ãªã„。構é€
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
CSE 231
{{#tags}}- {{label}}
{{/tags}}