| Y. Sugita, H. Masuhara, and K. Harada. An e#cient implementation of a reflective language using a dynamic code generation technique. In Proceedings of the JSSST SIGOOC 1998 Workshop on Systems for Programming and Applications (SPA'98), Mar. 1998. Japan Society for Software Science and Technology (JSSST). (In Japanese). |
....in the first and fourth templates that save recover registers. In fact, our micro benchmark in Section 7 shows that the RTS version is approximately threefold slower than the PE version. In addition, our previous work show that RTS versions have approxmately 40 overheads in more practical examples[24, 25]. 2.3.2 Portability Another problem of RTS is its strongly dependency on the target language and on the target machine architecture. The BTA algorithms are dependent on the semantics of the source level language. In addition, we need to access internals of a compiler in order to obtain templates ....
Y. Sugita, H. Masuhara, and K. Harada. An e#cient implementation of a reflective language using a dynamic code generation technique. In Proceedings of the JSSST SIGOOC 1998 Workshop on Systems for Programming and Applications (SPA'98), Mar. 1998. Japan Society for Software Science and Technology (JSSST). (In Japanese).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC