Complexity of scheduling multiprocessor tasks with prespecified processor allocations

We investigate the computational complexity of scheduling multiprocessor tasks with prespecified processor allocations. We consider two criteria: minimizing schedule length and minimizing the sum of the task completion times. In addition, we investigate the complexity of problems when precedence constraints or release dates are involved

Rowan University\u27s converted triples: impacts on roommate relationships and fostering social density

The primary purpose of this study was to explore selected freshmen students that were assigned to triple rooms for the 2014-2015 academic year and see how a student\u27s assignment to a triple room impacted his or her roommate relationships and possibly led to the fostering of social density. The students were incoming freshmen in the class of 2018 living in Evergreen, Oak, or Laurel Halls and were either general freshmen or freshmen students participating in the Engineering Learning Community. At the end of the fall 2014 semester freshmen students assigned to quad, triple, double, and single rooms were surveyed to give feedback regarding their experiences living in their particular residential space with or without roommates. There was particular interest to see if the tripled rooms on Rowan University\u27s campus for this upcoming year, the 32 rooms within Oak, 31 rooms within Laurel, and the 118 rooms within Evergreen Hall, fostered social density and impacted a student\u27s roommate relationships compared to freshmen students living in quad, double, or single rooms in Evergreen, Oak, or Laurel Hall. Subjects reported that they were satisfied and having a positive experience with their residential environment and roommate(s). Furthermore, they reported that they did not feel their residential environment was overcrowded or socially dense. Overall, students in double and triple rooms stated they were very satisfied or satisfied with their current residential environment and the roommate relationship(s) they had built and maintained

A positive relationship between the abundance of ammonia oxidizing archaea and natural abundance δ15N of ecosystems

We present a significant relationship between the natural abundance isotopic composition of ecosystem pools and the abundance of a microbial gene. Natural abundance 15N of soils and soil DNA were analysed and compared with archaeal ammonia oxidizer abundance along an elevation gradient in northern Arizona and along a substrate age gradient in Hawai'i. There was a significant positive correlation between the abundance of archaeal amoA genes and natural abundance δ15N of total soil or DNA suggesting that ammonia oxidizing archaea play an important role in ecosystem N release. © 2013 Elsevier Ltd

RNA FRABASE 2.0: an advanced web-accessible database with the capacity to search the three-dimensional fragments within RNA structures

Background: Recent discoveries concerning novel functions of RNA, such as RNA interference, have contributed towards the growing importance of the field. In this respect, a deeper knowledge of complex three-dimensional RNA structures is essential to understand their new biological functions. A number of bioinformatic tools have been proposed to explore two major structural databases (PDB, NDB) in order to analyze various aspects of RNA tertiary structures. One of these tools is RNA FRABASE 1.0, the first web-accessible database with an engine for automatic search of 3D fragments within PDB-derived RNA structures. This search is based upon the user-defined RNA secondary structure pattern. In this paper, we present and discuss RNA FRABASE 2.0. This second version of the system represents a major extension of this tool in terms of providing new data and a wide spectrum of novel functionalities. An intuitionally operated web server platform enables very fast user-tailored search of three-dimensional RNA fragments, their multi-parameter conformational analysis and visualization. Description: RNA FRABASE 2.0 has stored information on 1565 PDB-deposited RNA structures, including all NMR models. The RNA FRABASE 2.0 search engine algorithms operate on the database of the RNA sequences and the new library of RNA secondary structures, coded in the dot-bracket format extended to hold multi-stranded structures and to cover residues whose coordinates are missing in the PDB files. The library of RNA secondary structures (and their graphics) is made available. A high level of efficiency of the 3D search has been achieved by introducing novel tools to formulate advanced searching patterns and to screen highly populated tertiary structure elements. RNA FRABASE 2.0 also stores data and conformational parameters in order to provide "on the spot" structural filters to explore the three-dimensional RNA structures. An instant visualization of the 3D RNA structures is provided. RNA FRABASE 2.0 is freely available at http://rnafrabase.cs.put.poznan.pl webcite. Conclusions: RNA FRABASE 2.0 provides a novel database and powerful search engine which is equipped with new data and functionalities that are unavailable elsewhere. Our intention is that this advanced version of the RNA FRABASE will be of interest to all researchers working in the RNA field

05441 Abstracts Collection -- Managing and Mining Genome Information: Frontiers in Bioinformatics

From 30.10.05 to 04.11.05, the Dagstuhl Seminar 05441 ``Managing and Mining Genome Information: Frontiers in Bioinformatics\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems

Heterogeneous systems are becoming more common on High Performance Computing (HPC) systems. Even using tools like CUDA and OpenCL it is a non-trivial task to obtain optimal performance on the GPU. Approaches to simplifying this task include Merge (a library based framework for heterogeneous multi-core systems), Zippy (a framework for parallel execution of codes on multiple GPUs), BSGP (a new programming language for general purpose computation on the GPU) and CUDA-lite (an enhancement to CUDA that transforms code based on annotations). In addition, efforts are underway to improve compiler tools for automatic parallelization and optimization of affine loop nests for GPUs and for automatic translation of OpenMP parallelized codes to CUDA. In this paper we present an alternative approach: a new computational framework for the development of massively data parallel scientific codes applications suitable for use on such petascale/exascale hybrid systems built upon the highly scalable Cactus framework. As the first non-trivial demonstration of its usefulness, we successfully developed a new 3D CFD code that achieves improved performance.Comment: Parallel Computing 2011 (ParCo2011), 30 August -- 2 September 2011, Ghent, Belgiu

04231 Abstracts Collection -- Scheduling in Computer and Manufacturing Systems

During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing Systems" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Diversity of Tanaidacea (Crustacea: Peracarida) in the World\u27s Oceans - How Far Have We Come?

Tanaidaceans are small peracarid crustaceans which occur in all marine habitats, over the full range of depths, and rarely into fresh waters. Yet they have no obligate dispersive phase in their life-cycle. Populations are thus inevitably isolated, and allopatric speciation and high regional diversity are inevitable; cosmopolitan distributions are considered to be unlikely or non-existent. Options for passive dispersion are discussed. Tanaidaceans appear to have first evolved in shallow waters, the region of greatest diversification of the Apseudomorpha and some tanaidomorph families, while in deeper waters the apseudomorphs have subsequently evolved two or three distinct phyletic lines. The Neotanaidomorpha has evolved separately and diversified globally in deep waters, and the Tanaidomorpha has undergone the greatest evolution, diversification and adaptation, to the point where some of the deep-water taxa are recolonizing shallow waters. Analysis of their geographic distribution shows some level of regional isolation, but suffers from inclusion of polyphyletic taxa and a general lack of data, particularly for deep waters. It is concluded that the diversity of the tanaidomorphs in deeper waters and in certain ocean regions remains to be discovered; that the smaller taxa are largely understudied; and that numerous cryptic species remain to be distinguished. Thus the number of species currently recognized is likely to be an order of magnitude too low, and globally the Tanaidacea potentially rival the Amphipoda and Isopoda in diversity

Two-Dimensional Cutting Problem

This paper deals with two-dimensional cutting problems. Firstly the complexity of the problem in question is estimated. Then, several known approaches for the regular (rectangular) and irregular (not necessarily rectangular) cutting problems are described. In the second part, a decision support system for cutting a rectangular sheet of material into pieces of arbitrary shapes, is presented. The system uses two earlier described methods which prefer different types of data and the user may decide which one is more suitable for the problem in question. After brief description of system data files and its manual, some experimental results are presented

From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation

Starting from a high-level problem description in terms of partial differential equations using abstract tensor notation, the Chemora framework discretizes, optimizes, and generates complete high performance codes for a wide range of compute architectures. Chemora extends the capabilities of Cactus, facilitating the usage of large-scale CPU/GPU systems in an efficient manner for complex applications, without low-level code tuning. Chemora achieves parallelism through MPI and multi-threading, combining OpenMP and CUDA. Optimizations include high-level code transformations, efficient loop traversal strategies, dynamically selected data and instruction cache usage strategies, and JIT compilation of GPU code tailored to the problem characteristics. The discretization is based on higher-order finite differences on multi-block domains. Chemora's capabilities are demonstrated by simulations of black hole collisions. This problem provides an acid test of the framework, as the Einstein equations contain hundreds of variables and thousands of terms.Comment: 18 pages, 4 figures, accepted for publication in Scientific Programmin