๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An architecture for generic extensions

โœ Scribed by Cosmin E. Oancea; Stephen M. Watt


Book ID
104091997
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
507 KB
Volume
76
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

โœฆ Synopsis


We examine what is necessary to allow generic libraries to be used naturally in a multilanguage, potentially distributed environment. Language-neutral library interfaces usually do not support the full range of programming idioms that are available when a library is used natively. We investigate how to structure the language bindings of the neutral interface to achieve a better expressibility and code re-use. We furthermore address how language-neutral interfaces can be extended with import bindings to recover the desired programming idioms. We also address the question of how these extensions can be organized to minimize the performance overhead that arises from using objects in manners not anticipated by the original library designers. Our approach is to treat a library as a software component and to view the problem as one of component extension. We use C++ as an example of a mature language, with libraries using a variety of patterns, and use the Standard Template Library as an example of a complex library for which efficiency is important. By viewing the library extension problem as one of component organization, we enhance software composibility, hierarchy maintenance and architecture independence.


๐Ÿ“œ SIMILAR VOLUMES


Generic Polynomials for Q8-, QC-, and QQ
โœ Arne Ledet ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

We produce a description of Galois extensions with Galois group Q , QC, or 8 QQ, suitable for constructing generic polynomials.

Generic VLSI architecture for block-matc
โœ Zhong L. He; Ming L. Liou; Philip. C. H. Chan; C. Y. Tsui ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 403 KB

In this article, a generic VLSI architecture which is both a switch network to implement two block-matching motion estiprogrammable and scalable is proposed for block-matching motion mation algorithms: namely, full-search and three-step search, estimation algorithms. Various motion estimation algori