Resource and Application Models for Advanced Grid Schedulers

As Grid computing is becoming an inevitable future, managing, scheduling and monitoring dynamic, heterogeneous resources will present new challenges. Solutions will have to be agile and adaptive, support self-organization and autonomous management, while maintaining optimal resource utilisation. Presented in this paper are basic principles and architectural concepts for efficient resource allocation in heterogeneous Grid environment

A Study of Grid Applications: Scheduling Perspective

As the Grid evolves from a high performance cluster middleware to a multipurpose utility computing framework, a good understanding of Grid applications, their statistics and utilisation patterns is required. This study looks at job execution times and resource utilisations in a Grid environment, and their significance in cluster and network dimensioning, local level scheduling and resource management

Enabling Adaptive Grid Scheduling and Resource Management

Wider adoption of the Grid concept has led to an increasing amount of federated computational, storage and visualisation resources being available to scientists and researchers. Distributed and heterogeneous nature of these resources renders most of the legacy cluster monitoring and management approaches inappropriate, and poses new challenges in workflow scheduling on such systems. Effective resource utilisation monitoring and highly granular yet adaptive measurements are prerequisites for a more efficient Grid scheduler. We present a suite of measurement applications able to monitor per-process resource utilisation, and a customisable tool for emulating observed utilisation models. We also outline our future work on a predictive and probabilistic Grid scheduler. The research is undertaken as part of UK e-Science EPSRC sponsored project SO-GRM (Self-Organising Grid Resource Management) in cooperation with BT

An exploratory study of the vortex sheets shed from the leading edges of slender wings

Analysis of vortex sheets shed from leading edges of slender wing

The coding hypothesis and zero-delay matching-to-sample in the pigeon.

Twelve Carneaux pigeons were divided into three groups and trained on zero-delay matching-to-sample, fixed ratio matching-to-sample or zero -delay non-.natching. Reinforcing only every third correct match with grain was found to substantially slow acquisition. Learning matching or non-matching with red and green stimuli did not produce generalized transfer nor did the transfer task interfere with performance on the original problem. Re-pairing the stimuli so as to change the odd comparison stimulus was shown not to affect matching performance but to cause a decrement in non-matching in two out of three cases. Interpolation of a one second delay between the offset of the standard stimulus and the onset of the comparisons caused all animals to drop to chance performance, from which they never improved. The results are interpreted in terms of the coding hypothesis of Cumming ert. al. (1965)

A theoretical investigation of the aerodynamics of slender wing-body combinations exhibiting leading-edge separation

Theoretical investigation of aerodynamics of slender wing-body combinations exhibiting leading edge separatio