Search results for "Scheduling"

showing 10 items of 275 documents

VarySched: A Framework for Variable Scheduling in Heterogeneous Environments

2016

Despite many efforts to better utilize the potential of GPUs and CPUs, it is far from being fully exploited. Although many tasks can be easily sped up by using accelerators, most of the existing schedulers are not flexible enough to really optimize the resource usage of the complete system. The main reasons are (i) that each processing unit requires a specific program code and that this code is often not provided for every task, and (ii) that schedulers may follow the run-until-completion model and, hence, disallow resource changes during runtime. In this paper, we present VarySched, a configurable task scheduler framework tailored to efficiently utilize all available computing resources in…

ScheduleComputer science020204 information systemsDistributed computing0202 electrical engineering electronic engineering information engineeringProcessor scheduling020201 artificial intelligence & image processing02 engineering and technologyEfficient energy useScheduling (computing)2016 IEEE International Conference on Cluster Computing (CLUSTER)
researchProduct

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,…

ScheduleComputer scienceworkflowDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]010103 numerical & computational mathematics02 engineering and technologyParallel computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesTheoretical Computer Science[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]checkpointfail-stop error0202 electrical engineering electronic engineering information engineeringOverhead (computing)[INFO]Computer Science [cs]0101 mathematicsresilienceClass (computer programming)020203 distributed computingJob shop schedulingProbabilistic logic020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationDynamic programmingTask (computing)[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]WorkflowComputational Theory and MathematicsHardware and Architecture[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Task analysis[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Software
researchProduct

Pre-emption in resource-constrained project scheduling

2008

Abstract The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly foc…

ScheduleInformation Systems and ManagementGeneral Computer ScienceOperations researchGeneralizationbusiness.industryComputer scienceSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringScheduling (computing)Range (mathematics)Resource (project management)Constant (computer programming)Modeling and SimulationResource managementProject managementHeuristicsbusinessEuropean Journal of Operational Research
researchProduct

Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm

2014

We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…

ScheduleTransmission (telecommunications)Computer scienceDistributed computingConvergence (routing)Interference (wave propagation)Wireless sensor networkProtocol (object-oriented programming)Scheduling (computing)2014 IEEE Wireless Communications and Networking Conference (WCNC)
researchProduct

A hybrid genetic algorithm for the resource-constrained project scheduling problem

2008

Abstract In this paper we propose a Hybrid Genetic Algorithm (HGA) for the Resource-Constrained Project Scheduling Problem (RCPSP). HGA introduces several changes in the GA paradigm: a crossover operator specific for the RCPSP; a local improvement operator that is applied to all generated schedules; a new way to select the parents to be combined; and a two-phase strategy by which the second phase re-starts the evolution from a neighbour’s population of the best schedule found in the first phase. The computational results show that HGA is a fast and high quality algorithm that outperforms all state-of-the-art algorithms for the RCPSP known by the authors of this paper for the instance sets j…

Scheduleeducation.field_of_studyMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer sciencebusiness.industryResource constrainedCrossoverPopulationManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringProject scheduling problemModeling and SimulationGenetic algorithmArtificial intelligencebusinessHeuristicseducationEuropean Journal of Operational Research
researchProduct

SCHEDULING MULTIMODAL TRANSPORTATION SYSTEM FOR COMMUTERS

2004

Scheduling optimization; Transfer coordination; Transportation systemsScheduling optimizationTransportation systemsTransfer coordination
researchProduct

Vehicle scheduling for rental-with-driver services

2021

Abstract In this paper, we introduce a new vehicle scheduling problem (VSP) with driver consistency faced by rental-with-driver companies. A weekly time-horizon is considered and a set of potential customers, each one associated with a list of required tasks, is assumed. The company can choose to accept or reject a customer, but if accepted, all required tasks must be performed by the same driver. A profit is associated with each customer. The goal is to maximize the company’s total profit, by respecting a list of daily and the weekly drivers’ workload limitations imposed by drivers’ contracts. We propose a mathematical formulation of the problem and design an exact solution method based on…

Service (business)Profit (accounting)Job shop schedulingOperations researchComputer scienceTransportationWorkloadWorkload limitationsScheduling (computing)Task (project management)Consistency (database systems)Combinatorial Benders cutsVehicle schedulingConsistencyBusiness and International ManagementSet (psychology)Civil and Structural Engineering
researchProduct

Skilled workforce scheduling in Service Centres

2009

Abstract The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centres (SC). The SWPSP considers many real characteristics faced daily by the SC: client-company service quality agreements that establish maximum dates for the beginning and the end of tasks with penalties for delays, criticality levels indicating the client-priority in processing each task, generalized precedence relationships that can produce cycle structures, time period and percentage time lags and variable task durations depending on the worker executing the task. Furthermore, the SC workforce i…

Service (systems architecture)Service qualityScheduleInformation Systems and ManagementGeneral Computer ScienceOperations researchbusiness.industryComputer scienceWorkloadSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringScheduling (computing)Task (project management)Modeling and SimulationWorkforceOperations managementProject managementbusinessLocal search (constraint satisfaction)European Journal of Operational Research
researchProduct

Implementing a cyber-physical system to monitor soil water status and environmental variables for irrigation scheduling

2018

The most advanced research on irrigation at farm scale, following the paradigm “more crop per drop”, has been aimed at the definition of strategies of precision irrigation, in order to optimize crop water productivity and to maximize the economic benefits without affecting environmental quality.Water saving management strategies, such as regulated deficit irrigation (RDI), can be effectively applied if supported by the real time control of soil/plant water status allowing the identification of appropriate irrigation scheduling parameters (irrigation timing and doses). This challenge can be achieved by integrating sensing technologies, internet of things and cloud computing supported with co…

Settore AGR/03 - Arboricoltura Generale E Coltivazioni ArboreeSettore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-Forestalisoil water contentregulated deficit irrigationcyber-physical systemirrigation scheduling
researchProduct

Agro-hydrological models to schedule irrigation of Mediterranean tree crops

2010

In this paper a comparison between two agro-hydrological models, used to schedule irrigation of typical Mediterranean tree crops, is assessed. In particular the comparison between the model proposed by FAO, using a black box processes schematization, and the SWAP model based on the numerical analysis of Richards’ equation is initially presented for two irrigation seasons, 2005 and 2006, and two Mediterranean tree crops, i.e. grapevine (Vitis vinifera, L.) and olive oil (Olea europea, L.). The comparison mainly focuses on hydrological balance components and on soil water contents. After investigating and setting the scheduling parameters ordinarily practiced by the framers in the area (i.e o…

Settore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-ForestaliAgrohydrological models FAO 56 SWAP Irrigation Scheduling Vineyard and Olive grove
researchProduct