• 検索結果がありません。

Ruby処理系のコンパイル済みコードの設計

N/A
N/A
Protected

Academic year: 2021

シェア "Ruby処理系のコンパイル済みコードの設計"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)情報処理学会論文誌. プログラミング. Vol.9 No.2 1 (May 2016). 発表概要. Ruby 処理系のコンパイル済みコードの設計 笹田 耕一1,a). 松本 行弘1,b). 2015年11月5日発表. Ruby 処理系(Ruby 2.2)は,Ruby プログラムをスタックマシン型仮想機械(VM)の命令列にコンパ イルし実行する.実行時にコンパイルするため,変換に時間がかかる,という問題がある.また,複数の プロセスで命令列を共有することが難しいため,マルチプロセス環境で多くのメモリを消費してしまう, という問題がある.これらの問題を解決するため,事前に Ruby プログラムをコンパイル済みコードに変 換し,利用するための仕組みを検討している.本発表では,検討中のコンパイル済みコードの設計につい て紹介する.. Design of Compiled Code on Ruby Interpreter Koichi Sasada1,a). Yukihiro Matsumoto1,b). Presented: November 5, 2015. Ruby interpreter (Ruby 2.2) compiles Ruby programs into instrunction sequences for a stack-based virtual machine. Because compilation is done at runtime, it can be an overhead. It is difficult to share Instruction sequences with multiple processes, there are memory consumption problem with multi Ruby processes. To problems these overcome, we are considering about features to compile Ruby program in advance and to use compiled code. In this presentation, we will show you about current design of compiled code.. 1 a) b). Heroku, Inc., Chiyoda, Tokyo 100–7012, Japan ko1@heroku.com matz@heroku.com. c 2016 Information Processing Society of Japan . 1.

(2)

参照

関連したドキュメント

We present a tail inequality for suprema of empirical processes generated by vari- ables with finite ψ α norms and apply it to some geometrically ergodic Markov chains to derive

Baruah, Bora, and Saikia [2] also found new proofs for the relations which involve only the G¨ollnitz-Gordon functions by using Schr¨oter’s formulas and some theta-function

Skew orthogonal tableaux are the combinatorial objects analogous to the admissible skew tableaux introduced by Sheats in [16] for type C.. To overcome this problem we are going to

In Theorem 4.2 we prove, given existence and uniqueness of so- lutions, the strong Markov property for solutions of (1.1), using some abstract results about local martingale

In Definition 2.4 the class of processes with wide-sense stationary increments is defined and the spectral representation is given in Theorem 2.7.. This representation is stated

This is demonstrated in establishing Theorem 6.1, a quenched version of the results of Cern´ ˇ y [8] and Cabezas [7] on the tail of the exit time distribution, and we then extend

We investigate a version of asynchronous concurrent process calculus based on linear logic. In our framework, formulas are identified with processes and inference rules are

We consider the new class of the Markov measure-valued stochastic processes with constant mass.. We give the construction of such processes with the family of the probabilities