Search results for " Parallel"

An exact algorithm for preventive maintenance planning of series-parallel systems

2009

Reliability is a meaningful parameter in assessing the performance of systems such as chemical processing facilities, power plant, aircrafts, ships, etc. In the literature, reliability optimization is widely considered during the system design phase and it is carried out by an opportune selection of both system components and redundancy. On the other hand, the problem of maintaining a required level of reliability by an opportune maintenance policy has been poorly examined. The paper tackles this problem for a system whose major components can be maintained only during a planned system downtime. An exact algorithm is proposed in order to single out the set of components that must be maintai…

Combined IT and power supply infrastructure sizing for standalone green data centers

2021

International audience; In this work, we propose a two-step methodology for designing and sizing a data center solely powered by local renewable energy. The first step consists in determining the necessary IT equipment for processing a given IT workload composed of batch and service tasks. We propose an adapted binary search algorithm and prove its optimality to find the minimum number of servers to handle the IT workload. When the IT sizing is computed, the second step consists in defining the supplying electrical infrastructure using wind turbines and photovoltaic panels as primary sources. Batteries and a hydrogen system are added as secondary sources for short- and long-term energy stor…

Ekskurs XI. Sprofanowana świątynia (Ez 8,1-18) i dolina suchych kości (Ez 37,1-14) w świetle retoryki hebrajskiej

2021

Kontekstem badań było to, że komentatorzy Księgi Ezechiela nie są zgodni w sprawie struktury badanych tekstów i proponują odmienne schematy. Celem badań stało się odkrycie struktury, którą starożytny autor natchniony zawarł w tekście. By osiągnąć założony cel, zastosowano metodę retoryki hebrajskiej, którą opracował Roland Meynet. W wyniku przeprowadzonych badań udało się odkryć, że sprofanowana świątynia ma strukturę paralelno-koncentryczną, składającą się z 9 elementów (A, B, C, D, E, D’, C’, B’, A’), natomiast dolina suchych kości też ma strukturę paralelno-koncentryczną, na którą składa się 5 elementów (A, B, C, B’, A’). Osiągnięte wyniki pozwoliły wyciągnąć wspólny wniosek dla dwóch ba…

Large-scale genome-wide association studies on a GPU cluster using a CUDA-accelerated PGAS programming model

2015

[Abstract] Detecting epistasis, such as 2-SNP interactions, in genome-wide association studies (GWAS) is an important but time consuming operation. Consequently, GPUs have already been used to accelerate these studies, reducing the runtime for moderately-sized datasets to less than 1 hour. However, single-GPU approaches cannot perform large-scale GWAS in reasonable time. In this work we present multiEpistSearch, a tool to detect epistasis that works on GPU clusters. While CUDA is used for parallelization within each GPU, the workload distribution among GPUs is performed with Unified Parallel C++ (UPC++), a novel extension of C++ that follows the Partitioned Global Address Space (PGAS) model…

Checkpointing Workflows for Fail-Stop Errors

2017

International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…

Serial In-network Processing for Large Stationary Wireless Sensor Networks

2017

International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…

PROLISEAN: A New Security Protocol for Programmable Matter

2021

The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive fro…

A Model for Periodic Preventive Maintenance Policy for a Series Parallel System

2009

Experimental Performance Evaluation of Cloud-Based Analytics-as-a-Service

2016

An increasing number of Analytics-as-a-Service solutions has recently seen the light, in the landscape of cloud-based services. These services allow flexible composition of compute and storage components, that create powerful data ingestion and processing pipelines. This work is a first attempt at an experimental evaluation of analytic application performance executed using a wide range of storage service configurations. We present an intuitive notion of data locality, that we use as a proxy to rank different service compositions in terms of expected performance. Through an empirical analysis, we dissect the performance achieved by analytic workloads and unveil problems due to the impedance…

A Non-Parametric Parallel Harris-Affine Detector

2009

This paper describes a parallel version of a new automatic Harris-based corner detector. A simple but effective client-server based scheduler has been implemented in order to dynamically distribute the workload on heterogeneous parallel architectures such as Grid systems. Results obtained on the COMETA Grid show the effectiveness and the robustness of the proposed approach.