Partial evaluation in parallel

Partially evaluating a procedural program amounts to building a series of mutually-recursive specialized procedures. When a procedure call in the source program gets specialized into a residual call, the called procedure needs to be processed to occur in the residual program. Because the order of procedure definitions in the residual program is immaterial, it does not matter in which order these two events — building the residual call and building the residual procedure — are scheduled. Therefore, partial evaluation offers a basic opportunity for an MIMD type of parallelism with shared global memory where in essence, the mutually-recursive specialized procedures are built in parallel as specialization points are met and the relation binding source and residual procedures is globalized, to preserve its uniqueness.We have translated a sequential partial evaluator written in T (a dialect of Scheme) into Mul-T (a parallel extension of T) by adding one semaphore with each specialization point and one future to construct the residual procedure in parallel with the current specialization. The resulting parallel partial evaluator has been observed to be faster than the sequential one in proportion to the size of the source program and to the number of specialized procedures in the residual program.Our sequential partial evaluator is self-applicable. Because the semaphores and the future are run-time operations, our parallel partial evaluator is still self-applicable. In principle it can be and in practice we have used it to generate parallel compilers, i.e., specializers dedicated to an interpreter and processing its static and dynamic semantics in parallel, non trivially. Again, parallelism in dedicated specializers is determined by the size of the source program and the number of specialized procedures in the residual program.This work was supported by Darpa under Grant N00014-88-k-0573.This work was carried out during a summer visit to Yale University in 1990. This paper was written at Kansas State University and completed during a spring visit at Carnegie Mellon University in 1993.     

A portable approach to dynamic optimization in run-time specialization

This paper proposes arun-time bytecode specialization (BCS) technique that analyzes programs and generates specialized programs at run-time in an intermediate language. By using an intermediate language for code generation, a back-end system canoptimize the specialized programs after specialization. The system uses Java virtual machine language (JVML) as the intermediate language, which allows the system to easily achieve practicalportability and to use existing sophisticated just-in-time (JIT) compilers as its back-end. The binding-time analysis algorithm is based on a type system, and covers a non-object-oriented subset of JVML. The specializer generates programs on a per-instruction basis, and can performmethod inlining at run-time. Our performance measurements show that a non-trivial application program specialized at run-time by BCS runs approximately 3–4 times faster than the unspecialized one. Despite the large overhead of JIT compilation of specialized code, we observed that the overall performance of the application can be improved. This paper is an extended version of “A Portable Approach to Generating Optimized Specialized Code”, inProceedings of Second Symposium on Programs as Data Objects (PADO-II), Lecture Notes in Computer Science, vol. 2053, pp. 138–154, Aarhus, Denmark, May 2001.²³) Hidehiko Masuhara, D.Sc.: He is an Assistant Professor at Department of Graphics and Computer Science, Graduate School of Arts and Sciences, University of Tokyo. He received his B.S., M.S. and D.Sc. degrees from Department of Information Science, University of Tokyo in 1992, 1994, and 1999, respectively. His research interests are in programming languages, especially in mechanisms to support flexible and efficient computation such as dynamic optimization and reflection. He received the best-paper award from Information Processing Society of Japan in 1996. Akinori Yonezawa, Ph.D.: He is a Professor of computer science at Department of Computer Science, University of Tokyo. He received Ph.D. in Computer Science from the Massachusetts Institute of Technology in 1977. His current major research interests are in the areas of concurrent/parallel computation models, programming languages, object-oriented computing, and distributed computing. He is the designer of an object-oriented concurrent language ABCL/1 and the editor of several books and served as an associate editor of ACM Transaction of Programming Languages and Systems (TOPLAS). Since 1998, he has been an ACM Fellow.     

教育知识管理视域下的教师专业化发展

学校是知识的源生地,教育本身是一个知识管理领域,教师是学校的灵魂,因此将教育知识管理的理念与方法引入到教师专业化发展中,对教师的专业成长具有重要的现实意义。此研究主要讨论如何将教育知识管理的理念与方法融入到教师的专业化发展中,在此基础上提出教师专业化发展的对策,尤其是学习型组织的构建,对教师的专业化发展具有增智、增能的作用。     

How do we capture “Global Specialization” when measuring firms’ degree of globalization?

Abstract and Key Results

Oracle-Based Partial Evaluation

We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an oracle function which compares the results of specializing such call pattern w.r.t. a set of strategies. Our proposal is motivated by Poly-Controlled Partial Evaluation (PCPE), which allows using different control strategies for different call patterns. Given a set of control strategies, the best PCPE specialized programs outperform the specialized programs obtained by traditional PE for any of the control strategies in , especially when resource-aware specialization is performed. Unfortunately, computing all PCPE specialized programs and then choosing a posteriori the best one is too costly in practice. In contrast, in OBPE a single specialized program is computed. We have developed an empirical oracle whose parameters are approximated from a set of training data, by using constraint logic programming. Our experimental results show that the additional cost of OBPE when compared with traditional PE is a constant factor and that, at least in our experiments, OBPE obtains significantly better specializations. We argue that our proposal is relevant in practice and introduces clear improvements over standard PE. Our work is developed in the context of logic programs, though the ideas are in principle of interest to the PE of any programming language.     

Enriching the ER model based on discovered association rules

The entity-relationship (ER) model, a powerful means for business and data modeling, needs to be enriched with new semantics as the real world changes and its understanding improves. This paper attempts at enriching the ER model based on association rules (AR) discovered from large databases by introducing specializations and sub-types into the ER model. The proposed framework is extended to deal with more general, flexible and linguistic knowledge in fuzzy association rules. Moreover, transforming an AR-enriched-ER (AR-EER) schema to a relational database (RDB) schema is also investigated.     

基于Concept—Relation模型的知识联通

1 引言 Johnson认为知识不是孤立的而是互相联系的,认知学指出思维过程体现为相关知识间的连接过程。那么如何在相关的知识之间建立联通?如何判定两条知识之间是否存在有意义的联通?又如何建立有意义的联通?这是知识处理中很重要的问题。形象地讲,知识联通就是在知识之间建立有意义的“由此及彼”的桥梁。总体上说,从知识工程角度看,要提高机器的智能程度需要知识间广泛的知识联通;从认知和语义学角度讲,知识联通是可行的。另外,Johnson的三阶段     

依附性实验室的独立化改造

高校实验依附于教学和科研，其使命与功能之间不可避免地存在着一种结构性的冲突，既浪费了大量的实验资源，又无法满足教学和科研对实验的需求。适应专业分工和规模经济的要求，只有将依附性的高校实验室改造为独立性的高校实验室，才能充分发挥高校实验的服务功能，提高其运行效率。     

登山客游憩专门化及登山用品专案设计探讨

针对登山客游憩专门化探讨一般登山客与专业登山客在游憩专门化、场地依附、环境知识、环境责任的区别。以减少登山危险事件的发生。研究结果将区分出。一般登山客与专业登山客的属性区别,有助于使登山客了解自身的专业廑,降低登山风险。另外,将利用研究结果,以感性设计方法,设计一款能降低登山风险的产品设计,期待更能将研究结果完整呈现。     

关于改进铸造生产秩序提高机械产品在国际市场上竞争能力的建议

铸件是机械产品中的基础零部件，铸件不过关，很难设想能做出国际水准的第一流机械产品。针对当前铸造生产中存在的主要问题，提出五点建议。