2014 IEEE International Symposium on Workload Characterization (IISWC)最新文献

筛选
英文 中文
Control flow behavior of cloud workloads 控制云工作负载的流行为
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-12-15 DOI: 10.1109/IISWC.2014.6983041
Jee Ho Ryoo, Michael LeBeane, M. Iqbal, L. John
{"title":"Control flow behavior of cloud workloads","authors":"Jee Ho Ryoo, Michael LeBeane, M. Iqbal, L. John","doi":"10.1109/IISWC.2014.6983041","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983041","url":null,"abstract":"With massive amounts of information on the web, cloud applications are rapidly emerging as one of the main-stream domains in modern computing, yet very little is known about their behavior. To our knowledge, this paper presents the first detailed study of control flow behavior in cloud workloads. We characterize branch predictability behavior of cloud and big data benchmarks, and compare against those of widely known CPU workloads based on profiling and simulation. Our in-depth branch analysis of workloads present striking differences in terms of higher prevalence of indirect branches, larger offsets in branch targets, abundance of multi-target branches and low BTB hit-rates. We identify performance bottlenecks involving branch predictability and provide suggestions that can be incorporated in future datacenter oriented processor designs. We perform Principal Component Analysis and clustering techniques to understand similarity/dissimilarity between cloud and CPU workloads.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121400208","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
Measuring QoE of interactive workloads and characterising frequency governors on mobile devices 测量交互式工作负载的QoE并描述移动设备上的频率调控器
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-12-15 DOI: 10.1109/IISWC.2014.6983040
Volker Seeker, Pavlos Petoumenos, Hugh Leather, B. Franke
{"title":"Measuring QoE of interactive workloads and characterising frequency governors on mobile devices","authors":"Volker Seeker, Pavlos Petoumenos, Hugh Leather, B. Franke","doi":"10.1109/IISWC.2014.6983040","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983040","url":null,"abstract":"Mobile computing devices such as smartphones and tablets have become tightly integrated with many people's life, both at work and at home. Users spend large amounts of time interacting with their mobile device and demand an excellent user experience in terms of responsiveness, whilst simultaneously expecting a long battery life between charging cycles. Frequency governors, responsible for increasing or decreasing the Cpu clock frequency depending on the current workload and external events, try to balance the two contrasting goals of high performance and low energy consumption. However, despite their critical role in providing energy efficiency it is difficult to measure the effectiveness of frequency governors in an interactive environment. In this paper we develop a novel methodology for creating repeatable, fully automated, realistic, workloads that can accurately measure time lag in interactive applications resulting from non-optimally selected operating frequencies. We also introduce a new metric capturing the user experience for different Android frequency governors. We evaluate interactive workloads to demonstrate how our approach enables us to automatically record and replay sequences of user interactions for different system configurations. We demonstrate that none of the available Android frequency governors performs particularly well, but leave substantial room for improvement. We show that energy savings of up to 27% are possible, whilst delivering a user experience that is better than that provided by the standard Android frequency governor. We also show that it is possible to save 47% energy with performance that is indistinguishable from permanently running the Cpu at the highest frequency.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122632249","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
Characterization of transient error tolerance for a class of mobile embedded applications 一类移动嵌入式应用的瞬态容错特性
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-12-15 DOI: 10.1109/IISWC.2014.6983042
Liang Wang, Ramon Bertran Monfort, A. Buyuktosunoglu, P. Bose, K. Skadron
{"title":"Characterization of transient error tolerance for a class of mobile embedded applications","authors":"Liang Wang, Ramon Bertran Monfort, A. Buyuktosunoglu, P. Bose, K. Skadron","doi":"10.1109/IISWC.2014.6983042","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983042","url":null,"abstract":"We study the inherent resilience (to transient errors) of a class of embedded applications that are currently under study in the DARPA-sponsored program called PERFECT. The experimental setup used in this research uses a fast fault-injection methodology, that takes advantage of native execution speeds on actual system hardware. The reported resilience characterization data are interpreted in the context of measured workload metrics like dynamic instruction frequency mix.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133256259","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}
引用次数: 4
Performance analysis of the memory management unit under scale-out workloads 横向扩展工作负载下内存管理单元的性能分析
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-10-01 DOI: 10.1109/IISWC.2014.6983034
Vasileios Karakostas, O. Unsal, M. Nemirovsky, A. Cristal, M. Swift
{"title":"Performance analysis of the memory management unit under scale-out workloads","authors":"Vasileios Karakostas, O. Unsal, M. Nemirovsky, A. Cristal, M. Swift","doi":"10.1109/IISWC.2014.6983034","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983034","url":null,"abstract":"Much attention has been given to the efficient execution of the scale-out applications that dominate in datacenter computing. However, the effects of the hardware support in the Memory Management Unit (MMU) in combination with the distinct characteristics of the scale-out applications have been largely ignored until recently. In this paper, we comprehensively quantify the MMU overhead on a real machine leveraging the use of performance counters on a collection of emerging scale-out applications. We show that the MMU overhead accounts for up to 16% of the total execution time due to the high TLB miss rates and the interference between page walks and application data in the cache hierarchy. We find that decreasing the MMU overhead - with large pages - may improve the application performance by up to 13.9%. However, the limited MMU support for large pages in combination with the workloads' low memory locality may even harm the performance when large pages are enabled. By comparing the expected and measured application speedup, we observe a performance gap of up to 3.8%, indicating that any improvements in the MMU may result in more efficient utilization of the available execution resources. Finally, we find that the MMU overhead remains high for most scale-out applications even in the presence of large pages, leaving ample space for optimizations. In response, we present upper bounds for perfect MMU optimizations that motivate rethinking its design in the context of the scale-out applications.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121236524","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}
引用次数: 48
An analysis of address and branch patterns with PatternFinder 用PatternFinder分析地址和分支模式
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-10-01 DOI: 10.1109/IISWC.2014.6983062
Celal Öztürk, Ibrahim Burak Karsli, Resit Sendag
{"title":"An analysis of address and branch patterns with PatternFinder","authors":"Celal Öztürk, Ibrahim Burak Karsli, Resit Sendag","doi":"10.1109/IISWC.2014.6983062","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983062","url":null,"abstract":"Current processors employ aggressive prediction mechanisms to improve performance and reduce power. It is increasingly important to understand and quantify a program's dynamic behavior to effectively design next-generation prediction mechanisms. In this paper, we develop algorithms and mechanisms inspired by DNA discovery tools to analyze and quantify program dynamic behavior in terms of regularities and patterns. We describe our PatternFinder tool and analyze its results to summarize most important branch and data address pattern behaviors for a set of program traces and SPEC CPU 2006 benchmarks.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576732","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
The importance and characteristics of communication in high performance data analytics 通信在高性能数据分析中的重要性和特点
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-10-01 DOI: 10.1109/IISWC.2014.6983044
Andreea Anghel, G. Rodríguez, B. Prisacari
{"title":"The importance and characteristics of communication in high performance data analytics","authors":"Andreea Anghel, G. Rodríguez, B. Prisacari","doi":"10.1109/IISWC.2014.6983044","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983044","url":null,"abstract":"Social networks and business analytics typically need to process vast amounts of data that are often modeled as graphs. The scale of the data that such applications have to handle requires large-scale distributed computing systems, together with scalable parallel algorithms, to efficiently process the graphs. Representative of the graph-based analytics class of applications is the Graph 500 benchmark (Murphy, et.al., 2010), which is designed to assess the performance of supercomputing systems by solving the Breadth-First Search (BFS) graph traversal problem. In this work, we analyze the network data motion of a Graph 500 MPI version of the graph traversal problem, using a large-scale high-performance computing system, i.e., the MareNostrum III supercomputer (http://www.bsc.es/marenostrum-support-services/mn3). We focus our analysis on the node-to-node communication and show that the application runtime is communication-bound, the communication making up as much as 80% of the execution time of each BFS iteration. We also show that the dominating communication pattern is an overall all-to-all exchange (every process communicates to every other process and roughly the same amount of data is exchanged between any two processes), thus providing preliminary guidance for future application or network design optimization efforts.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133509633","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
A cache topology-aware multi-query scheduler for multicore architectures 用于多核体系结构的缓存拓扑感知多查询调度器
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-10-01 DOI: 10.1109/IISWC.2014.6983047
Umut Orhan, W. Ding, Praveen Yedlapalli, M. Kandemir, Özcan Özturk
{"title":"A cache topology-aware multi-query scheduler for multicore architectures","authors":"Umut Orhan, W. Ding, Praveen Yedlapalli, M. Kandemir, Özcan Özturk","doi":"10.1109/IISWC.2014.6983047","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983047","url":null,"abstract":"Growing performance gap between processors and main memory has made it worthwhile to consider off-chip data accesses in multi-query processing [2], [1], [3]. Exploiting data-sharing opportunities among concurrent queries can be critical for effective utilization of the underlying shared memory hierarchy. Given a set of queries, there may be a common retrieval operation for several cases to the same data. A query can benefit from the data previously loaded into the shared cache/memory space by another query. However, if these queries are scheduled independently, it is very likely that the same data is brought from off-chip memory to on-chip caches multiple times, thereby consuming off-chip bandwidth and slowing down overall execution.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127015322","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}
引用次数: 2
Thread-level speculation on off-the-shelf hardware transactional memory 对现成硬件事务性内存的线程级推测
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-10-01 DOI: 10.1109/IISWC.2014.6983060
Rei Odaira, T. Nakaike
{"title":"Thread-level speculation on off-the-shelf hardware transactional memory","authors":"Rei Odaira, T. Nakaike","doi":"10.1109/IISWC.2014.6983060","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983060","url":null,"abstract":"Thread-level speculation can speed up a single-thread application by splitting its execution into multiple tasks and speculatively executing those tasks in multiple threads. Efficient thread-level speculation requires hardware support for memory conflict detection, store buffering, and execution rollback, and in addition, previous research has also proposed advanced optimization facilities, such as ordered transactions and data forwarding. Recently, implementations of hardware transactional memory (HTM) are coming into the market with minimal hardware support for thread-level speculation. However, few implementations offer advanced optimization facilities. Thus, it is important to determine how well thread-level speculation can be realized on the current HTM implementations, and what optimization facilities should be implemented in the future. In our research, we studied thread-level speculation on the off-the-shelf HTM implementation in Intel TSX. We manually modified potentially parallel benchmarks in SPEC CPU2006 for thread-level speculation. Our experimental results showed that thread-level speculation resulted in up to an 11% speed-up even without the advanced optimization facilities, but actually degraded the performance in most cases. In contrast to our expectations, the main reason for the performance loss was not the lack of hardware support for ordered transactions but the transaction aborts due to memory conflicts. Our investigation suggests that future hardware should support not only ordered transactions but also memory data forwarding, data synchronization, multi-version cache, and word-level conflict detection for thread-level speculation.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132158967","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}
引用次数: 27
Characterizing and subsetting big data workloads 描述和细分大数据工作负载
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 2014-09-01 DOI: 10.1109/IISWC.2014.6983058
Zhen Jia, Jianfeng Zhan, Lei Wang, Rui Han, S. Mckee, Qiang Yang, Chunjie Luo, Jingwei Li
{"title":"Characterizing and subsetting big data workloads","authors":"Zhen Jia, Jianfeng Zhan, Lei Wang, Rui Han, S. Mckee, Qiang Yang, Chunjie Luo, Jingwei Li","doi":"10.1109/IISWC.2014.6983058","DOIUrl":"https://doi.org/10.1109/IISWC.2014.6983058","url":null,"abstract":"Big data benchmark suites must include a diversity of data and workloads to be useful in fairly evaluating big data systems and architectures. However, using truly comprehensive benchmarks poses great challenges for the architecture community. First, we need to thoroughly understand the behaviors of a variety of workloads. Second, our usual simulation-based research methods become prohibitively expensive for big data. As big data is an emerging field, more and more software stacks are being proposed to facilitate the development of big data applications, which aggravates these challenges. In this paper, we first use Principle Component Analysis (PCA) to identify the most important characteristics from 45 metrics to characterize big data workloads from BigDataBench, a comprehensive big data benchmark suite. Second, we apply a clustering technique to the principle components obtained from the PCA to investigate the similarity among big data workloads, and we verify the importance of including different software stacks for big data benchmarking. Third, we select seven representative big data workloads by removing redundant ones and release the BigDataBench simulation version, which is publicly available from http://prof.ict.ac.cn/BigDataBench/simulatorversion/.","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009978","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}
引用次数: 84
Message from the general chair 主席的口信
2014 IEEE International Symposium on Workload Characterization (IISWC) Pub Date : 1900-01-01 DOI: 10.1109/pads.2011.5936771
Lingjia Tang, Linxin Zhang
{"title":"Message from the general chair","authors":"Lingjia Tang, Linxin Zhang","doi":"10.1109/pads.2011.5936771","DOIUrl":"https://doi.org/10.1109/pads.2011.5936771","url":null,"abstract":"Our EMA data show that the longer VOT duration of the coronal non-emphatic /t/ compared to its emphatic cognate /T/ is due to: (i) the laminal articulatory contact during /t/ vs., contact apical during /T/, (ii) the jaw position which reaches its target at the release of /t/, and before it during /T/. We propose that this apical contact during the emphatics, and their unexpectedly high jaw position, are bound to the biomechanics constrains of emphasis (pharyngealization). ARTICULATORY CHARACTERISTICS OF ANTERIOR CLICK CLOSURES IN N|UU Bonny Sands1, Johanna Brugman2, Mats Exter3, Levi Namaseb4 & Amanda Miller2 1Northern Arizona University; 2Cornell University; 3University of Cologne; 4University of Namibia ID 1540 [full paper] We document the anterior places of articulation in the N|uu click types [|, !, {, }] using palatography and linguography. We discuss the variability seen across speakers and compare these articulations with the crosslinguistic variation reported for comparable clicks. We show that inter-speaker variability found for anterior click place of articulation is comparable to that found for coronal pulmonic consonants. Sociophonetics I Monday, 16:00, Room: 4 (Green) Chair: Gerry Docherty FRICATION OF AUSTRALIAN ENGLISH /p t k/: GROUP TENDENCIES AND INDIVIDUAL DIFFERENCES Deborah Loakes1 & Kirsty McDougall2 1University of Melbourne; 2University of Cambridge ID 1583 [full paper] This paper presents an analysis of frication of Australian English voiceless plosives in spontaneous","PeriodicalId":448397,"journal":{"name":"2014 IEEE International Symposium on Workload Characterization (IISWC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338764","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
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学术官方微信
小红书