2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems最新文献_第4页

Connectivity in Wireless Sensor Networks in the SINR Model 无线传感器网络中SINR模型的连通性

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.26

Min Kyung An, Nhat X. Lam, D. Huynh, Trac N. Nguyen

引用次数: 8

Using Software-Defined Radio to Validate Wireless Models in Simulation 利用软件定义无线电在仿真中验证无线模型

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.47

K. Mandke, S. Nettles

引用次数: 0

NetSim-Steer: A Runtime Steering Framework for Network Simulators NetSim-Steer:网络模拟器的运行时转向框架

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.64

S. Ciraci, B. Akyol

引用次数: 1

Split Phase Multi-channel MAC Protocols - Formal Specification and Analysis 分阶段多通道MAC协议。正式规范和分析

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.73

A. Fatni, G. Juanole

引用次数: 3

Evaluation of Multi-core Scalability Bottlenecks in Enterprise Java Workloads 企业Java工作负载中多核可伸缩性瓶颈的评估

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.43

X. Guerin, Wei Tan, Yanbin Liu, Seetharami R. Seelam, Parijat Dube

引用次数: 6

Extrapolation Pitfalls When Evaluating Limited Endurance Memory 评估有限耐力记忆时的外推陷阱

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.38

Rishiraj A. Bheda, Jesse G. Beu, Brian P. Railing, T. Conte

{"title":"Extrapolation Pitfalls When Evaluating Limited Endurance Memory","authors":"Rishiraj A. Bheda, Jesse G. Beu, Brian P. Railing, T. Conte","doi":"10.1109/MASCOTS.2012.38","DOIUrl":"https://doi.org/10.1109/MASCOTS.2012.38","url":null,"abstract":"Many new non-volatile memory technologies have been considered as a future scalable alternative to DRAM. Memory technologies such as MRAM, FeRAM, PCM have emerged as the most viable alternatives. But these memories have limited wear endurance. Practically realizable main memory systems employing these memory technologies are possible only if the wear across these memories is reduced as well as uniformly distributed. Limited endurance has resulted in extensive wear leveling research with the goal of uniformly distributing write traffic throughout available physical memory. Basic support for wear leveling is already present in existing systems, in the form of operating system paging. The Operating System (OS) changes virtual to physical translations over time. As a result, write traffic is naturally spread out. Proper evaluation of the need for wear leveling as well as the impact of the corresponding technique must take this phenomenon into account. Ignoring the effect of OS paging mechanism can result in highly inaccurate memory lifetime extrapolations. We demonstrate through simulation results, the effects of inaccurate extrapolations in the absence of OS modeling. Accurate memory lifetime simulation can take from many months to years. Although sampling techniques are commonly employed for speedup, our results show that naïve extrapolation techniques can lead to wildly different lifetime estimates. We show how sampling can be accurately applied by accounting for the different components in the write stream observed by main memory. Finally, we present a heuristic to quickly estimate memory lifetime for a given application.","PeriodicalId":278764,"journal":{"name":"2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126944552","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 Scalability Collapse via Requester-Based Locking on Multicore Systems 在多核系统上通过基于请求者的锁定减少可伸缩性崩溃

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.42

Yan Cui, Yingxin Wang, Yu Chen, Yuanchun Shi, Wei Han, Xin Liao, Fei Wang

{"title":"Reducing Scalability Collapse via Requester-Based Locking on Multicore Systems","authors":"Yan Cui, Yingxin Wang, Yu Chen, Yuanchun Shi, Wei Han, Xin Liao, Fei Wang","doi":"10.1109/MASCOTS.2012.42","DOIUrl":"https://doi.org/10.1109/MASCOTS.2012.42","url":null,"abstract":"In response to the increasing ubiquity of multicore processors, there has been widespread development of multithreaded applications that strive to realize their full potential. Unfortunately, lock contention within operating systems can limit the scalability of multicore systems so severely that an increase in the number of cores can actually lead to reduced performance (i.e. scalability collapse). Existing lock implementations have disadvantages in scalability, resource utilization and energy efficiency. In this work, we observe that the number of tasks requesting a lock has a significant correlation with the occurrence of scalability collapse. Based on this observation, we propose a novel lock implementation that allows tasks blocked on a lock to either spin or maintain a power-saving state according to the number of lock requesters. We call our lock implementation protocol a requester-based lock and implement it in the Linux kernel to replace its default spin lock. Based on the results of an analysis, we find that the best policy for a task waiting for a lock to become free is to enter the power saving state immediately after noticing that the lock cannot be acquired. Our lock-requester based lock scheme is evaluated using micro- and macro-benchmarks on AMD 32-core and Intel 40-core systems. Experimental results indicate our lock scheme removes scalability collapse completely for most applications. Furthermore, our method shows better scalability and energy efficiency than mutex locks and adaptive locks.","PeriodicalId":278764,"journal":{"name":"2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738738","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

Analyzing Parallelization and Program Performance in Heterogeneous MPSoCs 异构mpsoc的并行化与程序性能分析

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.61

Chao Wang, Xi Li, Junneng Zhang, Gangyong Jia, Peng Chen, Xuehai Zhou

引用次数: 2

Barrier Counting in Mixed Wireless Sensor Networks 混合无线传感器网络中的屏障计数

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.48

Shambhavi Srinivasa, C. Williamson, Zongpeng Li

引用次数: 1

MERCURY: A Scalable and Similarity-Aware Scheme in Multi-level Cache Hierarchy 多级缓存层次结构中的可伸缩和相似性感知方案

2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2012-08-07 DOI: 10.1109/MASCOTS.2012.49

Yu Hua, Xue Liu, D. Feng

{"title":"MERCURY: A Scalable and Similarity-Aware Scheme in Multi-level Cache Hierarchy","authors":"Yu Hua, Xue Liu, D. Feng","doi":"10.1109/MASCOTS.2012.49","DOIUrl":"https://doi.org/10.1109/MASCOTS.2012.49","url":null,"abstract":"The management of multi-level caching hierarchy is a critical and challenging task. Although there exist many hardware and OS-based schemes, they are difficult to be adopted in practice since they incur non-trivial overheads and high complexity. In order to efficiently deal with this challenge, we propose MERCURY, a cost-effective and lightweight hardware support to coordinate with OS-based cache management schemes. Its basic idea is to leverage data similarity to reduce data migration costs and deliver high performance. Moreover, in order to accurately and efficiently capture the data similarity, we propose to use low-complexity Locality-Sensitive Hashing (LSH). In our design, in addition to the problem of space inefficiency, we identify that a conventional LSH scheme also suffers from the problem of homogeneous data placement. To address these two problems, we design a novel Multi-Core-enabled LSH (MC-LSH) that accurately captures the differentiated similarity across data. The similarity-aware MERCURY hence efficiently partitions data into L1 cache, L2 cache and main memory based on their distinct localities, which help optimize cache utilization and minimize the pollution in the last level cache. Experiments through real-world benchmarks further corroborate the efficacy and efficiency of MERCURY.","PeriodicalId":278764,"journal":{"name":"2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117324838","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