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

SPT clusters with DES and HST weak lensing. I. cluster lensing and Bayesian population modeling of multiwavelength cluster datasets

引用

Physical Review D 2024年第8期110卷 083509页

作者： S. Bocquet S. Grandis L. E. Bleem M. Klein J. J. Mohr M. Aguena A. Alarcon S. Allam S. W. Allen O. Alves A. Amon B. Ansarinejad D. Bacon M. Bayliss K. Bechtol M. R. Becker B. A. Benson G. M. Bernstein M. Brodwin D. Brooks A. Campos R. E. A. Canning J. E. Carlstrom A. Carnero Rosell M. Carrasco Kind J. Carretero R. Cawthon C. Chang R. Chen A. Choi J. Cordero M. Costanzi L. N. da Costa M. E. S. Pereira C. Davis J. DeRose S. Desai T. de Haan J. De Vicente H. T. Diehl S. Dodelson P. Doel C. Doux A. Drlica-Wagner K. Eckert J. Elvin-Poole S. Everett I. Ferrero A. Ferté A. M. Flores J. Frieman J. García-Bellido M. Gatti G. Giannini M. D. Gladders D. Gruen R. A. Gruendl I. Harrison W. G. Hartley K. Herner S. R. Hinton D. L. Hollowood W. L. Holzapfel K. Honscheid N. Huang E. M. Huff D. J. James M. Jarvis G. Khullar K. Kim R. Kraft K. Kuehn N. Kuropatkin F. Kéruzoré S. Lee P.-F. Leget N. MacCrann G. Mahler A. Mantz J. L. Marshall J. McCullough M. McDonald J. Mena-Fernández R. Miquel J. Myles A. Navarro-Alsina R. L. C. Ogando A. Palmese S. Pandey A. Pieres A. A. Plazas Malagón J. Prat M. Raveri C. L. Reichardt J. Roberson R. P. Rollins A. K. Romer C. Romero A. Roodman A. J. Ross E. S. Rykoff L. Salvati C. Sánchez E. Sanchez D. Sanchez Cid A. Saro T. Schrabback M. Schubnell L. F. Secco I. Sevilla-Noarbe K. Sharon E. Sheldon T. Shin M. Smith T. Somboonpanyakul B. Stalder A. A. Stark V. Strazzullo E. Suchyta M. E. C. Swanson G. Tarle C. To M. A. Troxel I. Tutusaus T. N. Varga A. von der Linden N. Weaverdyck J. Weller P. Wiseman B. Yanny B. Yin M. Young Y. Zhang J. Zuntz University Observatory Faculty of Physics Universität Innsbruck Institut für Astro- und Teilchenphysik Technikerstr. 25/8 6020 Innsbruck Austria Argonne National Laboratory 9700 South Cass Avenue Lemont Illinois 60439 USA Kavli Institute for Cosmological Physics University of Chicago Chicago Illinois 60637 USA Max Planck Institute for Extraterrestrial Physics Gießenbachstr. 1 85748 Garching Germany Laboratório Interinstitucional de e-Astronomia - LIneA Rua Gal. José Cristino 77 Rio de Janeiro RJ-20921-400 Brazil Fermi National Accelerator Laboratory P. O. Box 500 Batavia Illinois 60510 USA Kavli Institute for Particle Astrophysics and Cosmology Stanford University 452 Lomita Mall Stanford California 94305 USA Department of Physics Stanford University 382 Via Pueblo Mall Stanford California 94305 USA SLAC National Accelerator Laboratory 2575 Sand Hill Road Menlo Park California 94025 USA Department of Physics University of Michigan Ann Arbor Michigan 48109 USA Institute of Astronomy University of Cambridge Madingley Road Cambridge CB3 0HA United Kingdom Kavli Institute for Cosmology University of Cambridge Madingley Road Cambridge CB3 0HA United Kingdom School of Physics University of Melbourne Parkville Victoria 3010 Australia Institute of Cosmology and Gravitation University of Portsmouth Portsmouth PO1 3FX United Kingdom Department of Physics University of Cincinnati Cincinnati Ohio 45221 USA Physics Department 2320 Chamberlin Hall University of Wisconsin-Madison 1150 University Avenue Madison Wisconsin 53706-1390 USA Department of Astronomy and Astrophysics University of Chicago Chicago Illinois 60637 USA Fermi National Accelerator Laboratory Batavia Illinois 60510-0500 USA Department of Physics and Astronomy University of Pennsylvania Philadelphia Pennsylvania 19104 USA Department of Physics and Astronomy University of Missouri 5110 Rockhill Road Kansas City Missouri 64110 USA Department of Physics and Astronomy University Coll

We present a Bayesian population modeling method to analyze the abundance of galaxy clusters identified by the South Pole Telescope (SPT) with a simultaneous mass calibration using weak gravitational lensing data from the Dark Energy Survey (DES) and the Hubble Space Telescope (HST). We discuss and validate the modeling choices with a particular focus on a robust, weak-lensing-based mass calibration using DES data. For the DES Year 3 data, we report a systematic uncertainty in weak-lensing mass calibration that increases from 1% at z=0.25 to 10% at z=0.95, to which we add 2% in quadrature to account for uncertainties in the impact of baryonic effects. We implement an analysis pipeline that joins the cluster abundance likelihood with a multiobservable likelihood for the Sunyaev-Zel’dovich effect, optical richness, and weak-lensing measurements for each individual cluster. We validate that our analysis pipeline can recover unbiased cosmological constraints by analyzing mocks that closely resemble the cluster sample extracted from the SPT-SZ, SPTpol ECS, and SPTpol 500d surveys and the DES Year 3 and HST-39 weak-lensing datasets. This work represents a crucial prerequisite for the subsequent cosmological analysis of the real dataset.

关键词： Cosmological parameters Gravitational lenses Large scale structure of the Universe

来源：评论

学校读者我要写书评

暂无评论

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding

引用

Communications in Theoretical Physics 2016年第11期65卷 501-508页

作者：赖红罗明星 Josef Pieprzyk 陶丽刘志明 Mehmet A.Orgun School of Computer and Information Science Southwest University Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong University School of Electrical Engineering and Computer Science Queensland University of Technology Institute of Computer Science Polish Academy of Sciences Department of Computing Macquarie University Faculty of Information Technology Macao University of Science and Technology

In this paper, we develop a large-capacity quantum digital secret sharing(QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum(OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie'(Bob') detected value.

关键词： Fibonacci-and Lucas-valued orbital angular momentum(OAM) states the first kind of Chebyshev maps lower error rates longer destances

来源：评论

学校读者我要写书评

暂无评论

HCOpt: An automatic optimizer for configuration parameters of Hadoop 2nd

HCOpt: An automatic optimizer for configuration parameters o...

引用

2nd International Conference on Human Centered computing, HCC 2016

作者： Zhang, Xiong Zeng, Linxi Shi, Xuanhua Wu, Song Xie, Xia Jin, Hai Services Computing Technology and System Laboratory Big Data Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319318530

MapReduce is an efficient tool for data-intensive applications. Hadoop, an open-source implementation of MapReduce, has been widely adopted and experienced by some enterprises and scientific computing communities. However, when users intend to run a MapReduce program in Hadoop, they have to set a number of configuration parameters to make sure the program runs efficiently. Users often run into performance problems because they are unaware of how to set these parameters. To address these performance problems, we focus on the optimization opportunities presented by the high configurability of Hadoop, and propose an automation tool named HCOpt for performance optimization of Hadoop configuration parameters. HCOpt uses a Profile Engine to collect monitoring information from running MapReduce programs, a Prediction Engine to estimate the performance of a given Hadoop configuration and a genetic-based search algorithm to find an optimized configuration in the large search space. Our evaluation shows that HCOpt reduces the job completion time of Hadoop applications by up to 20 % when compared to applications run with configuration parameters that suggested by the rule-based optimization. © Springer International Publishing Switzerland 2016.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

An environment for sustainable research software in Germany and beyond: Current state, open challenges, and call for action

arXiv

引用

arXiv 2020年

作者： Anzt, Hartwig Bach, Felix Druskat, Stephan Löffler, Frank Loewe, Axel Renard, Bernhard Y. Seemann, Gunnar Struck, Alexander Achhammer, Elke Aggarwal, Piush Appel, Franziska Bader, Michael Brusch, Lutz Busse, Christian Chourdakis, Gerasimos Dabrowski, Piotr W. Ebert, Peter Flemisch, Bernd Friedl, Sven Fritzsch, Bernadette Funk, Maximilian D. Gast, Volker Goth, Florian Grad, Jean-Noël Hermann, Sibylle Hohmann, Florian Janosch, Stephan Kutra, Dominik Linxweiler, Jan Muth, Thilo Peters-Kottig, Wolfgang Rack, Fabian Raters, Fabian H.C. Rave, Stephan Reina, Guido Reißig, Malte Ropinski, Timo Schaarschmidt, Joerg Seibold, Heidi Thiele, Jan P. Uekerman, Benjamin Unger, Stefan Weeber, Rudolf Germany Innovative Computing Lab University of Tennessee KnoxvilleTN United States Department of English Studies Friedrich Schiller University Jena Germany Germany Department of Computer Science Humboldt-Universität zu Berlin Germany Heinz Nixdorf Chair for Distributed Information Systems Friedrich Schiller University Jena Germany Michael Stifel Center Jena Germany Center for Computation and Technology Louisiana State University Baton Rouge United States Germany Robert Koch Institute Berlin Germany Hasso Plattner Institute Faculty of Digital Engineering University of Potsdam Germany Institute for Experimental Cardiovascular Medicine University Heart Centre Freiburg Bad Krozingen Germany Faculty of Medicine University of Freiburg Freiburg Germany Matters of Activity. Image Space Material. Cluster of Excellence at Humboldt-Universität zu Berlin Germany Technische Universität München Germany Language Technology Lab Universität Duisburg-Essen Germany Germany Department of Informatics Technical University of Munich Germany Technische Universität Dresden Germany Deutsches Krebsforschungszentrum Heidelberg Germany Scientific Computing in Computer Science Technical University Munich Germany School of Computing Communication and Business Hochschule für Technik und Wirtschaft Berlin Germany Center for Bioinformatics Saar Saarland Informatics Campus Germany Institute for Modelling Hydraulic and Environmental Systems University of Stuttgart Germany Berlin Institute of Health Germany Scientific Computing Alfred Wegener Institute Helmholtz Center for Polar and Marine Research Bremerhaven Germany Max-Planck-Gesellschaft e.V. Institut für Theoretische Physik und Astrophysik Universität Würzburg Germany Institut für Computerphysik University of Stuttgart Germany University Library University of Stuttgart Germany Universität Bremen Germany Max Planck Institute of Molecular Cell Biology and Genetics Dresden Germany European Molecular Biology Laboratory Heidelb

Research software has become a central asset in academic research. It optimizes existing and enables new research methods, implements and embeds research knowledge, and constitutes an essential research product in itself. Research software must be sustainable in order to understand, replicate, reproduce, and build upon existing research or conduct new research effectively. In other words, software must be available, discoverable, usable, and adaptable to new needs, both now and in the future. Research software therefore requires an environment that supports sustainability. Hence, a change is needed in the way research software development and maintenance are currently motivated, incentivized, funded, structurally and infrastructurally supported, and legally treated. Failing to do so will threaten the quality and validity of research. In this paper, we identify challenges for research software sustainability in Germany and beyond, in terms of motivation, selection, research software engineering personnel, funding, infrastructure, and legal aspects. Besides researchers, we specifically address political and academic decision-makers to increase awareness of the importance and needs of sustainable research software practices. In particular, we recommend strategies and measures to create an environment for sustainable research software, with the ultimate goal to ensure that software-driven research is valid, reproducible and sustainable, and that software is recognized as a first class citizen in research. This paper is the outcome of two workshops run in Germany in 2019, at deRSE19 - the first International Conference of Research Software Engineers in Germany - and a dedicated DFG-supported follow-up workshop in Berlin. Copyright © 2020, The Authors. All rights reserved.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Efficient multiple-reference temporal error concealment algorithm based on H.264/AVC 2nd

Efficient multiple-reference temporal error concealment algo...

引用

2nd International Conference on Human Centered computing, HCC 2016

作者： Yu, Chen Cheng, Chao Jin, Hai Zhou, Jingli Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319318530

Temporal error concealment at the video communication receiver recovers damaged blocks using temporal information redundancy. To enhance the quality of reconstructed image, a multiple-reference temporal error concealment algorithm based on H.264/AVC was proposed. Firstly, a pre-concealment is implemented to improve video frame;then the fractional pixel boundary matching algorithm and search algorithm are used to evaluate the candidate motion vectors from a number of reference frames, and the motion vector (MV) giving the minimum boundary matching distortion (MBMD) is selected as optimal motion vector;finally it is used to recover the damaged block and the video frame quality can be improved further. For various video sequences and different macro-block loss ratio, experimental results show that the proposed algorithm is significantly better than traditional temporal error concealment algorithms such as BMA and BM from both objectively and subjectively. At the loss ratio of 10 %, improvements of the proposed algorithm are more than 0.8~3.7 dB compared to that of other algorithms. © Springer International Publishing Switzerland 2016.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Runtime-aware adaptive scheduling in stream processing

Runtime-aware adaptive scheduling in stream processing

引用

作者： Liu, Yuan Shi, Xuanhua Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Long-running stream applications usually share the same fundamental computational infrastructure. To improve the efficiency of data processing in stream processing systems, a data analysis operator could be partitioned into n parallel tasks. The partitioned tasks are usually deployed on m nodes coexisting with other application operators. Because the node performance can vary in unpredictable ways (i.e., (1) stream input rates may fluctuate and (2) computational resource availability varies as other applications are affected), the nodes have different processing steps, and the slow node determines the operator performance. Hence, the tasks should be redistributed at runtime for stream applications to meet their strict latency requirements. Our key idea is to redistribute the tasks to the best node dynamically adaptive to resource or load fluctuations. In this paper, we present a runtime-aware adaptive schedule mechanism that aims at minimizing the operator processing latency and minimizing the latency difference between different nodes' tasks. We propose a new abstraction called performance cost ratio (PCR) that evaluates the node performance. The higher the node's PCR is, the less cost the node will pay for processing one tuple, and the more tasks should be deployed on it. In a scheduling, we first sort tasks descendingly by their loads and sort nodes by their PCR. Then we reassign the amount of computation according to the node's PCR to keep the node's PCR and its input rate the same or in similar proportion in all PCRs. The PCR-based quantitative algorithm applies itself to make tasks loads quantized to the processing capacity of nodes, move the minimum amount of operator's tasks, and keep the tasks local at the same time. We have implemented a runtime-aware adaptive scheduler as an extension to Storm and evaluated this strategy. We achieve the optimization goal using less computational resources. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wil

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Secure cryptographic functions via virtualization-based outsourced computing

Secure cryptographic functions via virtualization-based outs...

引用

作者： Qiang, Weizhong Zhang, Kang Dai, Weiqi Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cryptographic functions, such as encryption/decryption libraries, are common and important tools for applications to enhance confidentiality of the data. However, these functions could be compromised by subtle attacks launched by untrusted operating system or other applications, and sensitive keys or cryptographic procedures could then be compromised. In this paper, based on virtualization technology, we propose a novel approach that outsources the cryptographic functions in one virtual machine (VM) into another dedicated VM, so that sensitive keys and the cryptographic procedures are only contained by this VM with specific purpose. We also propose a prototype, called cryptographic function assurance (CFA), to enhance the security of cryptographic functions. Taking OpenSSL as an example, CFA allows those applications that use OpenSSL library to transparently utilize CFA to protect the cryptographic functions. We present the detailed implementation, as well as the security analysis of CFA. We also give the performance evaluation for OpenSSL's interfaces and Apache httpd, to show the overhead caused by the integration of CFA. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

CDMCR: multi-level fault-tolerant system for distributed applications in cloud

CDMCR: multi-level fault-tolerant system for distributed app...

引用

作者： Qiang, Weizhong Jiang, Changqing Ran, Longbo Zou, Deqing Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cloud provides users with a new model of utilizing the computing infrastructure with the ability to perform parallel and distributed computations using elastic virtual cluster. However, the multi-level and complex features make cloud computing system more prone to failure. In this paper, we present a multi-level fault-tolerant system for distributed applications in cloud named Distributed-application oriented Multi-level Checkpoint/Restart for Cloud (CDMCR). The CDMCR system backups the complete state of applications periodically with a snapshot-based distributed checkpointing protocol, including file system state. Thus, we cannot only recover processes but also rollback data. A multi-level recovery strategy is proposed, which includes process-level recovery, virtual machine recreation, and host rescheduling, enabling comprehensive and efficient fault tolerance for different components in cloud. We deploy CDMCR as PaaS, so that users can be liberated from node management and system configuration and get access to fault-tolerant service conveniently. We have implemented this system based on the Xen virtualization platform and the OpenNebula cloud platform. Experiments on the prototype demonstrate the correctness of the system. Analysis shows that CDMCR does not cause message loss or data loss, and the backup time remains nearly constant as the number of nodes increases on virtual cluster. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for single top-quark production via flavour-changing neutral currents at 8 TeV with the ATLAS detector

引用

The European Physical Journal C 2022年第1期82卷 1-15页

作者： Aad, G. Abbott, B. Abdallah, J. Abdinov, O. Aben, R. Abolins, M. AbouZeid, O. S. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adamczyk, L. Adams, D. L. Adelman, J. Adomeit, S. Adye, T. Affolder, A. A. Agatonovic-Jovin, T. Agricola, J. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akerstedt, H. Åkesson, T. P. A. Akimov, A. V. Alberghi, G. L. Albert, J. Albrand, S. Alconada Verzini, M. J. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Alimonti, G. Alio, L. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Altheimer, A. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amako, K. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amorim, A. Amoroso, S. Amram, N. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, G. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Anger, P. Angerami, A. Anghinolfi, F. Anisenkov, A. V. Anjos, N. Annovi, A. Antonelli, M. Antonov, A. Antos, J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Arce, A. T. H. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Arnaez, O. Arnal, V. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Asai, S. Asbah, N. Ashkenazi, A. Åsman, B. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Aurousseau, M. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baak, M. A. Baas, A. E. Baca, M. J. Bacci, C. Bachacou, H. Bachas, K. Backes, M. Backhaus, M. Bagiacchi, P. Bagnaia, P. Bai, Y. Bain, T. Baines, J. T. Baker, O. K. Baldin, E. M. Balek, P. Balestri, T. Balli, F. Banas, E. Banerjee, Sw. Bannoura, A. A. E. Bansil, H. S. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisonzi, M. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barnovska, Z. Baroncelli, A. Barone, G. Barr, A. J. Barreiro, F. Barreiro Guimarães da Costa, J. Bartol CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman USA Institute of Physics Academia Sinica Taipei Taiwan Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam The Netherlands Department of Physics and Astronomy Michigan State University East Lansing USA Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene USA Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London UK AGH University of Science and Technology Faculty of Physics and Applied Computer Science Kraków Poland Physics Department Brookhaven National Laboratory Upton USA Department of Physics Northern Illinois University De Kalb USA Fakultät für Physik Ludwig-Maximilians-Universität München Munich Germany Particle Physics Department Rutherford Appleton Laboratory Didcot UK Oliver Lodge Laboratory University of Liverpool Liverpool UK Institute of Physics University of Belgrade Belgrade Serbia II Physikalisches Institut Georg-August-Universität Göttingen Germany Laboratório de Instrumentação e Física Experimental de Partículas-LIP Lisbon Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Department of Physics Boston University Boston USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Rome Italy Dipartimento di Fisica Università di Roma Tor Vergata Rome Italy Fysiska institutionen Lunds uni

来源：评论

学校读者我要写书评

暂无评论

Understanding and identifying latent data races cross-thread interleaving

引用

Frontiers of computer science 2015年第4期9卷 524-539页

作者： Long ZHEN~ Xiaofei LIAO Song WU Xuepeng FAN Hai JIN Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Data races are ubiquitous in multi-threaded ap- plications, but they are by no means easy to detect. One of the most important reasons is the complexity of thread in- terleavings. A volume of research has been devoted to the interleaving-insensitive detection. However, all the previous work focuses on the uniform detection （unknown to the char- acteristics of thread interleavings）, thereby making the detec- tion defective in either reporting false positives or suffering from prohibitive overhead. To cope with the problem above, we propose an efficient, precise, and sound step-by-step res- olution based on the characteristics of thread interleavings. We first try to tease apart the categories of thread interleav- ings from the several typical sources arising from the lock synchronizations. We then conduct a brief study and find a new and complex pattern the previous work cannot detect. It is also revealed that the simple pattern with the majority of thread interleavings can be resolved by a simple processing to achieve a big profit for the previous reordering-based design. Our final experimental results demonstrate the effectiveness of our empiricism-based approach, and show that 51.0% of execution time and 52.3 % of trace size arising from the state- of-the-art reordering technique can be saved through a quick filtering of the simple pattern with a negligible （4.45%） per- formance overhead introduced on-the-fly.

关键词： data race happens-before thread interleaving

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：