The requirement of matrix ATP for the import of precursor proteins into the mitochondrial matrix and intermembrane space

The role of ATP in the matrix for the import of precursor proteins into the various mitochondrial subcompartments was investigated by studying protein translocation at experimentally defined ATP levels. Proteins targeted to the matrix were neither imported or processed when matrix ATP was depleted. Import and processing of precytochrome b2, (pb2), a precursor carrying a bipartite presequence, into the intermembrane space was also strongly dependent on matrix ATP. Preproteins, consisting of 220 or more residues of pb2 fused to dihydrofolate reductase, showed the same requirement for matrix ATP, whereas the import of shorter fusion proteins (up to 167 residues of pb2) was largely independent of matrix ATP. For those intermembrane-space-targeted proteins that did need matrix ATP, the dependence could be relieved either by unfolding these proteins prior to import or by introducing a deletion into the mature portion of the protein thereby impairing the tight folding of the cytochrome b5 domain. These results suggest the following: (a) The import of matrix-targeted preproteins, in addition to a membrane potential ΔΨ, requires matrix ATP [most likely to facilitate reversible binding of mitochondrial heat-shock protein 70 (mt-Hsp70) to incoming precursors], for two steps, securing the presequence on the matrix side of the inner membrane and for the completion of translocation; (b) in the case of intermembrane-space-targeted precursors with bipartite signals, the function of ATP/mt-Hsp70 is not obligatory, as components of the intermembrane-space-sorting pathway may substitute for ATP/mt-Hsp70 function (however, if a tightly folded domain is present in the precursor, ATP/mt-Hsp70 is indispensable); (c) unfolding on the mitochondrial surface of tightly folded segments of preproteins is facilitated by matrix-ATP/mt-Hsp70

QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average

In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X satisfies certain natural conditions. With QuickWeakHeapsort and QuickMergesort we present two examples for the QuickXsort-construction. Both are efficient algorithms that incur approximately n log n - 1.26n +o(n) comparisons on the average. A worst case of n log n + O(n) comparisons can be achieved without significantly affecting the average case. Furthermore, we describe an implementation of MergeInsertion for small n. Taking MergeInsertion as a base case for QuickMergesort, we establish a worst-case efficient sorting algorithm calling for n log n - 1.3999n + o(n) comparisons on average. QuickMergesort with constant size base cases shows the best performance on practical inputs: when sorting integers it is slower by only 15% to STL-Introsort

Write-limited sorts and joins for persistent memory

To mitigate the impact of the widening gap between the memory needs of CPUs and what standard memory technology can deliver, system architects have introduced a new class of memory technology termed persistent memory. Persistent memory is byteaddressable, but exhibits asymmetric I/O: writes are typically one order of magnitude more expensive than reads. Byte addressability combined with I/O asymmetry render the performance profile of persistent memory unique. Thus, it becomes imperative to find new ways to seamlessly incorporate it into database systems. We do so in the context of query processing. We focus on the fundamental operations of sort and join processing. We introduce the notion of write-limited algorithms that effectively minimize the I/O cost. We give a high-level API that enables the system to dynamically optimize the workflow of the algorithms; or, alternatively, allows the developer to tune the write profile of the algorithms. We present four different techniques to incorporate persistent memory into the database processing stack in light of this API. We have implemented and extensively evaluated all our proposals. Our results show that the algorithms deliver on their promise of I/O-minimality and tunable performance. We showcase the merits and deficiencies of each implementation technique, thus taking a solid first step towards incorporating persistent memory into query processing. 1