Crystallographic and modelling studies on Mycobacterium tuberculosis RuvA: Additional role of RuvB-binding domain and inter species variability

RuvA, along with RuvB, is involved in branch migration of heteroduplex DNA in homologous recombination. The structures of three new crystal forms of RuvA from Mycobacterium tuberculosis (MtRuvA) have been determined. The RuvB-binding domain is cleaved off in one of them. Detailed models of the complexes of octameric RuvA from different species with the Holliday junction have also been constructed. A thorough examination of the structures presented here and those reported earlier brings to light the hitherto unappreciated role of the RuvB-binding domain in determining inter-domain orientation and oligomerization. These structures also permit an exploration of the interspecies variability of structural features such as oligomerization and the conformation of the loop that carries the acidic pin, in terms of amino acid substitutions. These models emphasize the additional role of the RuvB-binding domain in Holliday junction binding. This role along with its role in oligomerization could have important biological implications.

A Novel Cache Architecture and Placement Framework for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. With the requirement to process packets at line rates, high-performance routers need to forward millions of packets every second with each packet needing up to seven memory accesses. Earlier work shows that a single cache for the nodes of a trie can reduce the number of external memory accesses. It is observed that the locality characteristics of the level-one nodes of a trie are significantly different from those of lower level nodes. Hence, we propose a heterogeneously segmented cache architecture (HSCA) which uses separate caches for level-one and lower level nodes, each with carefully chosen sizes. Besides reducing misses, segmenting the cache allows us to focus on optimizing the more frequently accessed level-one node segment. We find that due to the nonuniform distribution of nodes among cache sets, the level-one nodes cache is susceptible t high conflict misses. We reduce conflict misses by introducing a novel two-level mapping-based cache placement framework. We also propose an elegant way to fit the modified placement function into the cache organization with minimal increase in access time. Further, we propose an attribute preserving trace generation methodology which emulates real traces and can generate traces with varying locality. Performanc results reveal that our HSCA scheme results in a 32 percent speedup in average memory access time over a unified nodes cache. Also, HSC outperforms IHARC, a cache for lookup results, with as high as a 10-fold speedup in average memory access time. Two-level mappin further enhances the performance of the base HSCA by up to 13 percent leading to an overall improvement of up to 40 percent over the unified scheme.