Environmental-aware virtual data center network

Cloud computing services have recently become a ubiquitous service delivery model, covering a wide range of applications from personal file sharing to being an enterprise data warehouse. Building green data center networks providing cloud computing services is an emerging trend in the Information and Communication Technology (ICT) industry, because of Global Warming and the potential GHG emissions resulting from cloud services. As one of the first worldwide initiatives provisioning ICT services entirely based on renewable energy such as solar, wind and hydroelectricity across Canada and around the world, the GreenStar Network (GSN) was developed to dynamically transport user services to be processed in data centers built in proximity to green energy sources, reducing Greenhouse Gas (GHG) emissions of ICT equipments. Regarding the current approach, which focuses mainly in reducing energy consumption at the micro-level through energy efficiency improvements, the overall energy consumption will eventually increase due to the growing demand from new services and users, resulting in an increase in GHG emissions. Based on the cooperation between Mantychore FP7 and the GSN, our approach is, therefore, much broader and more appropriate because it focuses on GHG emission reductions at the macro-level. This article presents some outcomes of our implementation of such a network model, which spans multiple green nodes in Canada, Europe and the USA. The network provides cloud computing services based on dynamic provision of network slices through relocation of virtual data centers.     

Vectorized garbage collection

Garbage collection can be done in vector mode on supercomputers like the CRAY-2 and the Cyber 205. Both copying collection and mark-and-sweep can be expressed as breadth-first searches in which the queue can be processed in parallel. We have designed a copying garbage collector whose inner loop works entirely in vector mode. We give performance measurements of the algorithm as implemented for Lisp CONS cells on the Cyber 205. Vector-mode garbage collection performs up to nine times faster than scalar-mode collection-a worthwhile improvement.Supported in part by NSF Grants DCR-8603543 and CCR-8806121, and by a Digital Equipment Corp. Faculty Incentive Grant.Supported by the NSF Research Experiences for Undergraduates program.     

Randomized function evaluation on a ring

LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:

The dielectric response of doped semiconducting glasses

Measurements are reported of the dielectric properties of two semiconducting glasses of composition SiO₂ · Na₂O with admixtures of Sb_{2O 5} and SnO₂, covering a wide range of temperatures and a range of six decades of frequency 10^–2 to 10⁴ Hz. Both glasses show a gradual evolution of growing low frequency dispersion (LFD) with increasing temperature, with both the real and imaginary components of the complex susceptibility following a power law of the type ^n–1, with n 1 at the lowest frequencies. There are also clear indications of reversible phase transitions taking place which manifest themselves by changes in the spectral shape of the dielectric response.     

Discrete logarithms inGF(p)

Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1)) ) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms.     

Analysis and tuning of adaptive generalized predictive control

The adaptive Generalized Predictive Controller (Clarke et al., 1987a, b) is capable of controlling plants with variable dead-time, unknown model orders and unstable poles and zeros. This paper shows how the GPC control law can be written in an equivalent general linear transfer function form which simplifies closed-loop (eg. root locus) analysis. Three recommended strategies for selecting the design parameters during the commissioning stage allow the user to adjust the closed-loop speed of response on-line using only a single active tuning parameter. Experimental runs confirm the ability of adaptive GPC to provide a consistent closed-loop response in spite of large process changes.     

Comparison of selective cytotoxicity of alkyl lysophospholipids

Alkyl lysophospholipids have been shown to be cytooxic to a number of neoplastic tissues. One, ET-18-OCH₃, has been used to selectively purge leukemic cells from mixtures with normal marrow progenitor cells,in vitro andin vivo. We have measured the 50% inhibitory (IC₅₀) effect of a series of ether, lipids (EL) on leukemic cells (HL60, K562, Daudi, KG-1, KG-1a) and normal marrow progenitor cells. Cells were incubated with varying concentrations of EL for 4 hr and assayed for viability, [³H]thymidine incorporation and clonogenicity in semi-solid media. The effect on protein kinase C (PKC) activity was assayed for each compound. Compounds tested included three glycerophosphocholine analogs-ET-18-OCH₃, ET-16-NHCOCH₃, and BM 41.440. In addition, a lipoidal amine, CP 46665, an ethyleneglycolphospholipid, AEPL, and four single chain alkylphosphocholine analogs, HePC₂, HePC₃, HePC₄ and HePC₆ were also tested. During the period of incubation, the cells remained viable (>70%) as judged by trypan blue dye exclusion. The glycerophosphocholines were the most active and showed the highest therapeutic index. The lipoidal amine was active, but toxic to normal marrow progenitor cells. The ethyleneglycolphospholipid was active against HL60, but not against the other cell lines. The single chain alkylphosphocholine analogs were less active. All of the compounds inhibited PKC activity; however, the glycerophosphocholines were the most inhibitory. Based on a paper presented at the Third International Conference on Platelet-Activating Factor and Structurally Related Alkyl Ether Lipids, Tokyo, Japan, May 1989.