2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)最新文献_第2页

A novel algorithm for sparse FFT pruning and its applications to OFDMA technology 一种新的稀疏FFT剪枝算法及其在OFDMA技术中的应用

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017080

S. Abdulla, Haewoon Nam, J. Abraham

引用次数: 0

Performance enhancement in shared-memory multiprocessors using dynamically classified sharing information 使用动态分类共享信息增强共享内存多处理器的性能

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017063

Nilufa Ferdous, Byeong Kil Lee, E. John

{"title":"Performance enhancement in shared-memory multiprocessors using dynamically classified sharing information","authors":"Nilufa Ferdous, Byeong Kil Lee, E. John","doi":"10.1109/PCCC.2014.7017063","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017063","url":null,"abstract":"Advances in process technology has enabled the integration of many cores on a single die. The advent of many core systems has led to a commensurate increase in cache coherence complexity. As a solution to this problem, researches have proposed directory based protocols, which are scalable alternatives to snoop-based protocols. Although write-invalidation based directory protocols enhance the performance of large-scale multiprocessors, coherence misses are intrinsic impediments in such systems. Write-update protocols were proposed as a means to reduce these coherence misses. However, previous researches have shown that pure write-update protocol is highly undesirable because of the heavy traffic caused by the aggressive updates. In order to remedy these limitations, we propose a performance-aware mechanism which dynamically classifies the sharers of each cache block, either as a weak-sharing-group or an efficient-sharing-group and exploit this dynamic classification as a metric for seamless dynamic adaptation between write-invalidate and write-update strategy on a per block basis. Exploitation of the dynamic adaptation of the protocol, based on the sharing-group speculation, reduces unnecessary accesses to the shared last level cache and hence reduces the traffic caused by coherence misses and directory accesses. Simulation results on a 64-core CMP show that our proposed method can achieve 15 % (average) speedup over the baseline directory-based MOESI cache coherence protocol with PARSEC workloads. Our proposed work also reduces the L1 cache miss rate by 17 %(average). The network traffic caused by directory accesses and L1 read misses are also reduced by 16% and 17% respectively.","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":"122164368","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

Design of antenna arrays for isoflux radiation in satellite systems 卫星系统等通量辐射天线阵列设计

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017028

Miguel Ibarra, Á. G. Andrade, M. Panduro, A. Mendez

引用次数: 4

Efficient and enhanced broadcast authentication protocols based on multilevel μTESLA 基于多级μTESLA的高效增强型广播认证协议

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017109

Xiang Li, Na Ruan, Fan Wu, Jie Li, Mengyuan Li

引用次数: 17

A light-weight authentication scheme based on message digest and location for mobile cloud computing 基于消息摘要和位置的移动云计算轻量级身份验证方案

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017041

Saurabh Dey, S. Sampalli, Qiang Ye

引用次数: 11

An efficient time-stamping solution for long-term digital archiving 一个有效的时间戳解决方案，用于长期数字存档

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017099

M. Vigil, Christian Weinert, Denise Demirel, J. Buchmann

引用次数: 4

Secure data provenance compression using arithmetic coding in wireless sensor networks 无线传感器网络中使用算术编码的安全数据来源压缩

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017068

Syed Rafiul Hussain, Changda Wang, Salmin Sultana, E. Bertino

{"title":"Secure data provenance compression using arithmetic coding in wireless sensor networks","authors":"Syed Rafiul Hussain, Changda Wang, Salmin Sultana, E. Bertino","doi":"10.1109/PCCC.2014.7017068","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017068","url":null,"abstract":"Since data are originated and processed by multiple agents in wireless sensor networks, data provenance plays an important role for assuring data trustworthiness. However, the size of the provenance tends to increase at a higher rate as it is transmitted from the source to the base station and is processed by many intermediate nodes. Due to bandwidth and energy limitations of wireless sensor networks, such increasing of provenance size slows down the network and depletes the energy of sensor nodes. Therefore, compression of data provenance is an essential requirement. Existing lossy compression schemes based on Bloom filters or probabilistic packet marking approaches have high error rates in provenance-recovery. In this paper, we address this problem and propose a distributed and lossless arithmetic coding based compression technique which achieves a compression ratio higher than that of existing techniques and also close to Shannon's entropy bound. Unlike other provenance schemes, the most interesting characteristic of our scheme is that the provenance size is not directly proportional to the number of hops, but to the occurrence probabilities of the nodes that are on a packet's path. We also ensure the confidentiality, integrity, and freshness of provenance to prevent malicious nodes from compromising the security of data provenance. Finally, the simulation and testbed results provide a strong evidence for the claims in the paper.","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":"130438376","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}

引用次数: 34

Application-aware video-sharing services via provenance in cloud storage 应用程序感知的视频分享服务通过云存储的来源

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017097

Jinjun Liu, D. Feng, Yu Hua, Bin Peng, Pengfei Zuo

{"title":"Application-aware video-sharing services via provenance in cloud storage","authors":"Jinjun Liu, D. Feng, Yu Hua, Bin Peng, Pengfei Zuo","doi":"10.1109/PCCC.2014.7017097","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017097","url":null,"abstract":"With the wide use of video-editing software, more and more similar videos are uploaded to the video-sharing platforms in cloud storage. The large number of near-duplicate videos would not only make the users not satisfactory, but also consume more resources with service providers. Since the near-duplicate videos have redundancy at the content level, the traditional de-duplication technology is not suitable to address the redundancies. In order to decrease the redundancy, we proposed a novel high performance provenance-based video-sharing system, called Provis. Provis records the provenance of the videos and compresses the near-duplicate videos via storing their provenance which replaces storing their video files to improve the space efficiency. When users attempt to upload the edited videos, Provis can rebuild the videos in the cloud via collecting and uploading their provenance to reduce the network overhead of uploading videos. We implemented Provis and compared its performance with other existing video compression techniques. Our evaluation shows that Provis achieves significant space savings.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"9 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":"125741660","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

Reducing (m, k)-missing rate for overloaded real-time systems 降低过载实时系统的(m, k)缺失率

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017035

Alemayehu Mengste, Linwei Niu

引用次数: 2

Energy efficient distributed grouping and scaling for real-time data compression in sensor networks 传感器网络中实时数据压缩的高效分布式分组和缩放

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017073

Tommy Szalapski, S. Madria

引用次数: 3