检索结果-南通市图书馆

Minimal Context-Switching Data Race Detection with Dataflow Tracking

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and system School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and system Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

Chronological Study of Coal-seam Water and its Implication on Gas Production in the South Qinshui Basin

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Geologica Sinica(English Edition) 2024年第1期98卷 207-219页

作者： CHEN Biying FANG Lujia LANG Yunchao XU Sheng LIU Congqiang ZHANG Luyuan HOU Xiaolin Institute of Surface-Earth system science School of Earth System ScienceTianjin UniversityTianjin 300072China Institute of Earth Environments Chinese Academy of SciencesXi’an 710061China

The knowledge of the residence time of formation water is fundamental to understanding the subsurface flow and hydrological *** better identify the origin and evolution of coal seam water and its impact on gas storage and production,this study collected coalbed methane co-produced water in the southeast Qinshui Basin and detected chemical and isotopic compositions,especially 36Cl and 129I *** calculated tracer ages of 129I(5.2–50.6 Ma)and 36Cl(0.13–0.76 Ma)are significantly younger than the age of coal-bearing formation(Pennsylvanian-Cisuralian),indicating freshwater recharge after coal *** model that utilises 129I/I and 36Cl/Cl ratios to constrain the timing of recharge and the proportion of recharge water reveals that over 60%of pre-anthropogenic meteoric water entered coal seams since 10 Ma and mixed with residue initial deposition water,corresponding to the basin inversion in *** spatial distribution of major ion concentrations reveals the primary recharge pathway for meteoric water from coal outcrops at the eastern margin to the basin *** study demonstrates the occurrence of higher gas production rates from wells that accept water recharge in recent times and suggests the possible potential of the non-stagnant zones for high gas production.

关键词： CBM co-produced water iodine-129 chlorine-36 water chemistry Qinshui Basin

维普期刊数据库

Applications of mercury stable isotopes for tracing volcanism in the geologic record

在线全文

学校读者我要写书评

暂无评论

science China Earth sciences 2024年第5期67卷 1436-1458页

作者： Qing GONG Ming-Xing LING Wang ZHENG State Key Laboratory of Nuclear Resources and Environment East China University of TechnologyNanchang 330013China school of Earth system science Institute of Surface-Earth System ScienceTianjin UniversityTianjin 300072China

Mercury(Hg)enrichments in ancient sediments have been used as a proxy of volcanism,especially large igneous province(LIP)***,considering the existence of other potential Hg sources besides volcanoes and the diverse factors(e.g.,organic matters,clay minerals,sulfide minerals and Fe oxides)that can affect Hg sequestration,there are considerable uncertainties to simply regard sedimentary Hg anomalies as signatures of volcanic *** stable isotopes,a promising tool for tracing the origins and transformations of Hg,have been increasingly used for determining the causes of Hg spikes and understanding the geochemical behavior of Hg in the geologic *** date,lots of researches have applied Hg concentrations and Hg isotopes to identify LIP volcanisms linking with significant geological events such as mass extinctions,ocean anoxic events and other environmental perturbations that mainly occurred in the ***,the results in previous studies clearly show that not all Hg enrichments are derived from volcanic inputs,which emphasize the need for more caution in using Hg as a fingerprint of *** a better understanding of Hg isotopes in the future,there will be important implications for Hg isotopes to reconstruct volcanic activities in the rock records and their impacts on biological evolution.

关键词： Mercury stable isotopes Large igneous province Mass extinction event Ocean anoxic event

维普期刊数据库

Precise control of page cache for containers

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data Technology and system Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & Technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data Technology and system School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and system Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

Answering reachability queries with ordered label constraints over labeled graphs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN Hai JIN National Engineering Research Center for Big Data Technology and system Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

Analysis of amino acid enantiomers in ambient aerosols:Effects and removal of coexistent aerosol matrix

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Environmental sciences 2024年第3期137卷 732-740页

作者： Ying Li Xiaoying Li Libin Wu Luhan Shi ShanWang Pingqing Fu Yingyi Zhang Senchao Lai The Key Lab of Pollution Control and Ecosystem Restoration in Industry Clusters Ministry of EducationSchool of Environment and EnergySouth China University of TechnologyGuangzhou 510006China Institute of Surface-Earth system science School of Earth System ScienceTianjin UniversityTianjin 300072China now at Hong Kong University of science and Technology Hong Kong 00852China

Amino acids(AAs)including D-and L-enantiomers are a group of organic nitrogen species in ambient *** to the low abundances of AAs(level of ng/m^(3))and the matrix effects by coexistent components,it is challenging to quantify AA enantiomers in ambient aerosols especially under pollution *** this study,we present an optimized method for analyzing AA enantiomers in atmospheric aerosol samples including a pretreatment process and the detection by high performance liquid chromatography coupled to a fuorescence detector(HPLC-FLD).Matrix effects caused by coexistent chemicals on AA enantiomers analysis in ambient aerosol samples were investigated especially for those collected in pollution *** results revealed that the determination of AA enantiomers is significantly affected by the coexistent organic carbon(as a proxy of organic matter)and water-soluble ion of NH_(4)^(+).To remove the matrix effects,we applied a pretreatment using the solid phase extraction column coupled with alkaline adjustment to sample *** pretreatment,18 AAs including 6 pairs of D-and L-enantiomers(i.e.,leucine,isoleucine,valine,alanine,serine,and aspartic acid)can be successfully separated and quantified in aerosol samples by *** recoveries are in the range of 67%-106%.This method was successfully applied to the urban aerosol samples from pollution and non-pollution periods for AA enantiomers *** suggest that the concentrations of D-AAs and the ratio of D-AA/L-AA are indicative of the contribution of bacterial sources and the infuence of biomass burning.

关键词： Amino acid enantiomers Atmospheric aerosol Organic carbon Ammonia Chiral ratio

维普期刊数据库

A hybrid memory architecture supporting fine-grained data migration

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第2期18卷 31-41页

作者： Ye CHI Jianhui YUE Xiaofei LIAO Haikun LIU Hai JIN National Engineering Research Center for Big Data Technology and system Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Department of Computer science Michigan Technological UniversityMichigan 49931USA

Hybrid memory systems composed of dynamic random access memory(DRAM)and Non-volatile memory(NVM)often exploit page migration technologies to fully take the advantages of different memory *** previous proposals usually migrate data at a granularity of 4 KB pages,and thus waste memory bandwidth and DRAM *** this paper,we propose Mocha,a non-hierarchical architecture that organizes DRAM and NVM in a flat address space physically,but manages them in a cache/memory *** the commercial NVM device-Intel Optane DC Persistent Memory Modules(DCPMM)actually access the physical media at a granularity of 256 bytes(an Optane block),we manage the DRAM cache at the 256-byte size to adapt to this feature of *** design not only enables fine-grained data migration and management for the DRAM cache,but also avoids write amplification for Intel Optane *** also create an Indirect Address Cache(IAC)in Hybrid Memory Controller(HMC)and propose a reverse address mapping table in the DRAM to speed up address translation and cache ***,we exploit a utility-based caching mechanism to filter cold blocks in the NVM,and further improve the efficiency of the DRAM *** implement Mocha in an architectural *** results show that Mocha can improve application performance by 8.2%on average(up to 24.6%),reduce 6.9%energy consumption and 25.9%data migration traffic on average,compared with a typical hybrid memory architecture-HSCC.

关键词： non-volatile memory hybrid memory system data migration fine-grained caching

A survey on dynamic graph processing on GPUs: concepts, terminologies and systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第4期18卷 1-23页

作者： Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN Hai JIN National Engineering Research Center for Big Data Technology and system/Services Computing Technology and system Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entities and their relationships are subject to constant *** that record such changes are called dynamic *** recent years,the widespread application scenarios of dynamic graphs have stimulated extensive research on dynamic graph processing systems that continuously ingest graph updates and produce up-to-date graph analytics *** the scale of dynamic graphs becomes larger,higher performance requirements are demanded to dynamic graph processing *** the massive parallel processing power and high memory bandwidth,GPUs become mainstream vehicles to accelerate dynamic graph processing ***-based dynamic graph processing systems mainly address two challenges:maintaining the graph data when updates occur(i.e.,graph updating)and producing analytics results in time(i.e.,graph computing).In this paper,we survey GPU-based dynamic graph processing systems and review their methods on addressing both graph updating and graph *** comprehensively discuss existing dynamic graph processing systems on GPUs,we first introduce the terminologies of dynamic graph processing and then develop a taxonomy to describe the methods employed for graph updating and graph *** addition,we discuss the challenges and future research directions of dynamic graph processing on GPUs.

关键词： dynamic graphs graph processing graph algorithms GPUs