Iterative repair for scheduling and rescheduling

An iterative repair search method is described called constraint based simulated annealing. Simulated annealing is a hill climbing search technique capable of escaping local minima. The utility of the constraint based framework is shown by comparing search performance with and without the constraint framework on a suite of randomly generated problems. Results are also shown of applying the technique to the NASA Space Shuttle ground processing problem. These experiments show that the search methods scales to complex, real world problems and reflects interesting anytime behavior

On Zone-Based Analysis of Duration Probabilistic Automata

We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multiple parallel processes admitting memoryfull continuously-distributed durations. For this model we develop an extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to verification and performance evaluation problems concerning acyclic DPA (or the bounded-horizon behavior of cyclic DPA).Comment: In Proceedings INFINITY 2010, arXiv:1010.611

Synthesis and Stochastic Assessment of Cost-Optimal Schedules

We present a novel approach to synthesize good schedules for a class of scheduling problems that is slightly more general than the scheduling problem FJm,a|gpr,r_j,d_j|early/tardy. The idea is to prime the schedule synthesizer with stochastic information more meaningful than performance factors with the objective to minimize the expected cost caused by storage or delay. The priming information is obtained by stochastic simulation of the system environment. The generated schedules are assessed again by simulation. The approach is demonstrated by means of a non-trivial scheduling problem from lacquer production. The experimental results show that our approach achieves in all considered scenarios better results than the extended processing times approach

Predicting Performance of Channel Assignments in Wireless Mesh Networks through Statistical Interference Estimation

Wireless Mesh Network (WMN) deployments are poised to reduce the reliance on wired infrastructure especially with the advent of the multi-radio multi-channel (MRMC) WMN architecture. But the benefits that MRMC WMNs offer viz., augmented network capacity, uninterrupted connectivity and reduced latency, are depreciated by the detrimental effect of prevalent interference. Interference mitigation is thus a prime objective in WMN deployments. It is often accomplished through prudent channel allocation (CA) schemes which minimize the adverse impact of interference and enhance the network performance. However, a multitude of CA schemes have been proposed in research literature and absence of a CA performance prediction metric, which could aid in the selection of an efficient CA scheme for a given WMN, is often felt. In this work, we offer a fresh characterization of the interference endemic in wireless networks. We then propose a reliable CA performance prediction metric, which employs a statistical interference estimation approach. We carry out a rigorous quantitative assessment of the proposed metric by validating its CA performance predictions with experimental results, recorded from extensive simulations run on an ns-3 802.11g environment

Analysis, classification and comparison of scheduling techniques for software transactional memories

Transactional Memory (TM) is a practical programming paradigm for developing concurrent applications. Performance is a critical factor for TM implementations, and various studies demonstrated that specialised transaction/thread scheduling support is essential for implementing performance-effective TM systems. After one decade of research, this article reviews the wide variety of scheduling techniques proposed for Software Transactional Memories. Based on peculiarities and differences of the adopted scheduling strategies, we propose a classification of the existing techniques, and we discuss the specific characteristics of each technique. Also, we analyse the results of previous evaluation and comparison studies, and we present the results of a new experimental study encompassing techniques based on different scheduling strategies. Finally, we identify potential strengths and weaknesses of the different techniques, as well as the issues that require to be further investigated