Search results for "020203 distributed computing"
showing 10 items of 75 documents
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,…
Pervasive Displays Research: What's Next?
2019
Reports on the 7th ACM International Symposium on Pervasive Displays that took place from June 6-8 in Munich, Germany.
Human-to-Human Interaction: The Killer Application of Ubiquitous Computing?
2017
Twenty-five years past the Weiser’s vision of Ubiquitous Computing, and there is not a clear understanding of what is or is not a pervasive system. Due to the loose boundaries of such paradigm, almost any kind of remotely ac-cessible networked system is classified as a pervasive system. We think that that is mainly due to the lack of killer applications that could make this vi-sion clearer. Actually, we think that the most promising killer application is already here, but we are so used to it that we do not see it, as a perfect fitting of the Weiser’s vision: the Human-to-Human Interaction mediated by com-puters.
Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model
2016
[EN] Academic performance is a concern of paramount importance in Spain, where around of 30% of the students in the last two courses in high school, before to access to the labor market or to the university, do not achieve the minimum knowledge required according to the Spanish educational law in force. In order to analyze this problem, we propose a random network model to study the dynamics of the academic performance in Spain. Our approach is based on the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. Moreover, in order to consider the uncertainty in the estimation of model parameters, we perform a lot of simulations taking as t…
Work Partitioning on Parallel and Distributed Agent-Based Simulation
2017
Work partitioning is a key challenge with ap- plications in many scientific and technological fields. The problem is very well studied with a rich literature on both distributed and parallel computing architectures. In this paper we deal with the work partitioning problem for parallel and distributed agent-based simulations which aims at (i) balancing the overall load distribution, (ii) minimizing, at the same time, the communication overhead due to agents' inter-dependencies. We introduce a classification taxonomy of work partitioning strategies and present a space-based work partitioning ap- proach, based on a Quad-tree data structure, which enables to: identify a good space partitioning …
Skeletons for parallel image processing: an overview of the SKiPPER project
2002
International audience; This paper is a general overview of the SKIPPER project, run at Blaise Pascal University between 1996 and 2002. The main goal of the SKIPPER project was to demonstrate the appli- cability of skeleton-based parallel programming techniques to the fast prototyping of reactive vision applications. This project has produced several versions of a full-fledged integrated pa- rallel programming environment (PPE). These PPEs have been used to implement realistic vi- sion applications, such as road following or vehicle tracking for assisted driving, on embedded parallel platforms embarked on semi-autonomous vehicles. All versions of SKIPPER share a common front-end and reperto…
New Optimization and Security Approaches to Enhance the Smart Grid Performance and Reliability
2016
International audience; Nowadays, the Smart Grid (SG) is becoming smarter thanks to the integration of different information and communication technologies to enhance the reliability and efficiency of the power grid. However, several issues should be met to ensure high SG performance. Among these issues, we cite the problem of electric vehicles (EVs) integration into the SG to avoid electricity intermittence due to the important load that EVs can create. Another issue is the SG communication network security that can be attempted by malicious intruders in order to create damages and make the power grid instable. In this context, we propose at a first level a Bayesian game-theory model that …
A New Universal-Environment Adaptive Multi-processor Scheduler for Autonomous Cyber-Physical System
2012
International audience; Robot, spaceship and other applications that can be called autonomous Cyber-Physical Systems (CPS) are all smart embedded systems, which usually run in open environment by themselves with inhered intelligent capabilities. Besides the application intelligence, the researches of adaptive platform for such systems have also become topics recently. Based on the analysis of current work, a new environment adaptive scheduler (¦Á-S) for multiprocessor platform of a cyber-physical system is proposed in this article. And then, its related structures, models, and reasoning methods are studied deeply. Different from the existing ones, ¦Á-S can schedule all tasks according to th…
Scheduling independent stochastic tasks on heterogeneous cloud platforms
2019
International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…