Search results for "Cluster computing"
showing 10 items of 120 documents
File system scalability with highly decentralized metadata on independent storage devices
2016
This paper discusses using hard drives that integrate a key-value interface and network access in the actual drive hardware (Kinetic storage platform) to supply file system functionality in a large scale environment. Taking advantage of higher-level functionality to handle metadata on the drives themselves, a serverless system architecture is proposed. Skipping path component traversal during the lookup operation is the key technique discussed in this paper to avoid performance degradation with highly decentralized metadata. Scalability implications are reviewed based on a fuse file system implementation. Peer Reviewed
FPGA Implementation Of Diffusive Realization For A Distributed Control Operator
2010
International audience; We focus on the question of real-time computation for optimal distributed filtering or control applicable to MEMS Arrays. We present an algorithm for the realization of a linear operator solution to a functional equation through its application to a Lyapunov operatorial equation associated to the heat equation in one dimension. It is based on the diffusive realization, and turns to be well suited for fined grained parallel computer architecture as Field Programmable Gate Arrays (FPGA). An effective FPGA implementation has been successfully carried out. Here, we report the main implementation steps and the final measured performances.
Biological and clinical significance of dysplastic hematopoiesis in patients with newly diagnosed multiple myeloma
2020
On behalf of the PETHEMA/GEM Cooperative Group.
Towards a Formal Analysis of MQtt Protocol in the Context of Communicating Vehicles
2017
International audience; The paper presents a formal approach to model, analyze, and verify a variant of Message Queue Telemetry Transport protocol (MQtt), dedicated to communicating vehicles (MQtt-CV) that send collected data to automotive infrastructures(subscribers). Our formal approach is based on Promela language and its system verification tool, the model checker SPIN. We propose a slight modification of MQtt protocol to reduce the big volume of data collected and sent by vehicles to infrastructures. Indeed, in the original version of MQtt protocol, when a broker receives data from publishers, it sends them directly to its subscribers without any filtration. As consequence, subscribers…
"Table 1" of "Search for a heavy top-quark partner in final states with two leptons with the ATLAS detector at the LHC"
2012
(1) Number of generated MC events for the scalar top signal grid (2) Relative Cross section uncertainties for the scalar top signal grid.
"Table 2" of "Production of charged pions, kaons and protons at large transverse momenta in pp and Pb-Pb collisions at sqrt(sNN) = 2.76 TeV"
2014
Invariant yields of identified kaons in central and peripheral Pb-Pb collisions, together with the unscaled pp reference yields.
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators
2018
International audience; There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. propertie…
Further results on generalized centro-invertible matrices
2019
[EN] This paper deals with generalized centro-invertible matrices introduced by the authors in Lebtahi et al. (Appl. Math. Lett. 38, 106¿109, 2014). As a first result, we state the coordinability between the classes of involutory matrices, generalized centro-invertible matrices, and {K}-centrosymmetric matrices. Then, some characterizations of generalized centro-invertible matrices are obtained. A spectral study of generalized centro-invertible matrices is given. In addition, we prove that the sign of a generalized centro-invertible matrix is {K}-centrosymmetric and that the class of generalized centro-invertible matrices is closed under the matrix sign function. Finally, some algorithms ha…
Energy-Efficiency and Coverage Quality Management for Reliable Diagnostics in Wireless Sensor Networks
2020
International audience; The processing of data and signals provided by sensors aims at extracting rnrelevant features which can be used to assess and diagnose the health state rnof the monitored targets. Nevertheless, Wireless Sensor Networks (WSNs) present rna number of shortcomings that have an impact on the quality of the gathered rndata at the sink level, leading to imprecise diagnostics rnof the observed targets. To improve data accuracy, two main critical and related issues, namely the energy consumption and coverage quality, need to be considered. The goal is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Unfortunately, these performance…