2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)最新文献

筛选
英文 中文
Empowering Flexible and Scalable High Performance Architectures with Embedded Photonics 通过嵌入式光子学增强灵活和可扩展的高性能架构
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00047
K. Bergman
{"title":"Empowering Flexible and Scalable High Performance Architectures with Embedded Photonics","authors":"K. Bergman","doi":"10.1109/IPDPS.2018.00047","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00047","url":null,"abstract":"The recent explosive growth in data analytics applications that rely on machine and deep learning techniques are seismically changing the landscape of high performance architectures. These techniques rely on graphics processing units (GPU) and manycore (CPU) technologies whose need for intense performance is pushing current interconnect networks to their limits. Driven by these applications, the execution performance along with the energy consumption of massive parallel systems is increasingly determined by how data is moved among the numerous compute and memory resources. Embedded photonic interconnect technologies can address critical data-movement challenges by delivering higher communication bandwidth densities at significantly improved energy efficiencies. New disaggregated architectures enabled by embedded photonics and optical bandwidth steering can reduce the system-wide energy consumption.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124323481","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}
引用次数: 14
Taming the "Monster": Overcoming Program Optimization Challenges on SW26010 Through Precise Performance Modeling 驯服“怪物”:通过精确的性能建模克服SW26010上的程序优化挑战
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00086
Shizhen Xu, Yuanchao Xu, Wei Xue, Xipeng Shen, F. Zheng, Xiaomeng Huang, Guangwen Yang
{"title":"Taming the \"Monster\": Overcoming Program Optimization Challenges on SW26010 Through Precise Performance Modeling","authors":"Shizhen Xu, Yuanchao Xu, Wei Xue, Xipeng Shen, F. Zheng, Xiaomeng Huang, Guangwen Yang","doi":"10.1109/IPDPS.2018.00086","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00086","url":null,"abstract":"This paper presents an effort for overcoming the complexities of program optimizations on SW26010, the heterogeneous many-core processor that powers Sunway TaihuLight, the world top one supercomputer. The solution centers around a precise, static performance model for modern many-core processor. Through a careful design that leverages the special properties of SW26010 and an effective treatment to massive parallelism, the model achieves a high accuracy, showing less than 5% average errors in estimating program execution performance. The precise performance model opens many opportunities for analyzing and guiding code optimizations. The paper demonstrates the usefulness by revealing a series of insights on the effects of some important code optimizations on SW26010. Moreover, it demonstrates that with such a precise performance model, it is feasible to replace empirical auto-tuning with static auto-tuning for optimizing regular loops on heterogeneous many-core systems. Such a replacement speeds up the tuning process by as much as a factor of 43 while keeping the tuning quality loss below 6%.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929059","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}
引用次数: 9
Performance and Scalability of Lightweight Multi-kernel Based Operating Systems 基于轻量级多内核操作系统的性能和可扩展性
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00022
Balazs Gerofi, R. Riesen, Masamichi Takagi, T. Boku, K. Nakajima, Y. Ishikawa, R. Wisniewski
{"title":"Performance and Scalability of Lightweight Multi-kernel Based Operating Systems","authors":"Balazs Gerofi, R. Riesen, Masamichi Takagi, T. Boku, K. Nakajima, Y. Ishikawa, R. Wisniewski","doi":"10.1109/IPDPS.2018.00022","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00022","url":null,"abstract":"Multi-kernels leverage today's multi-core chips to run multiple operating system (OS) kernels, typically a Light Weight Kernel (LWK) and a Linux kernel, simultaneously. The LWK provides high performance and scalability, while the Linux kernel provides compatibility. Multi-kernels show the promise of being able to meet tomorrow's extreme-scale computing needs while providing strong isolation, yielding high performance and scalability needed by classical HPC applications. McKernel and mOS started as independent research initiatives to explore the above potential. Previous work described their design and architecture advantages. This paper deploys the two LWKs and presents results from running them on a 2,048-node system with Intel Xeon Phi processors (KNL) connected by Intel Omni-Path Fabric. We compare the performance of McKernel, mOS, and Linux. Although the two multi-kernel efforts approached the problem from different angles, the results show a median performance improvement of 9% with some applications as high as 280% validating the efficacy of the multi-kernel approach. We provide insight into the performance improvements and discuss the strengths of the two different multi-kernel approaches.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125977176","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}
引用次数: 16
Joint Server and Network Energy Saving in Data Centers for Latency-Sensitive Applications 面向延迟敏感型应用的数据中心服务器和网络联合节能
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00079
Liang Zhou, C. Chou, L. Bhuyan, K. Ramakrishnan, Daniel Wong
{"title":"Joint Server and Network Energy Saving in Data Centers for Latency-Sensitive Applications","authors":"Liang Zhou, C. Chou, L. Bhuyan, K. Ramakrishnan, Daniel Wong","doi":"10.1109/IPDPS.2018.00079","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00079","url":null,"abstract":"Achieving energy proportionality in data centers supporting latency-sensitive applications is challenging because of the strict Service Level Agreements. Previous works individually focus on making the server energy proportional or reducing the data center network's power consumption for latency-tolerant applications. In this paper, we propose EPRONS to minimize the overall data center's power consumption with latency-sensitive applications by trading-off network slack in favor of providing additional slack for computations. We utilize the linear programming model to consolidate latency-sensitive search queries and latency-tolerant background flows to a minimal subnet of the topology by turning off unused switches and links without violating the application deadlines. Servers take advantage of the additional 'network-provided' slack to allow slowing down request processing. For servers, we design a novel power saving technique using Dynamic Voltage and Frequency Scaling (DVFS) based on the average tail latency of a request. If needed, we turn on a minimal number of additional network links and switches to reduce network latency while still maximizing entire data center's power saving. Experimental results show that our scheme saves up to 31.25% of a data center's total power budget.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"672 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132395935","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}
引用次数: 14
GC-Aware Request Steering with Improved Performance and Reliability for SSD-Based RAIDs gc感知请求转向与改进性能和可靠性的基于ssd的raid
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00039
Suzhen Wu, Weidong Zhu, Guixin Liu, Hong Jiang, Bo Mao
{"title":"GC-Aware Request Steering with Improved Performance and Reliability for SSD-Based RAIDs","authors":"Suzhen Wu, Weidong Zhu, Guixin Liu, Hong Jiang, Bo Mao","doi":"10.1109/IPDPS.2018.00039","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00039","url":null,"abstract":"SSD-based RAIDs have been widely deployed in high-end enterprise systems to provide high-performance and highly reliable storage for data-intensive computing. However, SSD-based RAIDs suffer from significant performance degradation whenever user I/O requests conflict with the ongoing Garbage Collection (GC) operations which introduces tail latency. Moreover, the performance characteristics of SSDs make the traditional HDD-based RAID reconstruction algorithms are not compatible with or suitable for SSD-based RAIDs. In this paper, we proposed GC-aware Request Steering (short for GC-Steering), a scheme aware of the GC process within an SSD-based RAID, to significantly boost the performance and reliability of SSD-based RAIDs. GC-Steering effectively outsources the popular read requests and all write requests addressed to the SSD currently in the GC state to a staging space such as a dedicated spare SSD or the reserved space of each SSD within the RAID. GC-Steering also accelerates the performance of the failure-recovery process by both request steering and parallel recovery. Our extensive evaluations on a lightweight GC-Steering prototype driven by HPC-like and real-world enterprise workloads show that the GC-Steering scheme significantly reduces the average response time by an average of 63.3% and 65.8%, compared with the state-of-the-art LGC and GGC schemes. Moreover, GC-Steering scheme also significantly reduces the average response times by an average of 55.7% during RAID reconstruction than the normal state.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132464137","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}
引用次数: 18
Cudele: An API and Framework for Programmable Consistency and Durability in a Global Namespace Cudele:在全局命名空间中实现可编程一致性和持久性的API和框架
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00105
Michael Sevilla, I. Jimenez, Noah Watkins, J. LeFevre, P. Alvaro, Sheldon J. Finkelstein, P. Donnelly, C. Maltzahn
{"title":"Cudele: An API and Framework for Programmable Consistency and Durability in a Global Namespace","authors":"Michael Sevilla, I. Jimenez, Noah Watkins, J. LeFevre, P. Alvaro, Sheldon J. Finkelstein, P. Donnelly, C. Maltzahn","doi":"10.1109/IPDPS.2018.00105","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00105","url":null,"abstract":"HPC and data center scale application developers are abandoning POSIX IO because file system metadata synchronization and serialization overheads of providing strong consistency and durability are too costly – and often unnecessary – for their applications. Unfortunately, designing file systems with weaker consistency or durability semantics excludes applications that rely on stronger guarantees, forcing developers to re-write their applications or deploy them on a different system. We present a framework and API that lets administrators specify their consistency/durability requirements and dynamically assign them to subtrees in the same namespace, allowing administrators to optimize subtrees over time and space for different workloads. We show similar speedups to related work but more importantly, we show performance improvements when we custom fit subtree semantics to applications such as checkpoint-restart (91.7x speedup), user home directories (0.03 standard deviation from optimal), and users checking for partial results (2% overhead).","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131744741","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}
引用次数: 5
Chameleon: Online Clustering of MPI Program Traces 变色龙:MPI程序轨迹的在线聚类
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00119
Amir Bahmani, F. Mueller
{"title":"Chameleon: Online Clustering of MPI Program Traces","authors":"Amir Bahmani, F. Mueller","doi":"10.1109/IPDPS.2018.00119","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00119","url":null,"abstract":"The data explosion in scientific computing applications continues to fuel increasing demand for computational power. Understanding application behavior in this context becomes essential to determine shortcomings, e.g., by collecting detailed information with tracing toolsets. This work considers parallel applications using the SPMD (single program multiple data) paradigm that relies on iterative kernels. This characteristic provides an opportunity to empower tracing toolsets with effective machine learning algorithms. One solution is to cluster processes with the same behavior into a group. Instead of collecting performance information from each individual process, this information can be collected from just a set of lead processes, i.e., one lead process per group. This work, called Chameleon, contributes an online, fast, and scalable signature-based clustering algorithm. Unlike related work, namely ScalaTrace V2, that generates the compressed global trace within MPI_Finalize, Chameleon creates this trace incrementally during the execution of applications and only for lead processes. Chameleon also identifies different program phases, clusters processes exhibiting different execution behavior, and creates a compressed global trace file on-the-fly, all incrementally at interim execution points of applications. The resulting system combines low overhead at the clustering level a lower time complexity of log (P) than prior work.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126388790","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}
引用次数: 6
Online Tuning of Parallelism Degree in Parallel Nesting Transactional Memory 并行嵌套事务内存并行度的在线调优
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00057
Jingna Zeng, P. Romano, J. Barreto, L. Rodrigues, Seif Haridi
{"title":"Online Tuning of Parallelism Degree in Parallel Nesting Transactional Memory","authors":"Jingna Zeng, P. Romano, J. Barreto, L. Rodrigues, Seif Haridi","doi":"10.1109/IPDPS.2018.00057","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00057","url":null,"abstract":"This paper addresses the problem of self-tuning the parallelism degree in Transactional Memory (TM) systems that support parallel nesting (PN-TM). This problem has been long investigated for TMs not supporting nesting, but, to the best of our knowledge, has never been studied in the context of PN-TMs. Indeed, the problem complexity is inherently exacerbated in PN-TMs, since these require to identify the optimal parallelism degree not only for top-level transactions but also for nested sub-transactions. The increase of the problem dimensionality raises new challenges (e.g., increase of the search space, and proneness to suffer from local maxima), which are unsatisfactorily addressed by self-tuning solutions conceived for flat nesting TMs. We tackle these challenges by proposing AUTOPN, an on-line self-tuning system that combines model-driven learning techniques with localized search heuristics in order to pursue a twofold goal: i) enhance convergence speed by identifying the most promising region of the search space via model-driven techniques, while ii) increasing robustness against modeling errors, via a final local search phase aimed at refining the model's prediction. We further address the problem of tuning the duration of the monitoring windows used to collect feedback on the system's performance, by introducing novel, domain-specific, mechanisms aimed to strike an optimal trade-off between latency and accuracy of the self-tuning process. We integrated AUTOPN with a state of the art PN-TM (JVSTM) and evaluated it via an extensive experimental study. The results of this study highlight that AUTOPN can achieve gains of up to 45× in terms of increased accuracy and 4× faster convergence speed, when compared with several on-line optimization techniques (gradient descent, simulated annealing and genetic algorithm), some of which were already successfully used in the context of flat nesting TMs.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132565708","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
Indigo: A Domain-Specific Language for Fast, Portable Image Reconstruction Indigo:用于快速、可移植图像重建的领域特定语言
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00059
Michael B. Driscoll, Benjamin Brock, Frank Ong, Jonathan I. Tamir, Hsiou-Yuan Liu, M. Lustig, A. Fox, K. Yelick
{"title":"Indigo: A Domain-Specific Language for Fast, Portable Image Reconstruction","authors":"Michael B. Driscoll, Benjamin Brock, Frank Ong, Jonathan I. Tamir, Hsiou-Yuan Liu, M. Lustig, A. Fox, K. Yelick","doi":"10.1109/IPDPS.2018.00059","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00059","url":null,"abstract":"Linear operators used in iterative methods like conjugate gradient have typically been implemented either as \"\"matrix-driven\"\" subroutines backed by explicit sparse or dense matrices, or as \"\"matrix-free\"\" subroutines that implement specific linear operations directly (e.g. FFTs). The matrix-driven approach is generally more portable because it can target widely-available BLAS libraries, but it can be inefficient in terms of time and space complexity. In contrast, the matrix-free approach is more performant because it leverages structure in operations, but it requires each operator be re-implemented on each new platform. To increase performance and portability, we propose a hybrid approach that represents linear operators as expression trees. Leaf nodes in the tree are either matrix-free or matrix-driven operators, and interior nodes represent mathematical compositions (sums, products, transposes) or structural compositions (stacks, block diagonals, etc.) of the leaf operators. This representation enables expert-guided reordering and fusion transformations that can improve performance or reduce memory pressure. We implement our approach in a domain-specific language called Indigo. We assess Indigo on image reconstruction problems arising in four application areas: magnetic resonance imaging, ptychography, magnetic particle imaging, and fluorescent microscopy. We give performance results from vendor BLAS libraries, and we introduce specializations to Sparse BLAS routines that achieve near-Roofline performance on multi-core, many-core, and GPU systems.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"74 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860419","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
Evaluating Active Learning with Cost and Memory Awareness 评估主动学习与成本和记忆意识
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Pub Date : 2018-05-21 DOI: 10.1109/IPDPS.2018.00031
Dmitry Duplyakin, Jed Brown, D. Calhoun
{"title":"Evaluating Active Learning with Cost and Memory Awareness","authors":"Dmitry Duplyakin, Jed Brown, D. Calhoun","doi":"10.1109/IPDPS.2018.00031","DOIUrl":"https://doi.org/10.1109/IPDPS.2018.00031","url":null,"abstract":"Active Learning (AL) is a methodology from Machine Learning and Design of Experiments (DOE) in which the quantities of interest are measured sequentially and the corresponding surrogate models are constructed incrementally. AL provides compelling optimizations over static DOE in applications with engineering processes where the cost of individual experiments is significant. It also helps perform series of computer experiments in parameter sweeps and performance analysis studies. One of the non-trivial tasks in the design of AL systems is the selection of algorithms for cost-efficient exploration of the input spaces of interest: AL needs to balance \"\"exploitation\"\" of experiments with modest costs and careful \"\"exploration\"\" of expensive configurations. Finding this balance in an automatic and general manner is challenging yet desirable in practice. In this paper, we investigate the application of AL algorithms to Adaptive Mesh Refinement (AMR) performed on a supercomputer. We use AL in conjunction with Gaussian Process Regression for the incremental modeling of cost and memory usage of a series of AMR simulations of a shock-bubble interaction phenomenon. In the studied 5-dimensional input parameter space – with physical, numerical, and machine parameters – we allow AL to guide experimentation across hundreds of configurations. We develop and evaluate a novel multi-objective AL experiment selection algorithm which prioritizes cost-efficient exploration of available configurations and at the same time avoids simulations that violate memory constraints.","PeriodicalId":307351,"journal":{"name":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457011","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学术官方微信
小红书