A Concurrent Tuple Set Architecture for Call Level Interfaces

Call Level Interfaces (CLI) are low level API aimed at providing services to connect two main components in database applications: client applications and relational databases. Among their functionalities, the ability to manage data retrieved from databases is emphasized. The retrieved data is kept in local memory structures that may be permanently connected to the host database. Client applications, beyond the ability to read their contents, may also execute Insert, Update and Delete actions over the local memory structures, following specific protocols. These protocols are row (tuple) oriented and, while being executed, cannot be preempted to start another protocol. This restriction leads to several difficulties when applications need to deal with several tuples at a time. The most paradigmatic case is the impossibility to cope with concurrent environments where several threads need to access to the same local memory structure instance, each one pointing to a different tuple and executing its particular protocol. To overcome the aforementioned fragility, a Concurrent Tuple Set Architecture (CTSA) is proposed to manage local memory structures. A performance assessment of a Java component based on JDBC (CLI) is also carried out and compared with a common approach. The main outcome of this research is the evidence that in concurrent environments, components relying on the CTSA may significantly improve the overall performance when compared with solutions based on standard JDBC API.(undefined

Flora: a framework for decomposing software architecture to introduce local recovery

The decomposition of software architecture into modular units is usually driven by the required quality concerns. In this paper we focus on the impact of local recovery concern on the decomposition of the software system. For achieving local recovery, the system needs to be decomposed into separate units that can be recovered in isolation. However, it appears that this required decomposition for recovery is usually not aligned with the decomposition based on functional concerns. Moreover, introducing local recovery to a software system, while preserving the existing decomposition, is not trivial and requires substantial development and maintenance effort. To reduce this effort we propose a framework that supports the decomposition and implementation of software architecture for local recovery. The framework provides reusable abstractions for defining recoverable units and the necessary coordination and communication protocols for recovery. We discuss our experiences in the application and evaluation of the framework for introducing local recovery to the open-source media player called MPlayer. Copyright 2009 John Wiley & Sons, Ltd

Optimizing decomposition of software architecture for local recovery

The increasing size and complexity of software systems has led to an amplified number of potential failures and as such makes it harder to ensure software reliability. Since it is usually hard to prevent all the failures, fault tolerance techniques have become more important. An essential element of fault tolerance is the recovery from failures. Local recovery is an effective approach whereby only the erroneous parts of the system are recovered while the other parts remain available. For achieving local recovery, the architecture needs to be decomposed into separate units that can be recovered in isolation. Usually, there are many different alternative ways to decompose the system into recoverable units. It appears that each of these decomposition alternatives performs differently with respect to availability and performance metrics. We propose a systematic approach dedicated to optimizing the decomposition of software architecture for local recovery. The approach provides systematic guidelines to depict the design space of the possible decomposition alternatives, to reduce the design space with respect to domain and stakeholder constraints and to balance the feasible alternatives with respect to availability and performance. The approach is supported by an integrated set of tools and illustrated for the open-source MPlayer software. © 2011 Springer Science+Business Media, LLC

Investigation of heavy-heavy pseudoscalar mesons in thermal QCD Sum Rules

We investigate the mass and decay constant of the heavy-heavy pseudoscalar, $B_c$, $\eta_c$ and $\eta_b$ mesons in the framework of finite temperature QCD sum rules. The annihilation and scattering parts of spectral density are calculated in the lowest order of perturbation theory. Taking into account the additional operators arising at finite temperature, the nonperturbative corrections are also evaluated. The masses and decay constants remain unchanged under $T\cong 100 ~MeV$, but after this point, they start to diminish with increasing the temperature. At critical or deconfinement temperature, the decay constants reach approximately to 35% of their values in the vacuum, while the masses are decreased about 7%, 12% and 2% for $B_c$, $\eta_c$ and $\eta_b$ states, respectively. The results at zero temperature are in a good consistency with the existing experimental values as well as predictions of the other nonperturbative approaches.Comment: 11 Pages, 2 Tables and 6 Figure

Yeast Vps13 is Crucial for Peroxisome Expansion in Cells With Reduced Peroxisome-ER Contact Sites

In the yeast Hansenula polymorpha the peroxisomal membrane protein Pex11 and three endoplasmic reticulum localized proteins of the Pex23 family (Pex23, Pex24 and Pex32) are involved in the formation of peroxisome-ER contact sites. Previous studies suggested that these contacts are involved in non-vesicular lipid transfer and important for expansion of the peroxisomal membrane. The absence of Pex32 results in a severe peroxisomal phenotype, while cells lacking Pex11, Pex23 or Pex24 show milder defects and still are capable to form peroxisomes and grow on methanol. We performed transposon mutagenesis on H. polymorpha pex11 cells and selected mutants that lost the capacity to grow on methanol and are severely blocked in peroxisome formation. This strategy resulted in the identification of Vps13, a highly conserved contact site protein involved in bulk lipid transfer. Our data show that peroxisome formation and function is normal in cells of a vps13 single deletion strain. However, Vps13 is essential for peroxisome biogenesis in pex11. Notably, Vps13 is also required for peroxisome formation in pex23 and pex24 cells. These data suggest that Vps13 is crucial for peroxisome formation in cells with reduced peroxisome-endoplasmic reticulum contact sites and plays a redundant function in lipid transfer from the ER to peroxisomes

Runtime verification of component-based embedded software

To deal with increasing size and complexity, component-based software development has been employed in embedded systems. Due to several faults, components can make wrong assumptions about the working mode of the system and the working modes of the other components. To detect mode inconsistencies at runtime, we propose a "lightweight" error detection mechanism, which can be integrated with component-based embedded systems. We define links among three levels of abstractions: the runtime behavior of components, the working mode specifications of components and the specification of the working modes of the system. This allows us to detect the user observable runtime errors. The effectiveness of the approach is demonstrated by implementing a software monitor integrated into a TV system. © 2012 Springer-Verlag London Limited

Pex24 and Pex32 are required to tether peroxisomes to the ER for organelle biogenesis, positioning and segregation in yeast

© 2020. Published by The Company of Biologists Ltd.The yeast Hansenula polymorpha contains four members of the Pex23 family of peroxins, which characteristically contain a DysF domain. Here we show that all four H. polymorpha Pex23 family proteins localize to the endoplasmic reticulum (ER). Pex24 and Pex32, but not Pex23 and Pex29, predominantly accumulate at peroxisome–ER contacts. Upon deletion of PEX24 or PEX32 – and to a much lesser extent, of PEX23 or PEX29 – peroxisome–ER contacts are lost, concomitant with defects in peroxisomal matrix protein import, membrane growth, and organelle proliferation, positioning and segregation. These defects are suppressed by the introduction of an artificial peroxisome–ER tether, indicating that Pex24 and Pex32 contribute to tethering of peroxisomes to the ER. Accumulation of Pex32 at these contact sites is lost in cells lacking the peroxisomal membrane protein Pex11, in conjunction with disruption of the contacts. This indicates that Pex11 contributes to Pex32-dependent peroxisome–ER contact formation. The absence of Pex32 has no major effect on pre-peroxisomal vesicles that occur in pex3 atg1 deletion cells.This work was supported by a grant from the FP7 People: Marie-Curie Actions Initial Training Networks (ITN) program PerFuMe (Grant Agreement Number 316723) to N.B., D.P.D. and I.J.v.d.K., from the China Scholarship Council (CSC) to F.W., and from the Nederlandse Organisatie voor Wetenschappelijk Onderzoek/Chemical Sciences (NWO/CW) to A.A. (711.012.002)