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

An efficient and flexible C++ library for concurrent programming

โœ Scribed by Agostino Poggi; Giovanni Rimassa


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
221 KB
Volume
28
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

โœฆ Synopsis


A major problem for the integration of concurrency in object-oriented languages is the so-called inheritance anomaly, i.e. the conflicts between inheritance and concurrency that often cause the need to redefine inherited methods in order to maintain the integrity of objects. Several solutions have been proposed for resolving these conflicts. However, some of them are incomplete, and do not solve all types of inheritance anomaly; others make the definition of classes complex and/or their implementation inefficient. This paper describes a C ++ library for concurrent programming that provides a comprehensive framework particularly suitable for coarse-grained distributed applications. This library copes with the inheritance anomaly problem, presenting a solution that minimizes the redefinition of inherited methods without increasing the complexity to write them. This solution is based on the use of a special set of methods, called interface methods, composed of a body and two sets of synchronization constraints. These two sets of synchronization constraints are respectively used to enable the execution of their method body and to disable the methods that cannot be executed after their method.


๐Ÿ“œ SIMILAR VOLUMES


Features from functional programming for
โœ H. Kuchen; J. Striegnitz ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 193 KB ๐Ÿ‘ 1 views

## Abstract Message passing based on libraries such as MPI is typically used to program parallel machines with distributed memory. This is efficient, but error prone. Algorithmic skeletons are intended to simplify parallel programming by increasing expressive power. The idea is to offer typical par

An object-oriented bulk synchronous para
โœ A.N. Yzelman; Rob H. Bisseling ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 165 KB

## SUMMARY We show that the bulk synchronous parallel (BSP) model, originally designed for distributedโ€memory systems, is also applicable for sharedโ€memory multicore systems and, furthermore, that BSP libraries are useful in scientific computing on these systems. A proofโ€ofโ€concept MulticoreBSP lib

An efficient linear programming solver f
โœ Jihong Ren; Chen Greif; Mark R. Greenstreet ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 256 KB

## Abstract We consider the problem of __l__~โˆž~ optimal deconvolution arising in high dataโ€rate communication between integrated circuits. The optimal deconvolver can be found by solving a linear program for which we use Mehrotra's interiorโ€point approach. The critical step is solving the linear sy