Lei Xu

Lei Xu

Auto-generated profile, based on publicly available information

Lei Xu

Nanjing University, State Key Laboratory for Novel Software Technology, Nanjing, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2022 in Science of Computer Programming
Verified
Journal Article
Closed access
QZQiang Zhang
Qiang Zhang
LXLei Xu
Lei Xu
XZXiangyu Zhang
Xiangyu Zhang
BXBaowen Xu
Baowen Xu

20 November 2018
Verified
Book Chapter
Closed access
PDF file
JZJingyi Zhang
Jingyi Zhang
LXLei Xu
Lei Xu
YLYanhui Li
Yanhui Li

1 July 2010
Verified
Conference Paper
Closed access
LXLei Xu
Lei Xu
BJBrendan Jennings
Brendan Jennings
An attractive business model for service brokers and aggregators is the creation of composite services built from services offered by third parties. These providers generate profits by charging their customers a premium above the charges they themselves pay to the third party providers. When multiple providers offer services with the same or similar functional and non-functional properties, selecting services with lowest associated costs is clearly beneficial. However, this is not a trivial task when, as is often the case, third party providers have complex service charging models incorporating discounts based on the context in which their service is used. This context can refer to, for example, which other services a service is composed with, or the time interval in which the service is invoked. We present a service selection algorithm that takes into account time-sensitive intra and inter provider discounts which serves to minimize the expected cost to the service aggregator of offering a composite service within a specified time interval.

16 September 2019
Verified
Book Chapter
Closed access
PDF file
HZHeng Zhao
Heng Zhao
JCJing Chen
Jing Chen
LXLei Xu
Lei Xu

5 September 2023 in Software: Practice and Experience
Verified
Journal Article
Closed access
QZQiang Zhang
Qiang Zhang
LXLei Xu
Lei Xu
BXBaowen Xu
Baowen Xu

16 December 2022 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
QZQiang Zhang
Qiang Zhang
LXLei Xu
Lei Xu
BXBaowen Xu
Baowen Xu
Interpreters are widely used in the implementation of many programming languages, such as Python, Perl, and Java. Even though various JIT compilers emerge in an endless stream, interpretation efficiency still plays a critical role in program performance. Does a stack-based interpreter or a register-based interpreter perform better? The pros and cons of the pair of architectures have long been discussed. The stack architecture is attractive for its concise model and compact bytecode, but our study finds that the register-based interpreter can also be implemented easily and that its bytecode size only grows by a small margin. Moreover, the latter turns out to be appreciably faster. Specifically, we implemented an open source Python interpreter named RegCPython based on CPython v3.10.1. The former is register based, while the latter is stack based. Without changes in syntax, Application Programming Interface, and Application Binary Interface, RegCPython is excellently compatible with CPython, as it does not break existing syntax or interfaces. It achieves a speedup of 1.287 on the most favorable benchmark and 0.977 even on the most unfavorable benchmark. For all Python-intensive benchmarks, the average speedup reaches 1.120 on x86 and 1.130 on ARM. Our evaluation work, which also serves as an empirical study, provides a detailed performance survey of both interpreters on modern hardware. It points out that the register-based interpreters are more efficient mainly due to the elimination of machine instructions needed, while changes in branch mispredictions and cache misses have a limited impact on performance. Additionally, it confirms that the register-based implementation is also satisfactory in terms of memory footprint, compilation cost, and implementation complexity.