2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)最新文献

筛选
英文 中文
Mixed and Multi-Precision SpMV for GPUs with Row-wise Precision Selection 具有逐行精度选择的gpu混合和多精度SpMV
Erhan Tezcan, Tugba Torun, Fahrican Koşar, K. Kaya, D. Unat
{"title":"Mixed and Multi-Precision SpMV for GPUs with Row-wise Precision Selection","authors":"Erhan Tezcan, Tugba Torun, Fahrican Koşar, K. Kaya, D. Unat","doi":"10.1109/SBAC-PAD55451.2022.00014","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00014","url":null,"abstract":"Sparse Matrix-Vector Multiplication (SpMV) is one of the key memory-bound kernels commonly used in industrial and scientific applications. To improve its data movement and benefit from higher compute rates, there are several efforts to utilize mixed precision on SpMV. Most of the prior-art focus on performing the entire SpMV in single-precision within a bigger context of an iterative solver (e.g., CG, GMRES). In this work, we are interested in a more fine-grained mixed-precision SpMV, where the level of precision is decided for each element in the matrix to be used in a single operation. We extend an existing entry-wise precision based approach by deciding precisions per row, motivated by the granularity of parallelism on a GPU where groups of threads process rows in CSR-based matrices. We propose mixed-precision CSR storage methods with row permutations and describe their greater efficiency and load-balancing compared to the existing method. We also consider a multi-precision case where single and double precision copies of the matrix are stored priorly and further extend our mixed-precision SpMV approach to comply with it. As such, we leverage a mixed-precision SpMV to obtain a multi-precision Jacobi method which is faster than yet almost as accurate as double-precision Jacobi implementation, and further evaluate a multi-precision Cardiac modeling algorithm. We demonstrate the effectiveness of the proposed SpMV methods on an extensive dataset of real-valued large sparse matrices from the SuiteSparse Matrix Collection using an NVIDIA V100 GPU.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Avoiding Unnecessary Caching with History-Based Preemptive Bypassing 使用基于历史的先发制人绕过避免不必要的缓存
Arthur M. Krause, P. C. Santos, P. Navaux
{"title":"Avoiding Unnecessary Caching with History-Based Preemptive Bypassing","authors":"Arthur M. Krause, P. C. Santos, P. Navaux","doi":"10.1109/SBAC-PAD55451.2022.00018","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00018","url":null,"abstract":"Cache memories can account for more than half of the area and energy consumption on modern processors, which will only increase with the current trend of bigger on die memories. Although these components are very effective when the access pattern is cache-friendly, cache memories incur extra and unnecessary latencies when they cannot serve the data, which adds to significant energy wastes when data that is never reused is placed on them. This work introduces HBPB, a mechanism that detects whether a memory access is cache friendly or not, allowing the bypass of the cache for accesses that are not known to be cache-friendly. Our approach allows the processor to quickly detect when caching accesses is inadequate, improving overall access latency and reducing energy waste and cache pollution. The presented solution achieves reductions of up to 28.6% in energy consumption and 19.5% in latency for SPEC applications, and further improvements in power and performance across various workloads.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
TCUDA: A QoS-based GPU Sharing Framework for Autonomous Navigation Systems 基于qos的自主导航系统GPU共享框架
Pangbo Sun, Hao Wu, Jiangming Jin, Ziyue Jiang, Yifan Gong
{"title":"TCUDA: A QoS-based GPU Sharing Framework for Autonomous Navigation Systems","authors":"Pangbo Sun, Hao Wu, Jiangming Jin, Ziyue Jiang, Yifan Gong","doi":"10.1109/SBAC-PAD55451.2022.00011","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00011","url":null,"abstract":"Autonomous navigation systems (ANS) consist of several software modules, such as sensing, perception, and planning to achieve traffic perception and fast decision making. These modules are required to process large amounts of data, such as images, in real-time. GPUs are commonly exploited on ANS to speed up data processing. As GPUs provides tremendous computation resources, it is common that one software module uses only partial GPU resources, leading to low GPU utilization and energy inefficiency. Traditionally, GPU sharing is a method to address this problem. However, GPU sharing is not supported on current embedded GPU platforms, which are widely used by ANS. Furthermore, GPU sharing challenges task Quality of Service (QoS) that requires task execution in a fixed latency. To achieve QoS requirement, we propose a progress bar scheduling policy to provide GPU tasks with QoS guarantee in GPU sharing environments. Based on this policy, a GPU sharing framework named TCUDA, is proposed to endow existing GPU tasks with QoS guarantee and improve GPU utilization. Finally, results show TCUDA reduces GPU task latency by 16.8% with QoS guarantee on an embedded GPU platform Xavier.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122715818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strategies for Fault-Tolerant Tightly-Coupled HPC Workloads Running on Low-Budget Spot Cloud Infrastructures 在低预算的点云基础设施上运行的容错紧密耦合HPC工作负载策略
Vanderlei Munhoz, M. Castro, O. Mendizabal
{"title":"Strategies for Fault-Tolerant Tightly-Coupled HPC Workloads Running on Low-Budget Spot Cloud Infrastructures","authors":"Vanderlei Munhoz, M. Castro, O. Mendizabal","doi":"10.1109/SBAC-PAD55451.2022.00037","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00037","url":null,"abstract":"Cloud providers can rent their spare computing capacity at substantial discounts, reclaiming it whenever there is a more profitable higher-priority request - a business model well known as spot infrastructure market. Users can attain significant cloud investment savings using spot machines, however with the caveat of increasing software complexity, given the fault tolerance requirements of this environment. Improvements in virtualization and network technology, combined with the development of key new software tools, may allow the HPC community to effectively take advantage of cheap cloud resources, cutting expensive maintenance costs. This study aims to evaluate the viability of budget-constrained cloud environments for tightly-coupled MPI applications, exploring both spot and traditional low-budget infrastructures from real public cloud platforms. We propose and evaluate two different fault tolerance strategies tailored for unreliable spot cloud environments: system-level rollback restart with Berkeley Labs Checkpoint/Restart (BLCR) and in-memory rollback restart with User-Level Failure Mitigation (ULFM). We also propose a provider-agnostic empirical method for testing and predicting MPI workloads execution times and cloud infrastructure costs. A detailed cost analysis and performance benchmark of a case-study application is provided, with data gathered from experiments with both spot and persistent machines from AWS and Vultr Cloud, respectively. Our results show that: (i) adequate cluster sizing plays an important role in the overall job execution performance and cost-effectiveness, regardless of the type of selected instances; (ii) fault tolerance strategies based on BLCR may have worse performance than ULFM, but still be costeffective considering software migration costs; (iii) the use of spot infrastructure does not guarantee costs savings depending on the chosen machine flavors and discounts, as experiments with persistent low-budget options attained better cost-effectiveness in some conditions.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130492969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Dynamic Set Stealing to Improve Cache Performance 动态集窃取,提高Cache性能
Brady Testa, Samira Mirbagher Ajorpaz, Daniel A. Jiménez
{"title":"Dynamic Set Stealing to Improve Cache Performance","authors":"Brady Testa, Samira Mirbagher Ajorpaz, Daniel A. Jiménez","doi":"10.1109/SBAC-PAD55451.2022.00017","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00017","url":null,"abstract":"In the last-level cache (LLC), replacement policy is dependent on workload characteristics. Adapting the policy to the current workload has been an active area of research. Previous works includes set dueling exemplified by DIP [40] which uses static replacement policies and machine learning based models such as Glider [45] or Multiperspective Reuse Prediction [19]. Both provide improvement over the least-recently-used (LRU) policy, but additional improvement is possible. DIP suffers from wasted resources as leading sets of the competing policies are fixed in size. Machine learning approaches each use a fixed set of features that were selected offline that are not optimal for all workloads. We introduce Set Stealing with Perceptron Tables (SSPT), a novel resource management policy that allows combining the strengths of many replacement policies to maximize performance and eliminate wasted processor resources. This policy achieves a 9.45% geometric mean speedup over a baseline LRU policy on a set of 81 SPEC benchmark work-loads, compared to Glider's 9.28% and Multiperspective Reuse Prediction at 7.62% assuming a 2 MB LLC. We achieve a 9.70% geometric mean speedup over LRU on a set of 90 big data (GAPS and XS) workloads, compared to Glider's 8.79% and Multiperspective Reuse Prediction at 7.86% assuming a 2 MB LLC.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115686280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A predictive approach for dynamic replication of operators in distributed stream processing systems 分布式流处理系统中操作符动态复制的预测方法
Daniel Wladdimiro, L. Arantes, Pierre Sens, Nicolás Hidalgo
{"title":"A predictive approach for dynamic replication of operators in distributed stream processing systems","authors":"Daniel Wladdimiro, L. Arantes, Pierre Sens, Nicolás Hidalgo","doi":"10.1109/SBAC-PAD55451.2022.00023","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00023","url":null,"abstract":"Stream Processing Systems (SPSs) can present significant fluctuation in input rate. To address this issue, some existing solutions propose reconfiguring the SPS by replicating its operators. However, such reconfiguration usually induces a high system downtime cost. Moreover, reconfiguration decisions are based only on resource utilization without balancing the load between replicas. We propose in this paper a predictive SPS that dynamically defines the necessary number of replicas of each operator based not only on the current resource utilization and input rate variation but also on the events that, due to the operator's overloading, could not be processed yet and are, thus, kept in the operator's queue. In addition, our SPS implements a load balancer that distributes incoming events more evenly among replicas of an operator. Our solution has been integrated into Storm. To avoid system reconfiguration downtime, our SPS preallocates a pool of replicas where each of them can be activated or deactivated based on per operator input load predictions. Using real traffic traces with different applications, we have conducted experiments on Google Cloud Platform (GCP), evaluating our SPS and comparing it with Storm and DABS-Storm.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123994126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
NUMA-Aware Dense Matrix Factorizations and Inversion with Look-Ahead on Multicore Processors 多核处理器上numa感知的密集矩阵分解与前瞻性反演
Sandra Catalán, Francisco D. Igual, Rafael Rodríguez-Sánchez, J. Herrero, E. S. Quintana‐Ortí
{"title":"NUMA-Aware Dense Matrix Factorizations and Inversion with Look-Ahead on Multicore Processors","authors":"Sandra Catalán, Francisco D. Igual, Rafael Rodríguez-Sánchez, J. Herrero, E. S. Quintana‐Ortí","doi":"10.1109/SBAC-PAD55451.2022.00020","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00020","url":null,"abstract":"We address the efficient design and implementation of dense matrix factorizations and inversion (DMFI) on modern multicore processors with several NUMA (non-uniform memory access) nodes. Our approach enhances the DMFI routines with a look-ahead strategy, in order to overcome the “panel factorization bottleneck”. In addition, it exploits both hybrid task- and loop-level parallelizations while taking into account the NUMA organization of the memory hierarchy. The experiments on a Huawei Kunpeng-based server, with two sockets and 48 cores per socket, for three representative dense linear algebra operations, expose the necessity of adapting both the codes and their execution environment parameters to improve data access locality. The results of these changes deliver performance across inter- and intra-socket NUMA configurations superior to that of reference implementations from state-of-the-art libraries for this platform.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127920771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Convergence of HPC and Big Data in extreme-scale data analysis through the DCEx programming model 通过DCEx编程模型实现HPC和大数据在极端规模数据分析中的融合
Javier García-Blas, Javier Fernández Muñoz, J. Carretero, F. Marozzo, D. Talia, Paolo Trunfio, Alberto Fernández-Pena, Daniel Martín de Blas
{"title":"Convergence of HPC and Big Data in extreme-scale data analysis through the DCEx programming model","authors":"Javier García-Blas, Javier Fernández Muñoz, J. Carretero, F. Marozzo, D. Talia, Paolo Trunfio, Alberto Fernández-Pena, Daniel Martín de Blas","doi":"10.1109/SBAC-PAD55451.2022.00024","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00024","url":null,"abstract":"High-level programming models can help application developers to access and use resources without the need to manage low-level architectural entities, as a parallel programming model defines a set of programming abstractions that simplify the way by which a programmer structures and expresses her/his algorithm. Early proposals of Exascale programming tools are based on the adaptation of traditional parallel programming languages and hybrid solutions. This incremental approach is too conservative, often resulting in very complex code. This paper describes the design features, the programming constructs, and the runtime mechanisms of the Data Centric programming model for Exascale systems (DCEx). DCEx is based on structuring applications into data-parallel blocks. Blocks are units of shared-and distributed-memory parallel computation, communication, and migration in the memory/storage hierarchy. Blocks and their message queues are mapped onto processes and placed in memory/storage by the DCEx runtime. Those data-parallel blocks are orchestrated by using distributed parallel patterns that simplify the development cost. DCEx aims to reach the convergence of traditional HPC programming models, mainly based on MPI, with the emerging technologies based on the data intensive paradigms. To demonstrate the potential of DCEx, we carried out an experimental evaluation developing a real-world diffusion-weighted magnetic resonance imaging data processing application in a neuroimaging research context.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126588171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
IntP: Quantifying cross-application interference via system-level instrumentation 通过系统级检测量化跨应用程序干扰
Miguel G. Xavier, Carlos H. C. Cano, Vinícius Meyer, C. Rose
{"title":"IntP: Quantifying cross-application interference via system-level instrumentation","authors":"Miguel G. Xavier, Carlos H. C. Cano, Vinícius Meyer, C. Rose","doi":"10.1109/SBAC-PAD55451.2022.00034","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00034","url":null,"abstract":"Large-scale container datacenters host tens of thousands of diverse container-wrapped applications each day improving resource usage and maintenance costs. However, resource contention-related interference between co-located applications can severely degrade performance, affecting the quality of service at the user level and compromising experience. Understanding the sources of noise that generates this interference and better managing how to consolidate applications to physical hosts can significantly improve resource usage and overall performance reducing costs for providers and users. This paper presents IntP-an open-source system-level monitoring tool, which analyses selected architectural counters and operating systems data structures to estimate the stress an application puts on each hardware's subsystem and consequently infer the potential interference it could generate in other applications hosted in the same physical machine. Different from state-of-the-art tools that apply a more high-level approach using micro benchmarks and application metrics, IntPs low level instrumentation enables a more accurate prediction of the performance degradation that results from contention on shared resources, with less monitoring overhead. This information can be used to optimize scheduling strategies, which will make datacenter more resource-efficient and cost-effective. To show examples on how to use this tool and validate its results we present three cases studies that applied IntP in their interference-aware methodologies to improve resource utilization in distributed architectures that were able to achieve an increase up to 35% in resource efficiency and up to 25% in user level performance.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126657697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analyzing Power Decisions in Data Center Powered by Renewable Sources 可再生能源驱动数据中心的电力决策分析
Igor Fontana De Nardin, P. Stolf, S. Caux
{"title":"Analyzing Power Decisions in Data Center Powered by Renewable Sources","authors":"Igor Fontana De Nardin, P. Stolf, S. Caux","doi":"10.1109/SBAC-PAD55451.2022.00041","DOIUrl":"https://doi.org/10.1109/SBAC-PAD55451.2022.00041","url":null,"abstract":"Both academics and industry have engaged their efforts in reducing greenhouse gas (GHG) emissions of Information and Communications Technology (ICT). Data centers are one of the most electricity-expensive ICT actors due to their uninterrupted service. Reducing the usage of brown energy or migrating to green energy using renewable sources (RES) is a way to reduce these emissions. However, this migration is not straightforward due to intermittence from these sources. This work is part of Datazero 2 ANR project. This project aims to design a data center powered only by RES production and storage elements. This architecture requires several decisions at different levels of management. This project divides the problem into two groups: offline and online. On the offline side, it uses renewable and workload predictions to prepare an offline plan with a power envelope (power delivered to the servers) and hints on how to manage the storage (batteries and hydrogen). Given the offline plan, the article's contribution is how to deal with real and dynamic power constraints online while keeping the planned storage level at the end. So, this article proposes policies to modify the plan according to the changes in predictions. We evaluate these policies in a homogeneous and heterogeneous data center. The results demonstrate that our policies could approach the storage level and improve Quality of Service (QoS) independently of data center infrastructures.","PeriodicalId":240323,"journal":{"name":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115157261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书