Proactive thermal management in green datacenters

The increasing demand for faster computing and high storage capacity has resulted in an increase in energy consumption and heat generation in datacenters. Because of the increase in heat generation, cooling requirements have become a critical concern, both in terms of growing operating costs as well as their environmental and societal impacts. Presently, thermal management techniques make an effort to thermally profile and control datacenters’ cooling equipment to increase their efficiency. In conventional thermal management techniques, cooling systems are triggered by the temperature crossing predefined thresholds. Such reactive approaches result in delayed response as the temperature may already be too high, which can result in performance degradation of hardware.     

Towards locally and globally shape-aware reverse 3D modeling

The process of re-creating CAD models from actual physical parts, formally known as digital shape reconstruction (DSR) is an integral part of product development, especially in re-design. While, the majority of current methods used in DSR are surface-based, our overarching goal is to obtain direct parameterization of 3D meshes, by avoiding the actual segmentation of the mesh into different surfaces. As a first step towards reverse modeling physical parts, we extract (1) locally prominent cross-sections (PCS) from triangular meshes, and (2) organize and cluster them into sweep components, which form the basic building blocks of the re-created CAD model. In this paper, we introduce two new algorithms derived from Locally Linear Embedding (LLE) (Roweis and Sauk, 2000 [3]) and Affinity Propagation (AP) (Frey and Dueck, 2007 [4]) for organizing and clustering PCS. The LLE algorithm analyzes the cross-sections (PCS) using their geometric properties to build a global manifold in an embedded space. The AP algorithm, then clusters the local cross sections by propagating affinities among them in the embedded space to form different sweep components. We demonstrate the robustness and efficiency of the algorithms through many examples including actual laser-scanned (point cloud) mechanical parts.     

引领新一代高级封装的光刻技术

在当今飞速发展的电子环境中，芯片制造商和封装技术供应商们发现传统的前段制造设备，诸如光刻步进器等，可能会实现成本高效的后段工艺流程（BEOL）器件封装。尽管高级封装市场的发展空间最初是被PCs行业的蓬勃发展带动起来的，但是现在它们已经不再是主要的增长催化因素。通信以及手持设备，如手机、PDAs（个人数字助理）、便携式游戏机以及个人通讯系统正在成为新增长阶段的推动因素。随着数字消费应用的爆炸式发展一陛能和波形系统成为必须启用高级封装（AP）技术的必要条件。在未来五年内，预计通讯芯片组、图形处理器、集成无源元件以及高速PC内存元件将成为AP技术的主要诉求。随着领先的逻辑芯片制造商们需求量的不断增大，我们共同见证了AP市场的成长过程。然而，这一细分市场的另一个转折点可能会来自高速PC内存元件对高级封装技术的诉求。     

Feature Activated Molecular Dynamics: Parallelization and Application to Systems with Globally Varying Mechanical Fields

A recently developed hybrid molecular dynamics method (Feature Activated Molecular Dynamics, or FAMD), which was originally designed to extend the scope of certain types of molecular dynamics simulations, is extended here in two ways. First, the method is modified to execute on parallel computer architectures using the MPI communication interface. The parallel FAMD algorithm is demonstrated to be computationally efficient and to substantially increase the length scales accessible with molecular dynamics. The performance of the parallel algorithm is demonstrated using a crystalline system containing 1× 10⁶ atoms, in which 1000 supersaturated self-interstitials are introduced and allowed to aggregate for about 4 ns. In the second part of this paper, the FAMD method is applied to problems in which spatio-temporally varying stress fields are present throughout the simulation cell. In particular, we consider the evolution of a spherical void in a hydrostatically stressed silicon crystal and show that the method can capture the extremely rapid void cavitation dynamics following material failure. Once again, the FAMD approach is demonstrated to provide substantial computational advantages over standard molecular dynamics.     

Parallel implementation of time-dependent density functional theory

We present a massively parallel implementation of time-dependent density functional theory in real space, aimed at computing optical absorption spectra of realistic systems with hundreds of atoms from first principles. We provide details of the formalism and discuss its implementation, optimization, and efficient parallelization, as well as remaining limitations, in detail. The capabilities of the code are illustrated by calculations of optical properties of hydrogenated silicon quantum dots.     

Calibrated,Registered Images of an Extended Urban Area

We describe a dataset of several thousand calibrated, time-stamped, geo-referenced, high dynamic range color images, acquired under uncontrolled, variable illumination conditions in an outdoor region spanning several hundred meters. The image data is grouped into several regions which have little mutual inter-visibility. For each group, the calibration data is globally consistent on average to roughly five centimeters and 0 1°, or about four pixels of epipolar registration. All image, feature and calibration data is available for interactive inspection and downloading at http://city.lcs.mit.edu/data.Calibrated imagery is of fundamental interest in a variety of applications. We have made this data available in the belief that researchers in computer graphics, computer vision, photogrammetry and digital cartography will find it of value as a test set for their own image registration algorithms, as a calibrated image set for applications such as image-based rendering, metric 3D reconstruction, and appearance recovery, and as input for existing GIS applications.     

A Peer-to-Peer Approach to Web Service Discovery

Web Services are emerging as a dominant paradigm for constructing and composing distributed business applications and enabling enterprise-wide interoperability. A critical factor to the overall utility of Web Services is a scalable, flexible and robust discovery mechanism. This paper presents a Peer-to-Peer (P2P) indexing system and associated P2P storage that supports large-scale, decentralized, real-time search capabilities. The presented system supports complex queries containing partial keywords and wildcards. Furthermore, it guarantees that all existing data elements matching a query will be found with bounded costs in terms of number of messages and number of nodes involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design and an experimental evaluation of the system are presented.     

Hierarchical Partitioning Techniques for Structured Adaptive Mesh Refinement Applications

This paper presents the design and preliminary evaluation of hierarchical partitioning and load-balancing techniques for distributed structured adaptive mesh refinement (SAMR) applications. The overall goal of these techniques is to enable the load distribution to reflect the state of the adaptive grid hierarchy and exploit it to reduce synchronization requirements, improve load-balance, and enable concurrent communications and incremental redistribution. The hierarchical partitioning algorithm (HPA) partitions the computational domain into subdomains and assigns them to hierarchical processor groups. Two variants of HPA are presented in this paper. The static hierarchical partitioning algorithm (SHPA) assigns portions of overall load to processor groups. In SHPA, the group size and the number of processors in each group is setup during initialization and remains unchanged during application execution. It is experimentally shown that SHPA reduces communication costs as compared to the Non-HPA scheme, and reduces overall application execution time by up to 59%. The adaptive hierarchical partitioning algorithm (AHPA) dynamically partitions the processor pool into hierarchical groups that match the structure of the adaptive grid hierarchy. Initial evaluations of AHPA show that it can reduce communication costs by up to 70%.     

Transition from ferro- to ferrimagnetic ordering via Mn-disorder in (Ni,Co)MnGa quaternary Heusler alloy

An inclusive investigation of electronic and magnetic properties of ordered and disordered (Ni,Co)MnGa quaternary Heusler alloy has been undertaken using the density functional theory-based full potential linearized augmented plane wave method within generalized gradient approximation as exchange–correlation potentials. We observe that the increasing Mn concentration in Ni_1?x CoMn_1+x Ga (x = 0, 0.25, 0.50 and 0.75) lowers the ferromagnetic (FM) character of the parent (Ni,Co)MnGa alloy. This change creates two inequivalent Mn sites aligning antiparallel to each other and generates the ferrimagnetic (FiM) ordering in all resultant disordered alloys. Further, this replacement sets off a structural change from Y- to X_a-structure. The highest magnetic moment has been found to be 4.95 μ_B for ordered (Ni,Co)MnGa alloy, whereas it decreases with increase in Mn-concentration for disordered systems. The variation of half-metallicity with increasing Mn concentration is analysed. The stability of FM and FiM state for the present ordered and disordered alloys, respectively, is also examined.