Polytechnic University of Catalonia

About: Polytechnic University of Catalonia is a education organization based out in Barcelona, Spain. It is known for research contribution in the topics: Finite element method & Population. The organization has 16006 authors who have published 45325 publications receiving 949306 citations. The organization is also known as: UPC - BarcelonaTECH & Technical University of Catalonia.

Structure and Dynamics of Liquid Ethanol

Abstract: Molecular dynamics simulations of liquid ethanol at four thermodynamic states ranging from T = 173 K to T = 348 K were carried out using the transferable OPLS potential model of Jorgensen (J. Phys. Chem. 1986, 90, 1276). Both static and dynamic properties are analyzed. The resulting properties show an overall agreement with available experimental data. Special attention is paid to the hydrogen bonds and to their influence on the molecular behavior. Results for liquid ethanol are compared with those for methanol in earlier computer simulation studies.

Left-truncated Data With Age as Time Scale: An Alternative for Survival Analysis in the Elderly Population

Abstract: Background The standard approach for survival analysis of the elderly population is to define the survival time as the elapsed time from entry into the study until death, and to adjust by age using stratification and regression procedures. However, the interest is in the study of the aging process and the risk factors related to it, not in the use of time-on-study as the time scale. Here, we present methods to use age as the time scale and compare inferences and interpretations with those obtained using the standard approach. Methods A total of 1,315 individuals aged 65 years or older from the city of Barcelona, Spain, were interviewed in 1986 (baseline). The vital status of the cohort was assessed in October 1994. To illustrate the usefulness of age as time scale (alternative approach) instead of time-on-study in the survival analysis of the elderly population, both methods were used to assess the relationship between baseline functional capacity and mortality. Results Using the alternative approach, we observed that 50% of the sample died at age 80.6 years; this information could not be estimated with the standard approach. Using age as a covariate in the standard analysis with time-on-study as the time scale and using age as the time scale in the alternative analysis, the association of functional capacity at baseline and mortality was of similar magnitude under both analyses. Nevertheless, using the alternative approach, relative risks were slightly lower, and the adjustment by age was tight and was not subject to the inherent assumptions in regression models of the functional relationship of independent variables with outcome. We illustrated the methods with fixed covariates (i.e., gender) and baseline values of time-dependent covariates (i.e., functional capacity), but we discussed the extension of our methods for the analysis of time-dependent covariates measured at several visits in a cohort study. Methods proposed here are easily implemented with widely available statistical software packages. Conclusions Although the use of standard survival analysis generally produces correct estimates, the use of age as time scale is deemed more appropriate for survival analysis of the elderly: Inferences are easier to interpret and final models are simpler. We therefore recommend the use of age as time scale for survival analysis of the elderly population.

Mitosis compiler: an infrastructure for speculative threading based on pre-computation slices

Abstract: Speculative parallelization can provide significant sources of additional thread-level parallelism, especially for irregular applications that are hard to parallelize by conventional approaches. In this paper, we present the Mitosis compiler, which partitions applications into speculative threads, with special emphasis on applications for which conventional parallelizing approaches fail.The management of inter-thread data dependences is crucial for the performance of the system. The Mitosis framework uses a pure software approach to predict/compute the thread's input values. This software approach is based on the use of pre-computation slices (p-slices), which are built by the Mitosis compiler and added at the beginning of the speculative thread. P-slices must compute thread input values accurately but they do not need to guarantee correctness, since the underlying architecture can detect and recover from misspeculations. This allows the compiler to use aggressive/unsafe optimizations to significantly reduce their overhead. The most important optimizations included in the Mitosis compiler and presented in this paper are branch pruning, memory and register dependence speculation, and early thread squashing.Performance evaluation of Mitosis compiler/architecture shows an average speedup of 2.2.

Enabling preemptive multiprogramming on GPUs

Abstract: GPUs are being increasingly adopted as compute accelerators in many domains, spanning environments from mobile systems to cloud computing. These systems are usually running multiple applications, from one or several users. However GPUs do not provide the support for resource sharing traditionally expected in these scenarios. Thus, such systems are unable to provide key multiprogrammed workload requirements, such as responsiveness, fairness or quality of service.In this paper, we propose a set of hardware extensions that allow GPUs to efficiently support multiprogrammed GPU workloads. We argue for preemptive multitasking and design two preemption mechanisms that can be used to implement GPU scheduling policies. We extend the architecture to allow concurrent execution of GPU kernels from different user processes and implement a scheduling policy that dynamically distributes the GPU cores among concurrently running kernels, according to their priorities. We extend the NVIDIA GK110 (Kepler) like GPU architecture with our proposals and evaluate them on a set of multiprogrammed workloads with up to eight concurrent processes. Our proposals improve execution time of high-priority processes by 15.6x, the average application turnaround time between 1.5x to 2x, and system fairness up to 3.4x