Light-induced offset charge tracking in Si/SiGe quantum devices
Explore the source record for details and available documents.
Engineering topics
Publications and source records attributed to Wolfe, Michael.
Explore the source record for details and available documents.
Terpenoids are a diverse class of compounds with wide-ranging uses including as industrial solvents, pharmaceuticals, and fragrances. Efforts to produce terpenoids sustainably by engineering microbes for fermentation are ongoing, but industrial production still largely relies on nonrenewable sources. The methylerythritol phosphate (MEP) pathway generates terpenoid precursor molecules and includes the enzyme Dxs and two iron–sulfur cluster enzymes: IspG and IspH. IspG and IspH are rate limiting-enzymes of the MEP pathway but are challenging for metabolic engineering because they require iron–sulfur cluster biogenesis and an ongoing supply of reducing equivalents to function. Therefore, identifying novel alternatives to IspG and IspH has been an on-going effort to aid in metabolic engineering of terpenoid biosynthesis. We report here an analysis of the evolutionary diversity of terpenoid biosynthesis strategies as a resource for exploration of alternative terpenoid biosynthesis pathways. Using comparative genomics, we surveyed a database of 4,400 diverse bacterial species and found that some may have evolved alternatives to the first enzyme in the pathway, Dxs making it evolutionarily flexible. In contrast, we found that IspG and IspH are evolutionarily rigid because we could not identify any species that appear to have enzymatic routes that circumvent these enzymes. The ever-growing repository of sequenced bacterial genomes has great potential to provide metabolic engineers with alternative metabolic pathway solutions. With the current state of knowledge, we found that enzymes IspG and IspH are evolutionarily indispensable which informs both metabolic engineering efforts and our understanding of the evolution of terpenoid biosynthesis pathways.
Explore the source record for details and available documents.
Abstract not provided.
This paper describes how the OpenACC data model is implemented in current OpenACC compilers, ranging from research compilers (OpenUH and OpenARC) to a commercial compiler (the PGI OpenACC compiler). First, we summarize various memory architectures in today’s accelerator systems. We then describe details and issues in implementing the OpenACC data model in three different OpenACC compilers. This includes managing page tables, asynchronous data transfers, asynchronous memory allocate and free, host data construct, aliasing on a data directive, reusing device memory, partially present data, and adjacent data. We also discusses ongoing work to manage large, complex dynamic data structures. We measured the present table lookups, device memory allocation, pinned memory allocation, and managed memory in the three OpenACC compilers using eight OpenACC applications (seven from the SPEC ACCEL benchmark suite and a shock-hydrodynamics mini-application called LULESH).
Programming accelerators today usually requires managing separate virtual and physical memories, such as allocating space in and copying data between host and device memories. The OpenACC API provides data directives and clauses to control this behavior where it is required. This paper describes how the data model is supported in current OpenACC implementations, ranging from research compilers (OpenUH and OpenARC) to a commercial compiler (the PGI OpenACC compiler). This includes implementation of the data directives and clauses, testing whether the data is already present on the device, OpenCL support, managing asynchronous data transfers and memory allocations, handling aliased data, reusing device memory, managing partially present data, and support for shared memory between host and device. Lastly, it also discusses on-going work to manage large, complex dynamic data structures.