Search results for "Scheduling"

Assessing agro-hydrological models to schedule irrigation for crops of Mediterranean Environment

2008

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.

A Harris-based Region Detector on a Computational Grid

2007

This paper introduces a new Harris-based feature detector algorithm, characterized by no parameters tuning to detect region of interest. Preliminary results show that the proposed methodology returns good results with respect to standard detectors which need a set of parameters. An uncommon parallel implementation of the proposed algorithm is presented to support the high computational workload which is required to avoid the approximation of the results. Our parallel approach differs from the conventional one because an internal scheduler, based on the expected running time, is used to balance the data distribution on a client-server model. The aim of this paper is also to underline the adv…

Maintenance Planning For The Reliability Maximization In A Large System With Vagueness In The Reliability Values Of Some Components

2015

This paper tackles the problem to single out the maintenance actions to be executed on a production system during the planned stop of given length. In detail, from a reliability viewpoint the system is assimilated as a series-parallel multi-component system and the maintenance actions need to maximize the system reliability up to the next planned stop. Moreover, it is assumed that some components reliability values are affected by vagueness within a given range. To solve the considered problem, an exact dynamic programming algorithm suitable to quickly point out the maintenance scheduling is developed and, moreover, it is formulated a proper parameter able to express the robustness of the o…

Implementazione di funzioni aggiuntive per la rappresentazione e la gestione ottimizzata di risorse energetiche distribuite in un distretto energetic…

2013

Il presente Rapporto descrive le attività svolte dal personale del DEIM dell’Università degli Studi Palermo nell’ambito della prima fase delle attività di ricerca dal titolo: “Implementazione di funzioni aggiuntive per la rappresentazione e la gestione ottimizzata di risorse energetiche distribuite in un distretto energetico. Simulazione di scenari in ambiente integrato”, oggetto dell’Accordo di Collaborazione tra ENEA e DEIM sottoscritto in data 25 marzo 2013. Scopo del presente accordo di collaborazione è la definizione di funzioni aggiuntive per i vari componenti del distretto energetico già descritti e modellati in un apposito software nella scorsa annualità. Le simulazioni sono state s…

An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach

2009

A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems.

Fuzzy techniques for access and data management in home automation environments

2012

Home Automation Environments are characterized by the integration of electronic devices as well as by the performance of communication and control systems. Environment infrastructure has to meet several requirements including Quality of Service (QoS), safety, security, and energy saving. However, Home Automation deals with complex environments, so that advanced data management systems are required to meet the above constraints. Fuzzy Logic based techniques can be successful used to improve system performance management. This work proposes and describes the use and application of fuzzy rules on a two-tiered architecture integrating a biometric authentication module and communication real-tim…

The egoistic approach to parallel process migration into heterogeneous workstation network

1996

Abstract A new approach to the allocation of processes in a distributed system is discussed. The proposed solution deals with process migration into heterogeneous systems by means of a strategy that delegates the individual parallel applications to manage the migration of their processes by themselves, on the basis of their own performance objectives. This approach is discussed in opposition to the global scheduling based one, and the load balancing objective is pursued as an effect of the optimization of individual applications. A new performance evaluation criterion is introduced that consists in monitoring the delays that occur when two parallel processes run towards a common synchroniza…

Time-Constrained Node Visit Planning for Collaborative UAV-WSN Distributed Applications.

2022

Unmanned Aerial Vehicles (UAVs) are often studied as tools to perform data collection from Wireless Sensor Networks (WSNs). Path planning is a fundamental aspect of this endeavor. Works in the current literature assume that data are always ready to be retrieved when the UAV passes. This operational model is quite rigid and does not allow for the integration of the UAV as a computational object playing an active role in the network. In fact, the UAV could begin the computation on a first visit and retrieve the data later. Potentially, the UAV could orchestrate the distributed computation to improve its performance, change its parameters, and even upload new applications to the sensor network…

Job shop scheduling by a parallel approach

1993

The paper deals with a parallel approach to job shop scheduling by a branch and bound methodology using the lower bound proposed by Ashour and Hiremath. The optimal solution is achieved by an iterative-reductive strategy. At each iteration the algorithm investigates the conflict intervals and it selects a subset of the possible solutions. The makespan value, achieved by the parallel processes, gives the upper limit for the admissible lower bound of the intermediate solutions. Furthermore the best makespan reached by each iteration is reused as a filter to reduce the complexity of the next iteration. The computation is speeded up by a parallel implementation, giving the possibility of distri…