Algorithmic challenges in green data centers

With data centers being the supporting infrastructure for a wide range of IT services, their efficiency has become a big concern to operators, as well as to society, for both economic and environmental reasons. The goal of this thesis is to design energy-efficient algorithms that reduce energy cost while minimizing compromise to service. We focus on the algorithmic challenges at different levels of energy optimization across the data center stack. The algorithmic challenge at the device level is to improve the energy efficiency of a single computational device via techniques such as job scheduling and speed scaling. We analyze the common speed scaling algorithms in both the worst-case model and stochastic model to answer some fundamental issues in the design of speed scaling algorithms. The algorithmic challenge at the local data center level is to dynamically allocate resources (e.g., servers) and to dispatch the workload in a data center. We develop an online algorithm to make a data center more power-proportional by dynamically adapting the number of active servers. The algorithmic challenge at the global data center level is to dispatch the workload across multiple data centers, considering the geographical diversity of electricity price, availability of renewable energy, and network propagation delay. We propose algorithms to jointly optimize routing and provisioning in an online manner. Motivated by the above online decision problems, we move on to study a general class of online problem named "smoothed online convex optimization", which seeks to minimize the sum of a sequence of convex functions when "smooth" solutions are preferred. This model allows us to bridge different research communities and help us get a more fundamental understanding of general online decision problems.

Legal dimensions of the Chinese experience in Los Angeles, 1860-1880

On October 24, 1871, a massacre of eighteen Chinese in Los Angeles brought the small southern California settlement into the national spotlight. Within a few days, news of this “night of horrors” was reported in newspapers across the country. This massacre has been cited in Asian American narratives as the first documented outbreak of ethnic violence against a Chinese community in the United States. This is ironic because Los Angeles’ small population has generally placed it on the periphery in historical studies of the California anti-Chinese movement. Because the massacre predated Los Angeles’ organized Chinese exclusion movements of the late 1870s, it has often been erroneously dismissed as an aberration in the history of the city.

The violence of 1871 was an outburst highlighting existing community tensions that would become part of public debate by decade’s close. The purpose of this study is to insert the massacre into a broader context of anti-Chinese sentiments, legal discrimination, and dehumanization in nineteenth century Los Angeles. While a second incident of widespread anti-Chinese violence never occurred, brutal attacks directed at Chinese small businessmen and others highlighted continued community conflict. Similarly, economic rivalries and concerns over Chinese prostitution that underlay the 1871 massacre were manifest in later campaigns of economic discrimination and vice suppression that sought to minimize Chinese influence within municipal limits. An analysis of the massacre in terms of anti-Chinese legal, social and economic strategies in nineteenth-century Los Angeles will elucidate these important continuities.

On concentrated loads and Green's functions in elastostatics

This investigation is concerned with the notion of concentrated loads in classical elastostatics and related issues. Following a limit treatment of problems involving concentrated internal and surface loads, the orders of the ensuing displacements and stress singularities, as well as the stress resultants of the latter, are determined. These conclusions are taken as a basis for an alternative direct formulation of concentrated-load problems, the completeness of which is established through an appropriate uniqueness theorem. In addition, the present work supplies a reciprocal theorem and an integral representation-theorem applicable to singular problems of the type under consideration. Finally, in the course of the analysis presented here, the theory of Green's functions in elastostatics is extended.

Fast Lattice Green's Function Methods for Viscous Incompressible Flows on Unbounded Domains

In this thesis, a collection of novel numerical techniques culminating in a fast, parallel method for the direct numerical simulation of incompressible viscous flows around surfaces immersed in unbounded fluid domains is presented. At the core of all these techniques is the use of the fundamental solutions, or lattice Green’s functions, of discrete operators to solve inhomogeneous elliptic difference equations arising in the discretization of the three-dimensional incompressible Navier-Stokes equations on unbounded regular grids. In addition to automatically enforcing the natural free-space boundary conditions, these new lattice Green’s function techniques facilitate the implementation of robust staggered-Cartesian-grid flow solvers with efficient nodal distributions and fast multipole methods. The provable conservation and stability properties of the appropriately combined discretization and solution techniques ensure robust numerical solutions. Numerical experiments on thin vortex rings, low-aspect-ratio flat plates, and spheres are used verify the accuracy, physical fidelity, and computational efficiency of the present formulations.