Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017095
P. Subedi, Ping Huang, Xubin He, Ming Zhang, Jizhong Han
The high performance and ever-increasing capacity of flash memory has led to the rapid adoption of Solid-State Disks (SSDs) in mass storage systems. In order to increase disk capacity, multi-level cells (MLC) are used in the design of SSDs, but the use of such SSDs in persistent storage systems raise concerns for users due to the low reliability of such disks. In this paper, we present a hybrid erasure-coded (EECC) architecture that incorporates ECC schemes and erasure codes to improve both performance and reliability. As weak error-correction codes have faster decoding speed than complex error correction codes (ECC), we propose the use of weak-ECC at the segment level rather than complex ECC. To compensate the reduced correction ability of weak-ECC, we use an erasure code that is striped across segments rather than pages or blocks. We use a small sized HDD to store parities so that we can leverage parallelism across multiple devices and remove the parity updates from the critical write path. We carry out simulation experiments based on Disksim to demonstrate that our proposed scheme is able reduce the SSD average read-latency by up to 31.23% and along with tolerance from double chip failures, it dramatically reduces the uncorrectable page error rate.
{"title":"A hybrid erasure-coded ECC scheme to improve performance and reliability of solid state drives","authors":"P. Subedi, Ping Huang, Xubin He, Ming Zhang, Jizhong Han","doi":"10.1109/PCCC.2014.7017095","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017095","url":null,"abstract":"The high performance and ever-increasing capacity of flash memory has led to the rapid adoption of Solid-State Disks (SSDs) in mass storage systems. In order to increase disk capacity, multi-level cells (MLC) are used in the design of SSDs, but the use of such SSDs in persistent storage systems raise concerns for users due to the low reliability of such disks. In this paper, we present a hybrid erasure-coded (EECC) architecture that incorporates ECC schemes and erasure codes to improve both performance and reliability. As weak error-correction codes have faster decoding speed than complex error correction codes (ECC), we propose the use of weak-ECC at the segment level rather than complex ECC. To compensate the reduced correction ability of weak-ECC, we use an erasure code that is striped across segments rather than pages or blocks. We use a small sized HDD to store parities so that we can leverage parallelism across multiple devices and remove the parity updates from the critical write path. We carry out simulation experiments based on Disksim to demonstrate that our proposed scheme is able reduce the SSD average read-latency by up to 31.23% and along with tolerance from double chip failures, it dramatically reduces the uncorrectable page error rate.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133497415","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017066
Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang
The proliferation of mobile devices has facilitated the prevalence of participatory sensing applications in which participants collect and share information in their environments. The design of a participatory sensing application confronts two challenges: “privacy” and “incentive” which are two conflicting objectives and deserve deeper attention. Inspired by physical currency circulation system, this paper firstly proposes E-cent, a unit bearer currency. It is exchangeable, and participants can utilize it to participate in tasks anonymously. By employing E-cent, we further propose an E-cent-based privacy-preserving incentive mechanism, called EPPI, which exploits a pledge-based participating protocol to encourage participants to participate without revealing privacy and prohibit participants from sending false data. EPPI also takes advantage of a dynamic reward allocation scheme to maximize the value of the services under a budget constraint. To the best of our knowledge, EPPI is the first attempt to build an incentive mechanism while maintaining the desired privacy-preserving in participatory sensing systems. Extensive simulation and analysis results show that EPPI can achieve high anonymity level and remarkable incentive effects.
{"title":"EPPI: An E-cent-based privacy-preserving incentive mechanism for participatory sensing systems","authors":"Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang","doi":"10.1109/PCCC.2014.7017066","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017066","url":null,"abstract":"The proliferation of mobile devices has facilitated the prevalence of participatory sensing applications in which participants collect and share information in their environments. The design of a participatory sensing application confronts two challenges: “privacy” and “incentive” which are two conflicting objectives and deserve deeper attention. Inspired by physical currency circulation system, this paper firstly proposes E-cent, a unit bearer currency. It is exchangeable, and participants can utilize it to participate in tasks anonymously. By employing E-cent, we further propose an E-cent-based privacy-preserving incentive mechanism, called EPPI, which exploits a pledge-based participating protocol to encourage participants to participate without revealing privacy and prohibit participants from sending false data. EPPI also takes advantage of a dynamic reward allocation scheme to maximize the value of the services under a budget constraint. To the best of our knowledge, EPPI is the first attempt to build an incentive mechanism while maintaining the desired privacy-preserving in participatory sensing systems. Extensive simulation and analysis results show that EPPI can achieve high anonymity level and remarkable incentive effects.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129541585","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017096
Myoungwon Oh, Hyeonsang Eom, H. Yeom
Storage I/O in VM (Virtual Machine) environments, which requires low latency, becomes problematic as the fast storage such as SSDs (Solid-State Drives) is currently in use. The low performance problem in the VM environment is caused by 1) the presence of additional software layer such as guest OS, 2) context switching between VM and host OS, and 3) scheduling delay for I/O process. These factors do not cause serious problems in the case of using HDD which leads to high latency batching. However, there will be significant performance degradation when fast storage devices are used. To address this problem, we have proposed the following methods to improve the performance of I/O stack in the VM environments by attempting to optimize the I/O stack: one is pipelined polling, and the other is multiple issues and multiple completions. We have found via experiments that our approach leads to increases in the performance of SSDs in a VM environment by up to 50% when multiple VM storage devices are used, and that it leads to improvements in the performance by more than 80% when a single VM storage device is used, with the CPU utilization reduced by up to 25%.
VM (Virtual Machine)环境中的存储I/O需要低延迟，但随着ssd (Solid-State Drives)等快速存储的使用，存储I/O就会出现问题。VM环境中的低性能问题是由以下原因引起的:1)额外的软件层(如客户机操作系统)的存在;2)VM和主机操作系统之间的上下文切换;3)I/O进程的调度延迟。在使用HDD的情况下，这些因素不会导致导致高延迟批处理的严重问题。然而，当使用快速存储设备时，将会有明显的性能下降。为了解决这个问题，我们提出了以下方法，通过尝试优化I/O堆栈来提高VM环境中I/O堆栈的性能:一种是流水线轮询，另一种是多问题和多完成。我们通过实验发现，当使用多个虚拟机存储设备时，我们的方法可以将虚拟机环境中的ssd性能提高50%，当使用单个虚拟机存储设备时，它可以将性能提高80%以上，CPU利用率降低高达25%。
{"title":"Enhancing the I/O system for virtual machines using high performance SSDs","authors":"Myoungwon Oh, Hyeonsang Eom, H. Yeom","doi":"10.1109/PCCC.2014.7017096","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017096","url":null,"abstract":"Storage I/O in VM (Virtual Machine) environments, which requires low latency, becomes problematic as the fast storage such as SSDs (Solid-State Drives) is currently in use. The low performance problem in the VM environment is caused by 1) the presence of additional software layer such as guest OS, 2) context switching between VM and host OS, and 3) scheduling delay for I/O process. These factors do not cause serious problems in the case of using HDD which leads to high latency batching. However, there will be significant performance degradation when fast storage devices are used. To address this problem, we have proposed the following methods to improve the performance of I/O stack in the VM environments by attempting to optimize the I/O stack: one is pipelined polling, and the other is multiple issues and multiple completions. We have found via experiments that our approach leads to increases in the performance of SSDs in a VM environment by up to 50% when multiple VM storage devices are used, and that it leads to improvements in the performance by more than 80% when a single VM storage device is used, with the CPU utilization reduced by up to 25%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643267","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017089
S. Alam, David K. Y. Yau, S. Fahmy
Sensor nodes are inherently unreliable and prone to hardware or software faults. Thus, they may report untrustworthy or inconsistent data. Assessing the trustworthiness of sensor data items can allow reliable sensing or monitoring of physical phenomena. A provenance-based trust framework can evaluate the trustworthiness of data items and sensor nodes based on the intuition that two data items with similar data values but with different provenance (i.e., forwarding path) can be considered more trustworthy. Forwarding paths of data items generated from redundantly deployed sensors should consist of trustworthy nodes and remain dissimilar. Unfortunately, operating many sensors with dissimilar paths consumes significant energy. In this paper, we formulate an optimization problem to identify a set of sensor nodes and their corresponding paths toward the base station that achieve a certain trustworthiness threshold, while keeping the energy consumption of the network minimal. We prove the NP-hardness of this problem and propose ERUPT, a simulated annealing solution. Testbed and simulation results show that ERUPT achieves high trustworthiness, while reducing total energy consumption by 32-50% with respect to current approaches.
{"title":"ERUPT: Energy-efficient trustworthy provenance trees for wireless sensor networks","authors":"S. Alam, David K. Y. Yau, S. Fahmy","doi":"10.1109/PCCC.2014.7017089","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017089","url":null,"abstract":"Sensor nodes are inherently unreliable and prone to hardware or software faults. Thus, they may report untrustworthy or inconsistent data. Assessing the trustworthiness of sensor data items can allow reliable sensing or monitoring of physical phenomena. A provenance-based trust framework can evaluate the trustworthiness of data items and sensor nodes based on the intuition that two data items with similar data values but with different provenance (i.e., forwarding path) can be considered more trustworthy. Forwarding paths of data items generated from redundantly deployed sensors should consist of trustworthy nodes and remain dissimilar. Unfortunately, operating many sensors with dissimilar paths consumes significant energy. In this paper, we formulate an optimization problem to identify a set of sensor nodes and their corresponding paths toward the base station that achieve a certain trustworthiness threshold, while keeping the energy consumption of the network minimal. We prove the NP-hardness of this problem and propose ERUPT, a simulated annealing solution. Testbed and simulation results show that ERUPT achieves high trustworthiness, while reducing total energy consumption by 32-50% with respect to current approaches.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229240","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017113
Yimao Wang, Yanmin Zhu, Ruobing Jiang, Juan Li
Wireless sensor networks (WSNs) are gaining popularity in practical monitoring and surveillance applications. Because of the limited energy of sensor nodes, many WSNs work in a low duty cycle mode to effectively extend their network lifetime. However, low duty cycling also decreases transmission efficiency and makes data gathering more challenging. By exploiting the redundancy of in real sensing data, we propose a novel and distributed approach for data gathering in wireless sensor networks, employing the compressed sensing theory. Instead of selecting a fixed sink, all data can be retrieved from an arbitrary node within the network. Moreover, we use sequential observations to dynamically fit the sparsity of various data sets. With extensive simulations, we show that our approach is efficient with tunable accuracy in different node duty cycles.
{"title":"Distributed compressive data gathering in low duty cycled wireless sensor networks","authors":"Yimao Wang, Yanmin Zhu, Ruobing Jiang, Juan Li","doi":"10.1109/PCCC.2014.7017113","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017113","url":null,"abstract":"Wireless sensor networks (WSNs) are gaining popularity in practical monitoring and surveillance applications. Because of the limited energy of sensor nodes, many WSNs work in a low duty cycle mode to effectively extend their network lifetime. However, low duty cycling also decreases transmission efficiency and makes data gathering more challenging. By exploiting the redundancy of in real sensing data, we propose a novel and distributed approach for data gathering in wireless sensor networks, employing the compressed sensing theory. Instead of selecting a fixed sink, all data can be retrieved from an arbitrary node within the network. Moreover, we use sequential observations to dynamically fit the sparsity of various data sets. With extensive simulations, we show that our approach is efficient with tunable accuracy in different node duty cycles.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552059","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017031
W. Zhou, Yun Gao, Jizhong Han, Zhiyong Xu
In this paper, we propose Marbor, a novel graph data processing framework to analyze the large-scale data in social network services. It develops an efficient graph organization model to minimize the costs of graph data accesses and reduce the memory consumption. In addition, we present a novel control message method in Marbor to improve the synchronization iterations performance. During the graph data processing, in each iteration, it analyzes the relationships among tasks and forwards the tasks to the next iteration with control messages, so no synchronization operations are used. We compare Marbor with other graph processing methods on several large-scale real world SNS datasets with two widely used applications, and the results show that Marbor outperforms the current mechanisms.
{"title":"Marbor: A novel large-scale graph data storage and processing framework","authors":"W. Zhou, Yun Gao, Jizhong Han, Zhiyong Xu","doi":"10.1109/PCCC.2014.7017031","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017031","url":null,"abstract":"In this paper, we propose Marbor, a novel graph data processing framework to analyze the large-scale data in social network services. It develops an efficient graph organization model to minimize the costs of graph data accesses and reduce the memory consumption. In addition, we present a novel control message method in Marbor to improve the synchronization iterations performance. During the graph data processing, in each iteration, it analyzes the relationships among tasks and forwards the tasks to the next iteration with control messages, so no synchronization operations are used. We compare Marbor with other graph processing methods on several large-scale real world SNS datasets with two widely used applications, and the results show that Marbor outperforms the current mechanisms.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131281879","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017057
D. Vijayakumar, Q. Mahmoud
Despite research spanning more than a decade in the area of Web services, the industry has not yet seen a consensus regarding an effective method for the provisioning of Web services. In recent years, a new paradigm for implementing Web services based on Representational State Transfer, the successful architectural foundation of the Web, has seen greater interest in the industry. We had previously proposed a framework for the implementation of platforms for provisioning community-contributed Web services using the REpresentational State Transfer (REST) paradigm. We had also presented a proof-of-concept prototype implementation of the framework for use as a reference. In this paper, we elaborate more on the prototype by presenting its architecture and then present the results of evaluating the performance of this prototype in order to explore the feasibility of our proposed framework.
尽管在Web服务领域进行了十多年的研究，但业界尚未就提供Web服务的有效方法达成共识。近年来，业界对基于Representational State Transfer (Web的成功架构基础)实现Web服务的新范式产生了更大的兴趣。我们之前提出了一个框架，用于使用具象状态传输(REpresentational State Transfer, REST)范式提供社区贡献的Web服务的平台的实现。我们还提供了框架的概念验证原型实现，以供参考。在本文中，我们通过介绍其架构来详细阐述原型，然后介绍评估该原型性能的结果，以探索我们提出的框架的可行性。
{"title":"Evaluation of a platform for the provisioning of community-contributed web services","authors":"D. Vijayakumar, Q. Mahmoud","doi":"10.1109/PCCC.2014.7017057","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017057","url":null,"abstract":"Despite research spanning more than a decade in the area of Web services, the industry has not yet seen a consensus regarding an effective method for the provisioning of Web services. In recent years, a new paradigm for implementing Web services based on Representational State Transfer, the successful architectural foundation of the Web, has seen greater interest in the industry. We had previously proposed a framework for the implementation of platforms for provisioning community-contributed Web services using the REpresentational State Transfer (REST) paradigm. We had also presented a proof-of-concept prototype implementation of the framework for use as a reference. In this paper, we elaborate more on the prototype by presenting its architecture and then present the results of evaluating the performance of this prototype in order to explore the feasibility of our proposed framework.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131082613","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017056
Qian Yu, WeiTao Weng, Kai Zhang, Kai Lei, Kuai Xu
Sina Weibo has become an increasingly critical social media in China for sharing latest news, marketing new products, and discussing controversial issues. The rising importance of Sina Weibo on the society makes it very important to understand “what”, “when”, “who” on hot topics that are being continuously tweeted and searched by millions of active users. In this paper, we develop a systematic approach to characterize temporal distribution of hot topics searched by Sina Weibo users over a four-month time-span and to uncover correlated hot topics that are not only tweeted by the same users, but also appear in the similar set of tweet messages. We analyze real-time Sina Weibo tweet data streams and study volume correlations and temporal gaps between user searches and tweeting activities on hot topics. In addition, we examine the correlations between hot topic searches on social media and on search engines to understand hot topics and user behaviors across different platforms. Given the challenges of analyzing massive amount of tweet data, we explore Hadoop MapReduce framework to effectively process millions of tweets from the collected data-sets, and quantify the performance benefits of MapReduce on analyzing tweet streams. To the best of our knowledge, this paper is the first effort to characterize temporal search patterns of hot topics on Sina Weibo and to study their correlations with tweeting data streams as well as search engine statistics.
{"title":"Hot topic analysis and content mining in social media","authors":"Qian Yu, WeiTao Weng, Kai Zhang, Kai Lei, Kuai Xu","doi":"10.1109/PCCC.2014.7017056","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017056","url":null,"abstract":"Sina Weibo has become an increasingly critical social media in China for sharing latest news, marketing new products, and discussing controversial issues. The rising importance of Sina Weibo on the society makes it very important to understand “what”, “when”, “who” on hot topics that are being continuously tweeted and searched by millions of active users. In this paper, we develop a systematic approach to characterize temporal distribution of hot topics searched by Sina Weibo users over a four-month time-span and to uncover correlated hot topics that are not only tweeted by the same users, but also appear in the similar set of tweet messages. We analyze real-time Sina Weibo tweet data streams and study volume correlations and temporal gaps between user searches and tweeting activities on hot topics. In addition, we examine the correlations between hot topic searches on social media and on search engines to understand hot topics and user behaviors across different platforms. Given the challenges of analyzing massive amount of tweet data, we explore Hadoop MapReduce framework to effectively process millions of tweets from the collected data-sets, and quantify the performance benefits of MapReduce on analyzing tweet streams. To the best of our knowledge, this paper is the first effort to characterize temporal search patterns of hot topics on Sina Weibo and to study their correlations with tweeting data streams as well as search engine statistics.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"34 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133008489","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017027
J. Issa
Given the rapid change in processor architecture in the past years, there is a driving necessity to assess processor performance for a high performance computation workload. Assessing performance for a given workload is important to understand which architecture parameters the workload performance is sensitive to. A given workload can be categorized as memory bounded, compute bounded, or in between. In this paper we present performance sensitivity analysis for a high performance computation workload using LS-DYNA/car2car. We derive a sensitivity analysis for this workload with respect to different processor architecture parameters such as number for threads and memory. We also propose a performance estimation analytical model in which we can estimate performance for LS-DYNA workload by changing specific processor architecture parameters. The models is verified to estimate performance for different processor architectures with error margin <;5%.
{"title":"A novel method to estimate performance for a high performance computation workload","authors":"J. Issa","doi":"10.1109/PCCC.2014.7017027","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017027","url":null,"abstract":"Given the rapid change in processor architecture in the past years, there is a driving necessity to assess processor performance for a high performance computation workload. Assessing performance for a given workload is important to understand which architecture parameters the workload performance is sensitive to. A given workload can be categorized as memory bounded, compute bounded, or in between. In this paper we present performance sensitivity analysis for a high performance computation workload using LS-DYNA/car2car. We derive a sensitivity analysis for this workload with respect to different processor architecture parameters such as number for threads and memory. We also propose a performance estimation analytical model in which we can estimate performance for LS-DYNA workload by changing specific processor architecture parameters. The models is verified to estimate performance for different processor architectures with error margin <;5%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130803917","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}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017029
Rosangela Melo, Maria Clara Bezerra, J. Dantas, Rúbens de Souza Matos Júnior, I. J. M. Filho, P. Maciel
Cloud computing environments provide powerful storage and processing capabilities, as well as other computational resources. Due to the business potential of the pay-peruse model, as well as the advantages of easy scalability, up-to-date Video on Demand (VoD) streaming services rely on cloud infrastructures to offer a wide variety of multimedia content. This paper proposes the application of availability models to a cloud environment designed for a video streaming service. Sensitivity analysis is proposed to identify the availability bottlenecks.
{"title":"Sensitivity analysis of availability of video streaming service in cloud computing","authors":"Rosangela Melo, Maria Clara Bezerra, J. Dantas, Rúbens de Souza Matos Júnior, I. J. M. Filho, P. Maciel","doi":"10.1109/PCCC.2014.7017029","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017029","url":null,"abstract":"Cloud computing environments provide powerful storage and processing capabilities, as well as other computational resources. Due to the business potential of the pay-peruse model, as well as the advantages of easy scalability, up-to-date Video on Demand (VoD) streaming services rely on cloud infrastructures to offer a wide variety of multimedia content. This paper proposes the application of availability models to a cloud environment designed for a video streaming service. Sensitivity analysis is proposed to identify the availability bottlenecks.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405326","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：