2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)最新文献

筛选
英文 中文
Markov Modelling of the IEEE 802.11 DCF for Real-Time Applications with Periodic Traffic 具有周期性流量的实时应用中IEEE 802.11 DCF的马尔可夫建模
Guosong Tian, Yu-Chu Tian
{"title":"Markov Modelling of the IEEE 802.11 DCF for Real-Time Applications with Periodic Traffic","authors":"Guosong Tian, Yu-Chu Tian","doi":"10.1109/HPCC.2010.51","DOIUrl":"https://doi.org/10.1109/HPCC.2010.51","url":null,"abstract":"Popular wireless network standards, such as IEEE 802.11/15/16, are increasingly adopted in real-time control systems. However, they are not designed for real-time applications. Therefore, the performance of such wireless networks needs to be carefully evaluated before the systems are implemented and deployed. While efforts have been made to model general wireless networks with completely random traffic generation, there is a lack of theoretical investigations into the modelling of wireless networks with periodic real-time traffic. Considering the widely used IEEE 802.11 standard, with the focus on its distributed coordination function (DCF), for soft-real-time control applications, this paper develops an analytical Markov model to quantitatively evaluate the network quality-of-service (QoS) performance in periodic real-time traffic environments. Performance indices to be evaluated include throughput capacity, transmission delay and packet loss ratio, which are crucial for real-time QoS guarantee in real-time control applications. They are derived under the critical real-time traffic condition, which is formally defined in this paper to characterize the marginal satisfaction of real-time performance constraints.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787028","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}
引用次数: 12
An Effective Scheduling Method for More Reliable Execution on Desktop Grids 一种更可靠的桌面网格调度方法
Ju-Ho Hyun
{"title":"An Effective Scheduling Method for More Reliable Execution on Desktop Grids","authors":"Ju-Ho Hyun","doi":"10.1109/HPCC.2010.62","DOIUrl":"https://doi.org/10.1109/HPCC.2010.62","url":null,"abstract":"A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to volatility of computing resources, effective scheduling for reliable execution of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing cases of task suspension and failure for more reliable execution of tasks as well as improving the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from several desktops and workstations. Then, based on this data, the execution of parallel applications consisting of independent tasks was simulated using trace-driven simulation. The simulation results showed that the proposed method reduced instances of application suspension and failure significantly when compared to FCFS by 52% and 78% on average, respectively. In addition, the total execution time of the target applications was also improved in most simulations when compared to previous desktop grid scheduling methods.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126606693","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
Towards Online Application Cache Behaviors Identification in CMPs 基于cmp的在线应用缓存行为识别
Xiaomin Jia, Jiang Jiang, Tianlei Zhao, Shubo Qi, Minxuan Zhang
{"title":"Towards Online Application Cache Behaviors Identification in CMPs","authors":"Xiaomin Jia, Jiang Jiang, Tianlei Zhao, Shubo Qi, Minxuan Zhang","doi":"10.1109/HPCC.2010.12","DOIUrl":"https://doi.org/10.1109/HPCC.2010.12","url":null,"abstract":"On chip multiprocessors (CMPs) platforms, multiple co-scheduled applications can severely degrade performance and quality of service (QoS) when they contend for last-level cache (LLC) resources. Whether an application will impose destructive interference on co-scheduled applications is largely dependent on its own inherent cache access behavior characteristics. In this work, we first present case studies that show how inter-application interferences result in undesirable performance in both shared and private cache based LLC designs. We then propose a new online approach for application cache behavior identification on the basis of detailed simulation and analysis with SPEC CPU2006 benchmarks. We demonstrate that our approach can more concisely identify application cache behaviors. Moreover, the proposed approach can be implemented directly in hardware to dynamically identify the application cache behaviors at runtime. Finally, we show with two case studies that how the proposed approach can be adopted by both shared and private based cache sharing mechanisms, i.e. cache partitioning algorithms (CPAs) and cache spilling techniques, for more concise cache resource management.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971230","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}
引用次数: 8
A Throughput Optimizing Routing Protocol for Wireless Mesh Networks 无线网状网络的吞吐量优化路由协议
Jaydip Sen
{"title":"A Throughput Optimizing Routing Protocol for Wireless Mesh Networks","authors":"Jaydip Sen","doi":"10.1109/HPCC.2010.33","DOIUrl":"https://doi.org/10.1109/HPCC.2010.33","url":null,"abstract":"Wireless mesh networks (WMNs) have emerged as a key technology for next generation wireless networks showing rapid progress and inspiring numerous applications. The persistence driving force in the development of WMNs comes from their envisioned advantages including extended coverage, robustness, self-configuration, easy maintenance, and low cost. However, to support real-time applications, WMNs must be equipped with a robust, reliable and efficient routing protocol so that packets can be routed through them with minimum delay. In this paper, we identify some critical factors in designing a routing protocol for WMNs, and propose an efficient and reliable routing protocol. The protocol is based on a reliable estimation of wireless link quality and the available bandwidth on a routing path. It also minimizes control overhead by effectively controlling broadcast messages in the network. Simulations carried out on the protocol demonstrate that it is more efficient than some of the current routing protocols.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492823","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}
引用次数: 7
Optimizing Sparse Matrix Vector Multiplication Using Diagonal Storage Matrix Format 使用对角存储矩阵格式优化稀疏矩阵向量乘法
Liang Yuan, Yunquan Zhang, Xiangzheng Sun, Ting Wang
{"title":"Optimizing Sparse Matrix Vector Multiplication Using Diagonal Storage Matrix Format","authors":"Liang Yuan, Yunquan Zhang, Xiangzheng Sun, Ting Wang","doi":"10.1109/HPCC.2010.67","DOIUrl":"https://doi.org/10.1109/HPCC.2010.67","url":null,"abstract":"Sparse matrix vector multiplication (SpMV) is used in many scientific computations. The main bottleneck of this algorithm is memory bandwidth and many methods reduce memory bandwidth usage by compressing the index array. The matrices from finite difference modeling applications often have several dense diagonals and sparse diagonals. For these matrices, the index array can be deleted by using diagonal storage format (DIA) to store dense diagonals and DIA & CSR mixed algorithm. In this paper we propose two improved sparse matrix storage format based on DIA format and the corresponding SpMV algorithms. We present the performance results on two platforms, which show that our method can reduce the memory usage for a wide range of sparse matrices and achieve speedup up to 1.87.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591964","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
An Adaptive Routing Protocol Associated with Urban Traffic Control Mechanism for Vehicular Sensor Networks 基于城市交通控制机制的车辆传感器网络自适应路由协议
Xin Su, S. Moh, I. Chung, Dongmin Choi
{"title":"An Adaptive Routing Protocol Associated with Urban Traffic Control Mechanism for Vehicular Sensor Networks","authors":"Xin Su, S. Moh, I. Chung, Dongmin Choi","doi":"10.1109/HPCC.2010.61","DOIUrl":"https://doi.org/10.1109/HPCC.2010.61","url":null,"abstract":"Recently, vehicular sensor networks (VSNs) have emerged as a new wireless sensor network paradigm that is envisioned to revolutionize driving experiences and traffic control systems. Many existing routing protocols for VSNs have good performance on data routing in a city environment. In this paper, we propose a traffic control aware routing for VSNs, which is called PUT. It considers two modules of (i) the traffic control aware selection of vertices through which a packet is passed toward its destination and (ii) the greedy forwarding strategy by which a packet is forwarded between two adjacent vertices. The simulation results show that the proposed PUT outperforms conventional protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116567055","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
Hybrid Distributed-/Shared-Memory Parallelization For Re-initializing Level Set Functions 用于重新初始化水平集函数的混合分布式/共享内存并行化
Oliver Fortmeier, H. M. Bücker
{"title":"Hybrid Distributed-/Shared-Memory Parallelization For Re-initializing Level Set Functions","authors":"Oliver Fortmeier, H. M. Bücker","doi":"10.1109/HPCC.2010.64","DOIUrl":"https://doi.org/10.1109/HPCC.2010.64","url":null,"abstract":"The ever-increasing power of high-performance computers and advances in numerical techniques make possible the realistic study of two-phase flow problems in three spatial dimensions. Unfortunately, today, there is often still a gap between the design of numerical algorithms and the characteristics of the hardware on which the algorithms are executed. For the solution of a particular sub problem of a two-phase flow problem, we develop a numerical algorithm that aims to match the architecture of a cluster of nodes with multi-core chips. The algorithm is concerned with the re-initialization of level set function used to keep track of the interface between two phases of a fluid. It consists of a hybrid MPI/OpenMP parallelization strategy, using a domain decomposition approach on the outermost level of parallelization. On the inner level, a parallel region handles an individual sub domain. So, a domain decomposition approach based on MPI is combined with an OpenMP approach leading to a hybrid distributed-/shared-memory parallelization. Numerical experiments show that using such a hybrid strategy scales better than a pure MPI parallelization on two different Xeon-based clusters of quad-core processors using up to 1024 cores.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113951155","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
Enhancing Muesli's Data Parallel Skeletons for Multi-core Computer Architectures 增强Muesli的多核计算机体系结构的数据并行骨架
P. Ciechanowicz, H. Kuchen
{"title":"Enhancing Muesli's Data Parallel Skeletons for Multi-core Computer Architectures","authors":"P. Ciechanowicz, H. Kuchen","doi":"10.1109/HPCC.2010.23","DOIUrl":"https://doi.org/10.1109/HPCC.2010.23","url":null,"abstract":"Algorithmic skeletons encapsulate typical parallel programming patterns such that they can be easily applied by users. Existing skeleton libraries usually work on distributed memory machines. We present an extension of our skeleton library Muesli which now allows to use the same application without modifications on a variety of parallel machines ranging from multi-processor distributed memory to many-core shared memory machines and combinations of those such as clusters of multi-core nodes. Internally, the skeletons are based on MPI and Open MP. We demonstrate the efficiency of our approach by providing experimental results.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114743165","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}
引用次数: 63
ASAAS: Application Software as a Service for High Performance Cloud Computing ASAAS:用于高性能云计算的应用软件即服务
Zhengxiong Hou, Xingshe Zhou, Jianhua Gu, Yunlan Wang, Tianhai Zhao
{"title":"ASAAS: Application Software as a Service for High Performance Cloud Computing","authors":"Zhengxiong Hou, Xingshe Zhou, Jianhua Gu, Yunlan Wang, Tianhai Zhao","doi":"10.1109/HPCC.2010.76","DOIUrl":"https://doi.org/10.1109/HPCC.2010.76","url":null,"abstract":"Currently, SAAS (Software as a Service) solutions are usually provided for business, such as salesforce.com. Few work focus on the application software for high performance scientific computing. However, in the high performance cloud computing environment, traditional application software is not intrinsically service oriented. And the limitation of traditional software licenses is a bottleneck problem for large scale of dynamic users. To enable on-demand services for applications, we propose a solution: Application Software as a Service (ASAAS). It provides a web services portal, an on-demand software license service for the users. Application software is wrapped as web services on the basis of underlying computational resources. With a pay-for-use mode, there is no limitation for the licenses any more. The instant service rate, average job response time, and cost are analyzed for an evaluation. A case of implementation and the evaluation show that ASAAS can bring a much better effect than traditional mechanism.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124358622","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}
引用次数: 28
Developing a Parameterized Performance Proxy for Sequential Scientific Kernels 时序科学核的参数化性能代理
H. Shan, E. Strohmaier
{"title":"Developing a Parameterized Performance Proxy for Sequential Scientific Kernels","authors":"H. Shan, E. Strohmaier","doi":"10.1109/HPCC.2010.50","DOIUrl":"https://doi.org/10.1109/HPCC.2010.50","url":null,"abstract":"A simple, synthetic performance proxy for scientific applications is of great interest to the scientific computing community for the development of new products, procurements, and performance related questions in general. To develop such a performance proxy, we enhance the capability of the memory performance benchmark, Apex-MAP, by adding new concepts to capture the effects of computational details and programming styles. We test the fidelity of using Apex-MAP as a performance proxy with five sequential kernels on three different platforms with five inputs each. The relative performance difference between the kernels and Apex-MAP configured with corresponding parameters is generally within 10%. The quality of prediction measured by the coefficient of determination R^2 is over 98% for most cases. We also discuss experiences we gained during this study about how to improve the current version of Apex-MAP without affecting its basic concepts and designs so that it can reliably be used across platforms.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125463878","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学术官方微信
小红书