An Overview of Reflective Middleware

Du Zhao; Wang Xiaoge; Chen Yu

Journal of Computer Research and Development > 2005 > 42(12): 2041-2047.

Du Zhao, Wang Xiaoge, Chen Yu. An Overview of Reflective Middleware[J]. Journal of Computer Research and Development, 2005, 42(12): 2041-2047.

Citation:

Du Zhao, Wang Xiaoge, Chen Yu. An Overview of Reflective Middleware[J]. Journal of Computer Research and Development, 2005, 42(12): 2041-2047.

Citation:

Du Zhao, Wang Xiaoge, Chen Yu. An Overview of Reflective Middleware[J]. Journal of Computer Research and Development, 2005, 42(12): 2041-2047.

PDF (313 KB)

An Overview of Reflective Middleware

1(Department of Computer Science & Technology, Tsinghua University, Beijing 100084) 2(Research Institute of Information Technology, Tsinghua University, Beijing 100084)

More Information

Published Date: December 14, 2005

Graphical Abstract

Abstract

Abstract

As the increase of the amount and diversity of distributed applications, middlewares are expected to be flexible, adaptive and context-aware. Reflection allows a program to access, reason about and alter its own interpretation, thus making it possible to build middlewares which can meet the requirements above. First, detailed information about computational reflection is presented: its origin, definition, related concepts and applications. Then reflective middleware and component technology are explained. In the following section, several selected research projects are introduced in order to show different ways people have used to construct reflective middlewares. Finally, some suggestions for future work are made.
- middleware,
- computational reflection,
- component technology,
- context-aware

FullText(HTML)

References (0)

[1]	Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
[2]	Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
[3]	Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
[4]	Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
[5]	Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
[6]	Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
[7]	Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
[8]	Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
[9]	Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
[10]	Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.