检索结果-内蒙古大学图书馆

Publisher Correction: Re-analysis of public genetic data reveals a rare X-chromosomal variant associated with type 2 diabetes

引用

Nature communications 2018年第1期9卷 2162页

作者： Sílvia Bonàs-Guarch Marta Guindo-Martínez Irene Miguel-Escalada Niels Grarup David Sebastian Elias Rodriguez-Fos Friman Sánchez Mercè Planas-Fèlix Paula Cortes-Sánchez Santi González Pascal Timshel Tune H Pers Claire C Morgan Ignasi Moran Goutham Atla Juan R González Montserrat Puiggros Jonathan Martí Ehm A Andersson Carlos Díaz Rosa M Badia Miriam Udler Aaron Leong Varindepal Kaur Jason Flannick Torben Jørgensen Allan Linneberg Marit E Jørgensen Daniel R Witte Cramer Christensen Ivan Brandslund Emil V Appel Robert A Scott Jian'an Luan Claudia Langenberg Nicholas J Wareham Oluf Pedersen Antonio Zorzano Jose C Florez Torben Hansen Jorge Ferrer Josep Maria Mercader David Torrents Barcelona Supercomputing Center (BSC) Joint BSC-CRG-IRB Research Program in Computational Biology 08034 Barcelona Spain. Genomic Programming of Beta-cells Laboratory Institut d'Investigacions August Pi i Sunyer (IDIBAPS) 08036 Barcelona Spain. Instituto de Salud Carlos III Centro de Investigación Biomédica en Red de Diabetes y Enfermedades Metabólicas Asociadas (CIBERDEM) 28029 Madrid Spain. Section of Epigenomics and Disease Department of Medicine Imperial College London London W12 0NN UK. The Novo Nordisk Foundation Center for Basic Metabolic Research Section for Metabolic Genetics Faculty of Health and Medical Sciences University of Copenhagen 2100 Copenhagen Denmark. Institute for Research in Biomedicine (IRB Barcelona) The Barcelona Institute of Science and Technology Baldiri Reixac 10-12 08028 Barcelona Spain. Departament de Bioquímica i Biomedicina Molecular Facultat de Biologia Universitat de Barcelona 08028 Barcelona Spain. Computer Sciences Department Barcelona Supercomputing Center (BSC-CNS) 08034 Barcelona Spain. Department of Epidemiology Research Statens Serum Institut 2300 Copenhagen Denmark. Division of Endocrinology and Center for Basic and Translational Obesity Research Boston Children's Hospital Boston MA 02116 USA. Medical and Population Genetics Program Broad Institute of MIT and Harvard Cambridge MA 02142 USA. ISGlobal Centre for Research in Environmental Epidemiology (CREAL) 08003 Barcelona Spain. CIBER Epidemiología y Salud Pública (CIBERESP) 28029 Madrid Spain. Universitat Pompeu Fabra (UPF) 08003 Barcelona Spain. Artificial Intelligence Research Institute (IIIA) Spanish Council for Scientific Research (CSIC) 28006 Madrid Spain. Programs in Metabolism and Medical and Population Genetics Broad Institute of Harvard and MIT Cambridge MA 02142 USA. Diabetes Unit and Center for Genomic Medicine Massachusetts General Hospital Boston MA 02114 USA. Division of General Internal Medicine Massachusetts General Hospital Bost

In the originally published version of this Article, the affiliation details for Santi González, Jian'an Luan and Claudia Langenberg were inadvertently omitted. Santi González should have been affiliated with 'Barcelona Supercomputing Center (BSC), Joint BSC-CRG-IRB research Program in Computational Biology, 08034 Barcelona, Spain', and Jian'an Luan and Claudia Langenberg should have been affiliated with 'MRC Epidemiology Unit, University of Cambridge School of Clinical Medicine, Cambridge Biomedical Campus, Cambridge CB2 0QQ, UK'. Furthermore, the abstract contained an error in the SNP ID for the rare variant in chromosome Xq23, which was incorrectly given as rs146662057 and should have been rs146662075. These errors have now been corrected in both the PDF and HTML versions of the Article.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Down to Earth - How to Visualize Traffic on High-dimensional Torus Networks

Down to Earth - How to Visualize Traffic on High-dimensional...

引用

Workshop on Visual Performance Analysis (VPA)

作者： Lucas Theisen Aamer Shah Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany

High-dimensional torus networks are becoming common in flagship HPC systems, with five of the top ten systems in June 2014 having networks with more than three dimensions. Although such networks combine performance with scalability at reasonable cost, the challenge of how to achieve optimal performance remains. Tools are needed to help understand how well the traffic is distributed among the many dimensions. This involves not only capturing network traffic but also its comprehensible visualization. However, visualizing such networks requires projecting multiple dimensions onto a two-dimensional screen, which is naturally challenging. To tackle this problem, in this position paper, we propose a visualization technique which can display traffic on torus networks with up to six dimensions. Our fundamental approach is to simultaneously present multiple views of the same network section, with each view visualizing different dimensions. Furthermore, we leverage the multiple-coordinate system concept and combine it with a customized polygon view to provide both a global and a zoomed-in perspective of the network. By interactively linking all the views, our technique makes it possible to analyze how the communication pattern of an application is mapped onto a network.

关键词： Data visualization Visualization Monitoring Measurement Educational institutions Joining processes Hardware

来源：评论

学校读者我要写书评

暂无评论

How file access patterns influence interference among cluster applications

How file access patterns influence interference among cluste...

引用

IEEE International Conference on Cluster Computing

作者： Chih-Song Kuo Aamer Shah Akihiro Nomura Satoshi Matsuoka Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany Tokyo Institute of Technology Global Scientific Information and Computing Center Tokyo Japan

On large-scale clusters, tens to hundreds of applications can simultaneously access a parallel file system, leading to contention and in its wake to degraded application performance. However, the degree of interference depends on the specific file access pattern. On the basis of synchronized time-slice profiles, we compare the interference potential of different file access patterns. We consider both micro-benchmarks, to study the effects of certain patterns in isolation, and realistic applications to gauge the severity of such interference under production conditions. In particular, we found that writing large files simultaneously with small files can slow down the latter at small chunk sizes but the former at larger chunk sizes. We further show that such effects can seriously affect the runtime of real applications-up to a factor of five in one instance. In the future, both our insights and profiling techniques can be used to automatically classify the interference potential between applications and to adjust scheduling decisions accordingly.

关键词： Interference Servers Throughput Benchmark testing Market research Degradation Aggregates

来源：评论

学校读者我要写书评

暂无评论

Acceldroid: Co-designed acceleration of Android bytecode

Acceldroid: Co-designed acceleration of Android bytecode

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Cheng Wang Youfeng Wu Marcelo Cintra Programming Systems Laboratory Microprocessor and Programming Research Intel Laboratories USA

ISBN: (纸本)9781467355247

A hardware/software co-designed processor transparently supports a ubiquitous ISA (e.g. ×86) with diversified and innovative microarchitectural implementations. It leverages co-designed HW features and dynamic binary translation (DBT) SW to morph existing binary programs to scale performance and save power. On such systems, the portable bytecode of modern dynamic languages (e.g. Java, JavaScript, etc.) is first translated into the code in the architecture ISA by the just-in-time (JIT) compilation in the bytecode virtual machine, and then into the code in the internal implementation ISA by the DBT. This not only incurs the translation overheads twice, but also brings significant emulation inefficiency as the DBT does not have the high level bytecode information. In this paper, we present AccelDroid, which accelerates the Android Dalvik bytecode execution on the HW/SW co-designed processor through direct bytecode translation in the DBT. Our experiments on a HW/SW co-designed Transmeta Efficeon machine show that AccelDroid can improve performance by 78% and save energy by 40% for the CaffeineMark 3.0 benchmark suite.

关键词： Optimization Computer architecture Androids Humanoid robots Software Emulation Java

来源：评论

学校读者我要写书评

暂无评论

Preserving the original MPI semantics in a virtualized processor environment

Preserving the original MPI semantics in a virtualized proce...

引用

作者： Rodrigues, Eduardo R. Navaux, Philippe O.A. Panetta, Jairo Mendes, Celso L. IBM Research Brazil Institute of Informatics UFRGS Brazil Center for Weather Forecasts and Climate Studies INPE Brazil Parallel Programming Laboratory UIUC United States

Processor virtualization is a technique in which a programmer divides a computation into many entities, which are mapped to the available processors. The number of these entities, referred to as virtual processors, is typically larger than the number of physical processors. For an MPI program, the user decomposes the computation into more MPI tasks than physical processors. This approach allows overlapping computation and communication, and enables load balancing. User-level threads are often used to implement these virtual processors because they are generally faster to create, manage and migrate than heavy processes or kernel threads. However, these threads present issues concerning private data because they break the private address space assumption typically made by MPI programs. In this paper, we propose a new approach to privatize data in user-level threads. This approach is based on thread-local storage (TLS), which is often used by kernel threads. We apply this technique so that MPI programs can be executed in a virtualized environment while preserving their original semantics. We show that this alternative has a more efficient context switch and lower migration cost and is simpler to implement than other approaches. © 2012 Elsevier B.V. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Resource Management System for Network-Attached Accelerator Clusters

A Dynamic Resource Management System for Network-Attached Ac...

引用

International Conference on Parallel Processing (ICPP)

作者： Suraj Prabhakaran Mohsin Iqbal Sebastian Rinke Felix Wolf German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany

ISBN: (纸本)9781479914487

Over the years, cluster systems have become increasingly heterogeneous by equipping cluster nodes with one or more accelerators such as graphic processing units (GPU). These devices are typically attached to a compute node via PCI Express. As a consequence, batch systems such as TORQUE/Maui and SLURM have been extended to be aware of those additional resources tightly coupled with compute nodes. Recent advances in accelerator technology have given rise to the possibility of using network-attached accelerators in addition to node-attached accelerators. However, current batch systems do not support this new usage scenario of accelerators. This work focuses on the support for batch systems for allocating network-attached accelerators. The most important feature of the proposed batch system is its ability to dynamically allocate network-attached accelerators to jobs at application runtime. We discuss our extensions to the TORQUE and Maui batch system and elaborate on its features in the Dynamic Accelerator-Cluster Architecture, which describes an integration of network-attached accelerators into a cluster system. We also evaluate the dynamic allocation scenarios and show how batch systems can be designed to provide support for more flexible and dynamic cluster systems.

关键词： Resource management Computer architecture Dynamic scheduling Torque Graphics processing units Servers Method of moments

来源：评论

学校读者我要写书评

暂无评论

Generic discounting evaluation approach for urban image classification

Generic discounting evaluation approach for urban image clas...

引用

2013 International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making, IUKM 2013

作者： Samet, Ahmed Hammami, Imen Lefèvre, Eric Hamouda, Atef Laboratory of Research in Programming Algorithmic and Heuristic Faculty of Science of Tunis Tunisia Univ. Lille Nord de France UArtois EA 3926 LGI2A 62400 Báthune France

ISBN: (纸本)9783642395147

Belief function theory provides a robust framework for uncertain information modeling. It also offers several fusion tools in order to profit from multi-source context. Nevertheless, fusion is a sensible task where conflictual information may appear especially when sources are unreliable. Therefore, measuring source's reliability has been the center of many research and development. Existing solutions for source's reliability estimation are based on the assumption that distance is the only factor for conflictual situations. Indeed, integrating only distance measures to estimate source's reliability is not sufficient where source's confusion may be also considered as conflict origin. In this paper, we tackle reliability estimation and we introduce a new discounting operator that considers those two possible conflict origins. We propose an automatic method for discounting factor calculation. Those factors are integrated on belief classifier and tested on high-resolution image classification problem. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Capturing inter-application interference on clusters

Capturing inter-application interference on clusters

引用

IEEE International Conference on Cluster Computing

作者： Aamer Shah Felix Wolf Sergey Zhumatiy Vladimir Voevodin German Research School for Simulation Sciences Laboratory for Parallel Programming Moscow State University Research Computing Center

Cluster systems usually run several applications-often from different users-concurrently, with individual applications competing for access to shared resources such as the file system or the network. Low application performance is therefore not always the result of inefficient program design, but may instead be caused by interference from outside. However, knowing the difference is essential for an appropriate response. Unfortunately, traditional performance-analysis techniques consider an application always in isolation, without the ability to compare its performance to the overall performance conditions on the system when it was executed. In this paper, we present a novel approach of how to correlate the performance behavior of applications running side by side. To accomplish this, we divide the application runtime into fine-grained time slices whose boundaries are synchronized across the entire system. Mapping performance data related to shared resources onto these time slices, we are able to establish the simultaneity of their usage across jobs, which can be indicative of inter-application interference. Our experiments show that such interference effects, for which the developer is usually not to blame, can degrade application performance significantly.

关键词： Interference Noise Benchmark testing Measurement Graphics processing units Runtime Hardware

来源：评论

学校读者我要写书评

暂无评论

A Distributed Polling with Probabilistic Privacy

A Distributed Polling with Probabilistic Privacy

引用

Reliable Distributed Systems

作者： Yahya Benkaouz Rachid Guerraoui Mohammed Erradi Florian Huc Networking and Distributed Systems Research Group Mohammed V-Souissi University Rabat Morocco Distributed Programming Laboratory EPFL Lausanne Switzerland

In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptography. PDP is an overlay-based protocol where a subset of participants may use a simple sharing scheme to express their votes. In a system of M participants arranged in groups of size N where at least 2k-1 participants are honest, PDP bounds the probability for a given participant to have its vote recovered with certainty by a coalition of B dishonest participants by π(B/N) (k+1) , where π is the proportion of participants splitting their votes, and k a privacy parameter. PDP bounds the impact of dishonest participants on the global outcome by 2(kα + BN), where represents the number of dishonest nodes using the sharing scheme.

关键词： Protocols Privacy Cryptography Complexity theory Probabilistic logic Reliability Collaboration

来源：评论

学校读者我要写书评

暂无评论

SMARQ: Software-Managed Alias Register Queue for Dynamic Optimizations 45

SMARQ: Software-Managed Alias Register Queue for Dynamic Opt...

引用

45th IEEE/ACM Annual International Symposium on Microarchitecture (MICRO)

作者： Wang, Cheng Wu, Youfeng Rong, Hongbo Park, Hyunchul Programming Systems Laboratory Microprocessor and Programming Research Intel Laboratories USA

ISBN: (纸本)9780769549248;9781467348195

Traditional alias analysis is expensive and ineffective for dynamic optimizations. In practice, dynamic optimization systems perform memory optimizations speculatively, and rely on hardware, such as alias registers, to detect memory aliases at runtime. Existing hardware alias detection schemes either cannot scale up to a large number of alias registers or may introduce false positives. Order-based alias detection overcomes the limitations. However, it brings considerable challenges as how software can efficiently manage the alias register queue and impose restrictions on optimizations. In this paper, we present SMARQ, a Software-Managed Alias Register Queue, which manages the alias register queue efficiently and supports more aggressive speculative optimizations. We conducted experiments with a dynamic optimization system on a VLIW processor that has 64 alias registers. The experiments on a suite of SPECFP2000 benchmarks show that SMARQ improves the overall performance by 39% as compared to the case without hardware alias detection. By scaling up to a large number (from 16 to 64) of alias registers, SMARQ improves performance by 10%. Compared to a technique with false positives (similar to Itanium), SMARQ improves performance by 13%. To reduce the chance of alias register overflow, the novel alias register allocation algorithm in SMARQ reduces the alias register working set by 74% as compared to a straightforward alias register allocation based on program order.

关键词： alias register

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：