Search results for " computing"
showing 10 items of 2075 documents
iOS Applications Testing
2015
<p class="R-AbstractKeywords"><span lang="EN-US">Mobile applications conquer the world, but iOS devices hold the major share of tablets market among the corporate workers. This study aims to identify the aspects (i.e. features and/ or limitations) that influence the testing of the native iOS applications. The aspects related to general mobile applications testing are identified through the systematic literature review of academic sources. iOS applications testing aspects are identified through the review of non-academic (multivocal) literature sources. The identified aspects are merged and discussed in detail using the reviewed sources and based on the author’s professional expe…
Real-Time Power Flow Monitoring and Control System for Microgrids Integration in Islanded Scenarios
2019
This article presents an enhanced system for real-time power flow monitoring and control (PFMC) for microgrids integration in medium-voltage (MV) distribution networks. The developed solution includes both system architecture and the monitoring and control algorithms, and it has low implementation and installation costs. It is based on the use of hardware and software solutions previously proposed by the authors, i.e., a distributed measurement, a control and communication architecture, and a supervisory control and data acquisition (SCADA) software, which have been enhanced and integrated for the considered application. The SCADA implements a load flow (LF) algorithm for real-time power fl…
A Generic Approach to Scheduling and Checkpointing Workflows
2018
This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Parallelization strategies for density matrix renormalization group algorithms on shared-memory systems
2003
Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the standard DMRG algorithm can be accomplished in an efficient way. The methods are illustrated with DMRG calculations of the two-dimensional Hubbard model and the one-dimensional Holstein-Hubbard model on contemporary SMP architectures. The parallelized code shows good scalability up to at least eight processors and allows us to solve problems which exceed the capability of sequential DMRG calculations.
Self-dressing in classical and quantum electrodynamics
2003
A short review is presented of the theory of dressed states in nonrelativistic QED, encompassing fully and partially dressed states in atomic physics. This leads to the concept of the reconstruction of the cloud of virtual photons and of self-dressing. Finally some recent results on the classical counterpart of self-dressing are discussed and a comparison is made with the QED case. Attention is drawn to open problems and future lines of research are briefly outlined.
Parallelization of a Lattice Boltzmann Suspension Flow Solver
2002
We have applied a parallel Lattice Boltzmann method to solve the behaviour of the suspension flow. The complex behaviour of the suspension flow cannot be solved by analytical methods, so simulations are the only way to study it. Usually the size of an interesting problem is so big that calculation time on one processor is too long, and this can be solved by parallel program. We have written a parallel suspension flow solver and tested it on massive parallel computers. The measured performance of our program show that the parallelization of suspension particles was successful. We also show that over one million particles can be simulated.
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
The Reprocessed Proba-V Collection 2: Product Validation
2021
With the objective to improve data quality in terms of cloud detection, absolute radiometric calibration and atmospheric correction, the PRoject for On-Board Autonomy-Vegetation (PROBA-V) data archive (October 2013 - June 2020) will be reprocessed to Collection 2 (C2). The product validation is organized in three phases and focuses on the intercomparison with PROBA-V Collection 1 (C1), but also consistency analysis with SPOT-VGT, Sentinel-3 SYN-VGT, Terra-MODIS and METOP-AVHRR is foreseen. First preliminary results show the better performance of cloud and snow/ice masking, and indicate that statistical consistency between PROBA-V C2 and C1 are in line with expectations. PROBA-V C2 data are …