Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm

The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for compute-intensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.

A Survey of Search Methodologies and Automated System Development for Examination Timetabling

Exam timetabling is one of the most important administrative activities that takes place in academic institutions. In this paper we present a critical discussion of the research on exam timetabling in the last decade or so. This last ten years has seen an increased level of attention on this important topic. There has been a range of significant contributions to the scientific literature both in terms of theoretical andpractical aspects. The main aim of this survey is to highlight the new trends and key research achievements that have been carried out in the last decade.We also aim to outline a range of relevant important research issues and challenges that have been generated by this body of work.

We first define the problem and review previous survey papers. Algorithmic approaches are then classified and discussed. These include early techniques (e.g. graph heuristics) and state-of-the-art approaches including meta-heuristics, constraint based methods, multi-criteria techniques, hybridisations, and recent new trends concerning neighbourhood structures, which are motivated by raising the generality of the approaches. Summarising tables are presented to provide an overall view of these techniques. We discuss some issues on decomposition techniques, system tools and languages, models and complexity. We also present and discuss some important issues which have come to light concerning the public benchmark exam timetabling data. Different versions of problem datasetswith the same name have been circulating in the scientific community in the last ten years which has generated a significant amount of confusion. We clarify the situation and present a re-naming of the widely studied datasets to avoid future confusion. We also highlight which research papershave dealt with which dataset. Finally, we draw upon our discussion of the literature to present a (non-exhaustive) range of potential future research directions and open issues in exam timetabling research.

Population-based local search for protein folding simulation in the MJ energy model and cubic lattices

We present experimental results on benchmark problems in 3D cubic lattice structures with the Miyazawa-Jernigan energy function for two local search procedures that utilise the pull-move set: (i) population-based local search (PLS) that traverses the energy landscape with greedy steps towards (potential) local minima followed by upward steps up to a certain level of the objective function; (ii) simulated annealing with a logarithmic cooling schedule (LSA). The parameter settings for PLS are derived from short LSA-runs executed in pre-processing and the procedure utilises tabu lists generated for each member of the population. In terms of the total number of energy function evaluations both methods perform equally well, however. PLS has the potential of being parallelised with an expected speed-up in the region of the population size. Furthermore, both methods require a significant smaller number of function evaluations when compared to Monte Carlo simulations with kink-jump moves. (C) 2009 Elsevier Ltd. All rights reserved.

Under-water scene investigation using ground penetrating radar (GPR) in the search for a sunken jet ski, Northern Ireland

A search for a submerged jet ski and the lost limb of its driver involved in a collision with a speedboat was made in a shallow lake in Northern Ireland. The location of both was crucial to establishing events at the time of the accident. Local intelligence suggested both objects were likely to be partially-buried by lacustrine silt. To avoid sediment churning, this required non-invasive, completely non-destructive assessment and mapping of the scene. A MALA RAMAC ground-penetrating radar system (GPR) mounted on floats for surveying from walkways and jetties or placed in a small rubber dinghy for offshore profiling was used. A grid was established and each line surveyed with 100, 200 and 400MHz antennae. In waters over 6m deep GPR data showed the form of the lake floor but excessive ringing occurred in the data. In waters less than 6m deep ringing diminished on both 100 and 200MHz data, the latter displaying the best trade-off between depth penetration and horizontal object resolution. 400MHz data failed to be of use in waters over 2m deep and at these depths showed only limited improvement of image quality compared to 200MHz data. Surface objects such as a wooden walkway caused interference on 200 and 400MHz data when antennae were oriented both normal and parallel to survey direction; this may be a function of the low attenuation of radar waves in freshwater, allowing excellent lateral and vertical radar wave penetration. On 200MHz data the damaged jet-ski was clearly imaged in a location that contradicted the speedboat driver's account of the accident.