GLT: A Unified API for Lightweight Thread Libraries

In recent years, several lightweight thread (LWT) libraries have emerged to tackle exascale challenges. These offer programming models (PMs) based on user-level threads and incorporate their own lightweight mechanisms. However, each library proposes its own PM, exposing different semantics and hindering portability. To address this drawback, we have designed Generic Lightweight Thread (GLT), an application programming interface that frames the functionality of the most popular LWT libraries for high-performance computing under a single PM. We implement GLT on top of Argobots, MassiveThreads, and Qthreads. We provide GLT as a dynamic library, as well as in the form of a static version based on macro preprocessing resolution to reduce overhead. This paper discusses the GLT PM and demonstrates its minimal performance impact.Researchers from the Universitat Jaume I de Castelló were supported by project TIN2014-53495-R of the MINECO, the Generalitat Valenciana fellowship programme Vali+d 2015, and FEDER. Antonio J. Peña is cofinancied by the Spanish Ministry of Economy and Competitiveness under Juan de la Cierva fellowship number IJCI-2015-23266. This work was partially supported by the U.S. Dept. of Energy, Office of Science, Office of Advanced Scientific Computing Research (SC-21), under contract DE-AC02-06CH11357.Peer ReviewedPostprint (author's final draft

GRIDKIT: Pluggable overlay networks for Grid computing

A `second generation' approach to the provision of Grid middleware is now emerging which is built on service-oriented architecture and web services standards and technologies. However, advanced Grid applications have significant demands that are not addressed by present-day web services platforms. As one prime example, current platforms do not support the rich diversity of communication `interaction types' that are demanded by advanced applications (e.g. publish-subscribe, media streaming, peer-to-peer interaction). In the paper we describe the Gridkit middleware which augments the basic service-oriented architecture to address this particular deficiency. We particularly focus on the communications infrastructure support required to support multiple interaction types in a unified, principled and extensible manner-which we present in terms of the novel concept of pluggable overlay networks

Исследование изотопной селективности процесса кристаллизации NaCl из водного раствора, находящегося в магнитном поле

Объектом исследования являются кристаллы NaCl, выращенные под воздействием постоянного магнитного поля из водного раствора. В данной работе приведены теоретическое обоснование и результаты исследований по изменению изотопного эффекта в постоянном магнитном поле при кристаллизации NaCl из водных растворов.The object of study are NaCl crystals grown under the influence of a constant magnetic field from an aqueous solution. This paper presents the theoretical justification and research results on the change in the isotope effect in a constant magnetic field during crystallization of NaCl from aqueous solutions

Data sharing in DHT based P2P systems

International audienceThe evolution of peer-to-peer (P2P) systems triggered the building of large scale distributed applications. The main application domain is data sharing across a very large number of highly autonomous participants. Building such data sharing systems is particularly challenging because of the "extreme" characteristics of P2P infrastructures: massive distribution, high churn rate, no global control, potentially untrusted participants... This article focuses on declarative querying support, query optimization and data privacy on a major class of P2P systems, that based on Distributed Hash Table (P2P DHT). The usual approaches and the algorithms used by classic distributed systems and databases forproviding data privacy and querying services are not well suited to P2P DHT systems. A considerable amount of work was required to adapt them for the new challenges such systems present. This paper describes the most important solutions found. It also identies important future research trends in data management in P2P DHT systems

The state of peer-to-peer network simulators

Networking research often relies on simulation in order to test and evaluate new ideas. An important requirement of this process is that results must be reproducible so that other researchers can replicate, validate and extend existing work. We look at the landscape of simulators for research in peer-to-peer (P2P) networks by conducting a survey of a combined total of over 280 papers from before and after 2007 (the year of the last survey in this area), and comment on the large quantity of research using bespoke, closed-source simulators. We propose a set of criteria that P2P simulators should meet, and poll the P2P research community for their agreement. We aim to drive the community towards performing their experiments on simulators that allow for others to validate their results

Secure referee selection for fair and responsive peer-to-peer gaming

Peer-to-Peer (P2P) architectures for Massively Multiplayer Online Games (MMOG) provide better scalability than Client/Server (C/S); however, they increase the possibility of cheating. Recently proposed P2P protocols use trusted referees that simulate/validate the game to provide security equivalent to C/S. When selecting referees from untrusted peers, selecting non-colluding referees becomes critical. Further, referees should be selected such that the range and length of delays to players is minimised (maximising game fairness and responsiveness). In this paper we formally define the referee selection problem and propose two secure referee selection algorithms, SRS-1 and SRS-2, to solve it. Both algorithms ensure the probability of corrupt referees controlling a zone/region is below a predefined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations of three different scenarios show the effectiveness of our algorithms

Disturbed flow induces a sustained, stochastic NF-κB activation which may support intracranial aneurysm growth in vivo

Intracranial aneurysms are associated with disturbed velocity patterns, and chronic inflammation, but the relevance for these findings are currently unknown. Here, we show that (disturbed) shear stress induced by vortices is a sufficient condition to activate the endothelial NF-kB pathway, possibly through a mechanism of mechanosensor de-activation. We provide evidence for this statement through in-vitro live cell imaging of NF-kB in HUVECs exposed to different flow conditions, stochastic modelling of flow induced NF-kB activation and induction of disturbed flow in mouse carotid arteries. Finally, CFD and immunofluorescence on human intracranial aneurysms showed a correlation similar to the mouse vessels, suggesting that disturbed shear stress may lead to sustained NF-kB activation thereby offering an explanation for the close association between disturbed flow and intracranial aneurysms

Definitions and incidence of cardiac syndrome X: review and analysis of clinical data

There is no consensus regarding the definition of cardiac syndrome X (CSX). We systematically reviewed recent literature using a standardized search strategy. We included 57 articles. A total of 47 studies mentioned a male/female distribution. A meta-analysis yielded a pooled proportion of females of 0.56 (n = 1,934 patients, with 95% confidence interval: 0.54–0.59). As much as 9 inclusion criteria and 43 exclusion criteria were found in the 57 articles. Applying these criteria to a population with normal coronary angiograms and treated in 1 year at a general hospital, the attributable CSX incidence varied between 3 and 11%. The many inclusion and exclusion criteria result in a wide range of definitions of CSX and these have large effects on the incidence. This shows the need for a generally accepted definition of CSX