{"title":"PBFTL: The Page to Block Mapping FTL with Low Response Time","authors":"Zhiguang Chen, Nong Xiao, Fang Liu, Yimo Du","doi":"10.1109/MASCOTS.2011.31","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.31","url":null,"abstract":"NAND flash has some inherent peculiarities which increase the access delay seriously. We propose the Page to Block mapping Flash Translation Layer (PBFTL). Solid State Drives (SSDs) adopting PBFTL have lower response time. To achieve low response time for read requests, PBFTL adopts hybrid-level mapping scheme. But, hybrid-level FTL behaves awkwardly for write due to the high overhead of garbage collection. PBFTL takes two measures to optimize garbage collection. The first is to direct hot and cold data to separate blocks, which mitigates write amplification significantly. The second is to reduce the latency of reclaiming a block, which enables PBFTL to spend less time on garbage collection. User's requests are unlikely to be congested for a long time. Trace-driven simulations show that, PBFTL achieves low response for both read- and write-intensive workloads.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134262961","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}
Q. Le, Kumar SathyanarayanaRaju, A. Amer, J. Holliday
{"title":"Workload Impact on Shingled Write Disks: All-Writes Can Be Alright","authors":"Q. Le, Kumar SathyanarayanaRaju, A. Amer, J. Holliday","doi":"10.1109/MASCOTS.2011.58","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.58","url":null,"abstract":"The data density of magnetic disk has been growing at 30% to 50% per year. However, physical limitations will slow this growth unless creative recording techniques can be found. Shingled writing is a promising technique that trades off the inability to update in-place for narrower tracks and thus a much higher data density. In this paper, we look at a variety of potential workloads, drawn from real-world traces, and evaluate their impact on a shingled write disk model. Specifically, we demonstrate the dramatically different effects that different workloads can have upon the opposing approaches of remapping and restoring blocks, and how write-heavy workloads can result in a performance advantage for a shingled-write disk.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415784","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}
{"title":"Performance Evaluation of Three Architectural Variants for Multi-sled MEMS Storage","authors":"Mohammed G. Khatib","doi":"10.1109/MASCOTS.2011.14","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.14","url":null,"abstract":"MEMS storage technology promises appealing features, such as ultrahigh density and low cost. To stay competitive, however, its performance must improve to fulfil the increasing I/O requirements in first-tier applications. Further, it must be energy-efficient. The maturity of MEMS techniques invites for a change in the basic single-medium architecture of MEMS storage. We propose three MEMS architectures of multiple media sleds. The three architectures vary in their performance and cost, and consume 35% less energy than the basic single-sled architecture of MEMS storage. We compare their timing performance in mobile, streaming, and database applications, and study their performance scalability.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"43 2-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114036817","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}
{"title":"A Fully Decentralized and Load-Adaptive Fractional Frequency Reuse Scheme","authors":"Vangelis Angelakis, Lei Chen, D. Yuan","doi":"10.1109/MASCOTS.2011.42","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.42","url":null,"abstract":"A new fully decentralized dynamic fractional frequency reuse (FFR)-based scheme for cellular OFDMA networks is introduced. FFR is a technique to mitigate inter-cell interference to improve the throughput of interference-limited users on the cell edge, to the expense of the rest of the cell's users and the aggregate throughput. The proposed scheme aims to limit the FFR-incurred loss of the center users' throughput, while still providing sufficient bandwidth for the cell edge users' communication. This is done by local information sharing and distributed optimization. The resulting ?exibility of frequency reuse can be especially beneficial in scenarios with non-uniform and time-varying load. The optimization task is accomplished by solving a knapsack problem in each cell, where the goal is to maximize the center throughput while maintaining acceptable degradation on the cell edge with respect to the original FFR allocation. The performance improvement resulting from the distributed and dynamic FFR scheme is demonstrated by snapshot simulations on an 81-cells network with asymmetric cell load. The proposed scheme achieves up to a 62% gain in cell-center throughput with a cost of no more than 18% at the edges when compared to the classic FFR scheme. The overall system throughput improvement ranges from 22% to 58%.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127593033","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}
{"title":"How Low Can You Go? Spherical Routing for Scalable Network Simulations","authors":"N. Vorst, Ting Li, Jason Liu","doi":"10.1109/MASCOTS.2011.35","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.35","url":null,"abstract":"Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our approach, called spherical routing, conducts static routing within spheres according to user-defined policies. Our routing scheme pre-calculates the forwarding table for each routing sphere, and allows spheres with identical sub-structures to share forwarding tables. Through extensive experiments we demonstrate that our approach can achieve several orders of magnitude in memory reduction for large-scale network models.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121020331","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}
{"title":"Sponsored Search Engines in Competition: Advertisers Behavior and Engines Optimal Ranking Strategies","authors":"P. Maillé, B. Tuffin","doi":"10.1109/MASCOTS.2011.19","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.19","url":null,"abstract":"Search engines are essential actors for web browsing. We analyze here the economic competition between search engines earning money from ad word auctions. We develop a two-level game where at the largest time scale search engines decide which allocation rule to implement, between revenue-based and bid-based, and at the lowest time-scale advertisers decide how to split their advertising budget between the two search engines, depending on the benefits this will bring to them. The game at the largest time scale is solved using backward induction, the search engines anticipating the reactions of advertisers. We describe the advertisers best strategies and show how to determine, depending on parameters, an equilibrium on the ranking rule strategy for search engines, this may explain Yahoo!'s move to switch from bid-based to revenue-based ranking to follow Google's strategy.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331910","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}
Marangaze Munhepe Mulhanga, S. R. Lima, P. Carvalho
{"title":"Characterising Eduroam WLANs Usage Trends: A Case Study","authors":"Marangaze Munhepe Mulhanga, S. R. Lima, P. Carvalho","doi":"10.1109/MASCOTS.2011.56","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.56","url":null,"abstract":"The recent commitment of European Universities to join a global wireless access and roaming infrastructure through the eduroam initiative has brought many advantages to the academic community. In a new environment of increasing user mobility, it is useful to study and understand the users' behaviour when accessing the wireless network infrastructure. This paper is focused on characterising the real network usage within university campuses, based on WLAN traffic traces collected at the University of Minho (Portugal). The obtained results, allowing to identify user trends and quantify the influence of access location on the number of associated users, the number and duration of sessions, the volume of generated traffic, and user mobility indicators, provide important directions for planning future improvements of university WLANs.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"585 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116308728","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}
Mentari Djatmiko, R. Boreli, A. Seneviratne, S. Ries
{"title":"Trust-Based Content Distribution for Mobile Ad Hoc Networks","authors":"Mentari Djatmiko, R. Boreli, A. Seneviratne, S. Ries","doi":"10.1109/MASCOTS.2011.48","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.48","url":null,"abstract":"We propose a novel trust and probabilistic node selection mechanism for content distribution in mobile ad hoc networks, which aims to achieve trustworthy node selection and to preserve mobile node resources. The proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that our proposal achieves its goals.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125922911","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}
{"title":"Scalable Multi-cache Simulation Using GPUs","authors":"Michael Moeng, Sangyeun Cho, R. Melhem","doi":"10.1109/MASCOTS.2011.24","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.24","url":null,"abstract":"Software simulation is the primary tool used for evaluation of processor design. Simulation offers better accuracy than analytical models and is an important evaluation step before actually fabricating a chip. Unfortunately, simulator speeds are slow -- a conventional cycle-accurate simulator will be unable to keep up with increasing core counts in modern processor design. Parallel simulation is one method for improving simulation speeds. Two major areas of parallel simulation research are multithreaded simulators and FPGAs as simulation accelerators. Multithreaded simulators can only extract coarse-grained parallelism and must sacrifice accuracy in order to scale well. FPGA-based simulators can extract fine-grained parallelism, but are expensive and difficult to program. We propose using GPUs for architectural simulation, which can take advantage of a high degree of fine-grained parallelism. In addition, they are inexpensive and easier to program compared to FPGAs. To demonstrate our ideas, we implement a trace-driven many-cache simulator using NVIDIA's CUDA toolkit. GPU-accelerated cache simulation displays remarkable scaling with number of simulated caches when compared to serial CPU-only simulation.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130171954","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}
Deepak Ajwani, Shoukat Ali, K. Katrinis, Cheng-Hong Li, Alfred Park, J. Morrison, E. Schenfeld
{"title":"A Flexible Workload Generator for Simulating Stream Computing Systems","authors":"Deepak Ajwani, Shoukat Ali, K. Katrinis, Cheng-Hong Li, Alfred Park, J. Morrison, E. Schenfeld","doi":"10.1109/MASCOTS.2011.54","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.54","url":null,"abstract":"Stream computing is an emerging computational model for performing complex operations on and across multi-source, high volume data ?ows. Given that the deployment of the model has only started, the pool of mature applications employing this model is fairly small, and therefore the availability of workloads for various types of applications is scarce. Thus, there is a need for synthetic generation of large-scale workloads for evaluation of stream computing applications at scale. This paper presents a framework for producing synthetic workloads for stream computing systems. Our framework extends known random graph generation concepts with stream computing spe-cific features, providing researchers with realistic input stream graphs and allowing them to focus on system development, optimization and analysis. Serving the goal of covering a disparity of potential applications, the presented framework exhibits high user-controlled configurability. The produced workloads could be used to drive simulations for performance evaluation and for proof-of-concept prototyping of processing, networking and operating system hardware and software.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129476252","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}