Reallocation Problems in Scheduling

In traditional on-line problems, such as scheduling, requests arrive over time, demanding available resources. As each request arrives, some resources may have to be irrevocably committed to servicing that request. In many situations, however, it may be possible or even necessary to reallocate previously allocated resources in order to satisfy a new request. This reallocation has a cost. This paper shows how to service the requests while minimizing the reallocation cost. We focus on the classic problem of scheduling jobs on a multiprocessor system. Each unit-size job has a time window in which it can be executed. Jobs are dynamically added and removed from the system. We provide an algorithm that maintains a valid schedule, as long as a sufficiently feasible schedule exists. The algorithm reschedules only a total number of O(min{log^* n, log^* Delta}) jobs for each job that is inserted or deleted from the system, where n is the number of active jobs and Delta is the size of the largest window.Comment: 9 oages, 1 table; extended abstract version to appear in SPAA 201

forqs: Forward-in-time Simulation of Recombination, Quantitative Traits, and Selection

forqs is a forward-in-time simulation of recombination, quantitative traits, and selection. It was designed to investigate haplotype patterns resulting from scenarios where substantial evolutionary change has taken place in a small number of generations due to recombination and/or selection on polygenic quantitative traits. forqs is implemented as a command- line C++ program. Source code and binary executables for Linux, OSX, and Windows are freely available under a permissive BSD license.Comment: preprint include Supplementary Information. https://bitbucket.org/dkessner/forq

Migrating medical communications software to a multi-tenant cloud environment

The rise of cloud computing has paved the way for many new applications. Many of these new cloud applications are also multi-tenant, ensuring multiple end users can make use of the same application instance. While these technologies make it possible to create many new applications, many legacy applications can also benefit from the added flexibility and cost-savings of cloud computing and multi-tenancy. In this paper, we describe the steps required to migrate a. NET-based medical communications application to the Windows Azure public cloud environment, and the steps required to add multi-tenancy to the application. We then discuss the advantages and disadvantages of our migration approach. We found that the migration to the cloud itself requires only a limited amount of changes to the application, but that this also limited the benefits, as individual instances would only be partially used. Adding multi-tenancy requires more changes, but when this is done, it has the potential to greatly reduce the cost of running the application

Near-term ecological forecasting for dynamic aeroconservation of migratory birds

Near-term ecological forecasting has the potential to mitigate negative impacts of human modifications on wildlife by directing efficient action through relevant and timely predictions. We used the U.S. avian migration system to highlight ecological forecasting applications for aeroconservation. We used millions of observations from 143 weather surveillance radars to construct and evaluate a migration forecasting system for nocturnal bird migration over the contiguous United States. We identified the number of nights of mitigation required to reduce the risk of aerial hazards to 50% of avian migrants passing a given area in spring and autumn based on dynamic forecasts of migration activity. We also investigated an alternative approach, that is, employing a fixed conservation strategy based on time windows that historically capture 50% of migratory passage. In practice, during both spring and autumn, dynamic forecasts required fewer action nights compared with fixed window selection at all locations (spring: mean of 7.3 more alert days; fall: mean of 12.8 more alert days). This pattern resulted in part from the pulsed nature of bird migration captured in the radar data, where the majority (54.3%) of birds move on 10% of a migration season\u27s nights. Our results highlight the benefits of near-term ecological forecasting and the potential advantages of dynamic mitigation strategies over static ones, especially in the face of increasing risks to migrating birds from light pollution, wind energy infrastructure, and collisions with structures

DReAM: Dynamic Re-arrangement of Address Mapping to Improve the Performance of DRAMs

The initial location of data in DRAMs is determined and controlled by the 'address-mapping' and even modern memory controllers use a fixed and run-time-agnostic address mapping. On the other hand, the memory access pattern seen at the memory interface level will dynamically change at run-time. This dynamic nature of memory access pattern and the fixed behavior of address mapping process in DRAM controllers, implied by using a fixed address mapping scheme, means that DRAM performance cannot be exploited efficiently. DReAM is a novel hardware technique that can detect a workload-specific address mapping at run-time based on the application access pattern which improves the performance of DRAMs. The experimental results show that DReAM outperforms the best evaluated address mapping on average by 9%, for mapping-sensitive workloads, by 2% for mapping-insensitive workloads, and up to 28% across all the workloads. DReAM can be seen as an insurance policy capable of detecting which scenarios are not well served by the predefined address mapping