Managing investment in teaching and learning technologies

Information and communications technologies are radically changing the way that teaching and learning activities are organised and delivered within HE institutions. A wide range of technologies is being deployed in quite complex and interactive ways, including virtual learning environments (VLEs), mobile communication technologies, digital libraries and on-line resources. A key challenge for university leaders is to maximise the benefits derived from these investments for all institutional stakeholders (not just teachers and learners), while at the same time minimising cost and risk (Ford et al, 1996). This requires not only co-ordinated strategies for change management but also new approaches to decision-making and to the evaluation of changes resulting from these decisions

Optimistic barrier synchronization

Barrier synchronization is fundamental operation in parallel computation. In many contexts, at the point a processor enters a barrier it knows that it has already processed all the work required of it prior to synchronization. The alternative case, when a processor cannot enter a barrier with the assurance that it has already performed all the necessary pre-synchronization computation, is treated. The problem arises when the number of pre-sychronization messages to be received by a processor is unkown, for example, in a parallel discrete simulation or any other computation that is largely driven by an unpredictable exchange of messages. We describe an optimistic O(log sup 2 P) barrier algorithm for such problems, study its performance on a large-scale parallel system, and consider extensions to general associative reductions as well as associative parallel prefix computations

High pressure cosmochemistry applied to major planetary interiors: Experimental studies

The infrared spectra of H2O ice VII and D2O ice VII were studied and techniques were developed for measuring adiabats of phases of NH3-H2O to 5 GPa. A mixing system for pressurized fluids was constructed in which liquid solutions of definite compositions can be prepared and loaded reliably into diamond cells in a project which seeks to determine the properties and boundaries of several high pressure phases of the H2-He-H2O-NH3-CH4 system. These data are needed to constrain theoretical models of the interiors of the major planets

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity

Statistical methodologies for the control of dynamic remapping

Following an initial mapping of a problem onto a multiprocessor machine or computer network, system performance often deteriorates with time. In order to maintain high performance, it may be necessary to remap the problem. The decision to remap must take into account measurements of performance deterioration, the cost of remapping, and the estimated benefits achieved by remapping. We examine the tradeoff between the costs and the benefits of remapping two qualitatively different kinds of problems. One problem assumes that performance deteriorates gradually, the other assumes that performance deteriorates suddenly. We consider a variety of policies for governing when to remap. In order to evaluate these policies, statistical models of problem behaviors are developed. Simulation results are presented which compare simple policies with computationally expensive optimal decision policies; these results demonstrate that for each problem type, the proposed simple policies are effective and robust

High pressure cosmochemistry applied to major planetary interiors: Experimental studies

The measurement of equilibria in binary fluid-solid systems in diamond anvil cells, represents a major advance of the art of high-pressure experimentation. Vibrational spectroscopy, direct visual observations, and X-ray diffraction crystallography of materials confined in externally heated cells are the primary experimental probes being used. Adiabats in these systems are being measured in order to constrain models of heat flow in these bodies and to detect phase transitions by thermal anomalies. Other studies are directed toward interpreting high pressure reactions in these systems that are suggested by shockwave measurements, and developing methods for reaching high temperatures and high pressures of planetary interest in diamond cells. The overall objective of this project is to determine the properties of the H2-He-H2O-HN3-CH4 system and related small-molecule systems that are needed to constrain theoretical models of the interiors of the major planets

High pressure cosmochemistry applied to major planetary interiors: Experimental studies

Progress is reported in the development of the P-T-X diagram for 0 less than or = X less than or = 0.50 and in the development of techniques for measuring adiabats of phases of NH3-H2O. The partial phase diagram is presented, investigations of the compositions of ammonia ices are described, and methods for obtaining the infrared spectra of ices are discussed