Energy Saving Techniques for Phase Change Memory (PCM)

In recent years, the energy consumption of computing systems has increased and a large fraction of this energy is consumed in main memory. Towards this, researchers have proposed use of non-volatile memory, such as phase change memory (PCM), which has low read latency and power; and nearly zero leakage power. However, the write latency and power of PCM are very high and this, along with limited write endurance of PCM present significant challenges in enabling wide-spread adoption of PCM. To address this, several architecture-level techniques have been proposed. In this report, we review several techniques to manage power consumption of PCM. We also classify these techniques based on their characteristics to provide insights into them. The aim of this work is encourage researchers to propose even better techniques for improving energy efficiency of PCM based main memory.Comment: Survey, phase change RAM (PCRAM

Exploiting the Weak Generational Hypothesis for Write Reduction and Object Recycling

Programming languages with automatic memory management are continuing to grow in popularity due to ease of programming. However, these languages tend to allocate objects excessively, leading to inefficient use of memory and large garbage collection and allocation overheads. The weak generational hypothesis notes that objects tend to die young in languages with automatic dynamic memory management. Much work has been done to optimize allocation and garbage collection algorithms based on this observation. Previous work has largely focused on developing efficient software algorithms for allocation and collection. However, much less work has studied architectural solutions. In this work, we propose and evaluate architectural support for assisting allocation and garbage collection. We first study the effects of languages with automatic memory management on the memory system. As objects often die young, it is likely many objects die while in the processor\u27s caches. Writes of dead data back to main memory are unnecessary, as the data will never be used again. To study this, we develop and present architecture support to identify dead objects while they remain resident in cache and eliminate any unnecessary writes. We show that many writes out of the caches are unnecessary, and can be avoided using our hardware additions. Next, we study the effects of using dead data in cache to assist with allocation and garbage collection. Logic is developed and presented to allow for reuse of cache space found dead to satisfy future allocation requests. We show that dead cache space can be recycled at a high rate, reducing pressure on the allocator and reducing cache miss rates. However, a full implementation of our initial approach is shown to be unscalable. We propose and study limitations to our approach, trading object coverage for scalability. Third, we present a new approach for identifying objects that die young based on a limitation of our previous approach. We show this approach has much lower storage and logic requirements and is scalable, while only slightly decreasing overall object coverage

Successful writing

No abstrac

Privatization-Safe Transactional Memories

Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often would like to access the same data both inside and outside transactions, and would prefer their programs to have a strongly atomic semantics, which allows transactions to be viewed as executing atomically with respect to non-transactional accesses. Since guaranteeing such semantics for arbitrary programs is prohibitively expensive, researchers have suggested guaranteeing it only for certain data-race free (DRF) programs, particularly those that follow the privatization idiom: from some point on, threads agree that a given object can be accessed non-transactionally. In this paper we show that a variant of Transactional DRF (TDRF) by Dalessandro et al. is appropriate for a class of privatization-safe TMs, which allow using privatization idioms. We prove that, if such a TM satisfies a condition we call privatization-safe opacity and a program using the TM is TDRF under strongly atomic semantics, then the program indeed has such semantics. We also present a method for proving privatization-safe opacity that reduces proving this generalization to proving the usual opacity, and apply the method to a TM based on two-phase locking and a privatization-safe version of TL2. Finally, we establish the inherent cost of privatization-safety: we prove that a TM cannot be progressive and have invisible reads if it guarantees strongly atomic semantics for TDRF programs

Extensions of differential representations of SL(2) and tori

Linear differential algebraic groups (LDAGs) measure differential algebraic dependencies among solutions of linear differential and difference equations with parameters, for which LDAGs are Galois groups. The differential representation theory is a key to developing algorithms computing these groups. In the rational representation theory of algebraic groups, one starts with SL(2) and tori to develop the rest of the theory. In this paper, we give an explicit description of differential representations of tori and differential extensions of irreducible representation of SL(2). In these extensions, the two irreducible representations can be non-isomorphic. This is in contrast to differential representations of tori, which turn out to be direct sums of isotypic representations.Comment: 21 pages; few misprints corrected; Lemma 4.6 adde

The anomaly line bundle of the self-dual field theory

In this work, we determine explicitly the anomaly line bundle of the abelian self-dual field theory over the space of metrics modulo diffeomorphisms, including its torsion part. Inspired by the work of Belov and Moore, we propose a non-covariant action principle for a pair of Euclidean self-dual fields on a generic oriented Riemannian manifold. The corresponding path integral allows to study the global properties of the partition function over the space of metrics modulo diffeomorphisms. We show that the anomaly bundle for a pair of self-dual fields differs from the determinant bundle of the Dirac operator coupled to chiral spinors by a flat bundle that is not trivial if the underlying manifold has middle-degree cohomology, and whose holonomies are determined explicitly. We briefly sketch the relevance of this result for the computation of the global gravitational anomaly of the self-dual field theory, that will appear in another paper.Comment: 41 pages. v2: A few typos corrected. Version accepted for publication in CM

Teaching Social Justice Using a Pedagogy of Engagement

Teaching an undergraduate level diversity course with a health focus requires specific teaching methods. A pedagogy of engagement provides an effective strategy for exploring issues of race, class, gender, and structural inequalities that underlie health disparities. Engagement learning enhances understanding of theories of oppression and liberation presented in the course and highlights social justice issues