Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection

Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms.

UV Raman spectroscopic study on the synthesis mechanism of zeolite X

The synthesis of zeolite X is characterized by UV Raman spectroscopy, NMR spectroscopy, and X-ray diffraction. UV Raman spectra of the liquid phase of the synthesis system indicate that AI(OH); species are incorporated into silicate species, and the polymeric silicate species are depolymerized into monomeric silicate species during the early stage of zeolite formation. An. intermediate species possessing Raman bands at 307, 503, 858 and 1020 cm(-1) is detected during the crystallization ill the solid phase transformation. The intermediate species is attributed to the beta cage, the secondary building unit of zeolite X. A model for the formation of zeolite X is proposed, which involves four-membered rings connecting to each other via six-membered ring to form beta cages, then the beta cages interconnect via double six-membered rings to form the framework of zeolite X. (C) 2001 Elsevier Science B.V. All rights reserved.

Analysis of the mechanism and regulation of lactose transport and metabolism in Clostridium acetobutylicum ATCC 824.

Although the acetone-butanol-ethanol (ABE) fermentation of Clostridium acetobutylicum is currently uneconomic, the ability of the bacterium to metabolise a wide range of carbohydrates offers the potential for revival based on the use of cheap, low grade substrates. We have investigated the uptake and metabolism of lactose, the major sugar in industrial whey waste, by C. acetobutylicum ATCC 824. Lactose is taken up via a phosphoenolpyruvate (PEP)-dependent phosphotransferase system (PTS) comprising both soluble and membrane-associated components, and the resulting phosphorylated derivative is hydrolysed by a phospho--galactosidase. These activities are induced during growth on lactose, but are absent in glucose-grown cells. Analysis of the C. acetobutylicum genome sequence identified a gene system, lacRFEG, encoding a transcriptional regulator of the DeoR family, IIA and IICB components of a lactose PTS, and phospho--galactosidase. During growth in medium containing both glucose and lactose, C. acetobutylicum exhibited a classical diauxic growth, and the lac operon was not expressed until glucose was exhausted from the medium. The presence upstream of lacR of a potential catabolite responsive element (cre) encompassing the transcriptional start site is indicative of the mechanism of carbon catabolite repression characteristic of low-GC Gram-positive bacteria. A pathway for the uptake and metabolism of lactose by this industrially important organism is proposed.

Timidity: A useful emotional mechanism for robot control?

M J Neal and J Timmis. Timidity: A useful mechanism for robot control? Informatica - special issue on perception and emotion based control, 4(27):197-204, 2003.

An Hysteresis-Habituation mechanism for Sensorimotor Scaffolding

R. Gunstone and M.H. Lee ?An Hysteresis-Habituation Mechanism for Sensorimotor Scaffolding?, Proc. AISB?03 Second International Symposium on Imitation in Animals and Artifacts, 189-190, 2003.

User-Level Sandboxing: a Safe and Efficient Mechanism for Extensibility

Extensible systems allow services to be configured and deployed for the specific needs of individual applications. This paper describes a safe and efficient method for user-level extensibility that requires only minimal changes to the kernel. A sandboxing technique is described that supports multiple logical protection domains within the same address space at user-level. This approach allows applications to register sandboxed code with the system, that may be executed in the context of any process. Our approach differs from other implementations that require special hardware support, such as segmentation or tagged translation look-aside buffers (TLBs), to either implement multiple protection domains in a single address space, or to support fast switching between address spaces. Likewise, we do not require the entire system to be written in a type-safe language, to provide fine-grained protection domains. Instead, our user-level sandboxing technique requires only paged-based virtual memory support, and the requirement that extension code is written either in a type-safe language, or by a trusted source. Using a fast method of upcalls, we show how our sandboxing technique for implementing logical protection domains provides significant performance improvements over traditional methods of invoking user-level services. Experimental results show our approach to be an efficient method for extensibility, with inter-protection domain communication costs close to those of hardware-based solutions leveraging segmentation.

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources-this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.

Basis Token Consistency: A Practical Mechanism for Strong Web Cache Consistency

With web caching and cache-related services like CDNs and edge services playing an increasingly significant role in the modern internet, the problem of the weak consistency and coherence provisions in current web protocols is becoming increasingly significant and drawing the attention of the standards community [LCD01]. Toward this end, we present definitions of consistency and coherence for web-like environments, that is, distributed client-server information systems where the semantics of interactions with resource are more general than the read/write operations found in memory hierarchies and distributed file systems. We then present a brief review of proposed mechanisms which strengthen the consistency of caches in the web, focusing upon their conceptual contributions and their weaknesses in real-world practice. These insights motivate a new mechanism, which we call "Basis Token Consistency" or BTC; when implemented at the server, this mechanism allows any client (independent of the presence and conformity of any intermediaries) to maintain a self-consistent view of the server's state. This is accomplished by annotating responses with additional per-resource application information which allows client caches to recognize the obsolescence of currently cached entities and identify responses from other caches which are already stale in light of what has already been seen. The mechanism requires no deviation from the existing client-server communication model, and does not require servers to maintain any additional per-client state. We discuss how our mechanism could be integrated into a fragment-assembling Content Management System (CMS), and present a simulation-driven performance comparison between the BTC algorithm and the use of the Time-To-Live (TTL) heuristic.

An Efficient User-Level Shared Memory Mechanism for Application-Specific Extensions

This paper focuses on an efficient user-level method for the deployment of application-specific extensions, using commodity operating systems and hardware. A sandboxing technique is described that supports multiple extensions within a shared virtual address space. Applications can register sandboxed code with the system, so that it may be executed in the context of any process. Such code may be used to implement generic routines and handlers for a class of applications, or system service extensions that complement the functionality of the core kernel. Using our approach, application-specific extensions can be written like conventional user-level code, utilizing libraries and system calls, with the advantage that they may be executed without the traditional costs of scheduling and context-switching between process-level protection domains. No special hardware support such as segmentation or tagged translation look-aside buffers (TLBs) is required. Instead, our ``user-level sandboxing'' mechanism requires only paged-based virtual memory support, given that sandboxed extensions are either written by a trusted source or are guaranteed to be memory-safe (e.g., using type-safe languages). Using a fast method of upcalls, we show how our mechanism provides significant performance improvements over traditional methods of invoking user-level services. As an application of our approach, we have implemented a user-level network subsystem that avoids data copying via the kernel and, in many cases, yields far greater network throughput than kernel-level approaches.

A novel activation mechanism for Clostridial bacteriophage endolysins

Bacteriophage-encoded endolysins are produced at the end of the phage lytic cycle for the degradation of the host bacterial cell. Endolysins offer the potential as alternatives to antibiotics as biocontrol agents or therapeutics. The lytic mechanisms of three bacteriophage endolysins that target Clostridium species living under different conditions were investigated. For these endolysins a trigger and release mechanism is proposed for their activation. During host lysis, holin lesion formation suddenly permeabilises the membrane which exposes the cytosol-sequestered endolysins to a sudden environmental shock. This shock is suggested to trigger a conformational switch of the endolysins between two distinct dimer states. The switch between dimer states is proposed to activate a novel autocleavage mechanism that cleaves the linker connecting the N-terminal catalytic domain and the C-terminal domain to release the catalytic domain for more efficient digestion of the bacterial cell wall. Crystal structures of cleaved fragments of CD27L and CTP1L were previously obtained. In these structures cleavage occurs at the stem of the linker connected to the C-terminal domain. Despite a sequence identity of only 22% between 81 residues of the C-terminal domains of CD27L and CTP1L, they represent a novel fold that is identified in a number of different lysins. Within the crystal structures the two distinct dimerization modes are represented: the elongated head‐on dimer and the side-by‐side dimer. Introducing mutations that inhibit either of the dimerization states caused a decrease in the efficiency of both the autocleavage mechanism and the lytic activity of the endolysins. The two dimer states were validated for the full-length endolysins in solution by using right angle light scattering, small angle X‐ray scattering and cross-linking experiments. Overall, the data represents a new type of regulation governed by the C-terminal domains that is used to activate these endolysins once they enter the bacterial cell wall.

Emi2-mediated inhibition of E2-substrate ubiquitin transfer by the anaphase-promoting complex/cyclosome through a D-box-independent mechanism.

Vertebrate eggs are arrested at Metaphase II by Emi2, the meiotic anaphase-promoting complex/cyclosome (APC/C) inhibitor. Although the importance of Emi2 during oocyte maturation has been widely recognized and its regulation extensively studied, its mechanism of action remained elusive. Many APC/C inhibitors have been reported to act as pseudosubstrates, inhibiting the APC/C by preventing substrate binding. Here we show that a previously identified zinc-binding region is critical for the function of Emi2, whereas the D-box is largely dispensable. We further demonstrate that instead of acting through a "pseudosubstrate" mechanism as previously hypothesized, Emi2 can inhibit Cdc20-dependent activation of the APC/C substoichiometrically, blocking ubiquitin transfer from the ubiquitin-charged E2 to the substrate. These findings provide a novel mechanism of APC/C inhibition wherein the final step of ubiquitin transfer is targeted and raise the interesting possibility that APC/C is inhibited by Emi2 in a catalytic manner.

Osmolyte-induced folding of an intrinsically disordered protein: folding mechanism in the absence of ligand.

Understanding the interconversion between thermodynamically distinguishable states present in a protein folding pathway provides not only the kinetics and energetics of protein folding but also insights into the functional roles of these states in biological systems. The protein component of the bacterial RNase P holoenzyme from Bacillus subtilis (P protein) was previously shown to be unfolded in the absence of its cognate RNA or other anionic ligands. P protein was used in this study as a model system to explore general features of intrinsically disordered protein (IDP) folding mechanisms. The use of trimethylamine N-oxide (TMAO), an osmolyte that stabilizes the unliganded folded form of the protein, enabled us to study the folding process of P protein in the absence of ligand. Transient stopped-flow kinetic traces at various final TMAO concentrations exhibited multiphasic kinetics. Equilibrium "cotitration" experiments were performed using both TMAO and urea during the titration to produce a urea-TMAO titration surface of P protein. Both kinetic and equilibrium studies show evidence of a previously undetected intermediate state in the P protein folding process. The intermediate state is significantly populated, and the folding rate constants are relatively slow compared to those of intrinsically folded proteins similar in size and topology. The experiments and analysis described serve as a useful example for mechanistic folding studies of other IDPs.