International Middleware Conference最新文献

筛选
英文 中文
Affinity-aware checkpoint restart 关联感知检查点重启
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663325
Ajay Saini, Arash Rezaei, F. Mueller, Paul H. Hargrove, Eric Roman
{"title":"Affinity-aware checkpoint restart","authors":"Ajay Saini, Arash Rezaei, F. Mueller, Paul H. Hargrove, Eric Roman","doi":"10.1145/2663165.2663325","DOIUrl":"https://doi.org/10.1145/2663165.2663325","url":null,"abstract":"Current checkpointing techniques employed to overcome faults for HPC applications result in inferior application performance after restart from a checkpoint for a number of applications. This is due to a lack of page and core affinity awareness of the checkpoint/restart (C/R) mechanism, i.e., application tasks originally pinned to cores may be restarted on different cores, and in case of non-uniform memory architectures (NUMA), quite common today, memory pages associated with tasks on a NUMA node may be associated with a different NUMA node after restart. This work contributes a novel design technique for C/R mechanisms to preserve task-to-core maps and NUMA node specific page affinities across restarts. Experimental results with BLCR, a C/R mechanism, enhanced with affinity awareness demonstrate significant performance benefits of 37%-73% for the NAS Parallel Benchmark codes and 6-12% for NAMD with negligible overheads instead of up to nearly four times longer an execution times without affinity-aware restarts on 16 cores.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131299706","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}
引用次数: 6
Strong consistency in cache augmented SQL systems 增强缓存的SQL系统中的强一致性
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663318
Shahram Ghandeharizadeh, Jason Yap, Hieu Nguyen
{"title":"Strong consistency in cache augmented SQL systems","authors":"Shahram Ghandeharizadeh, Jason Yap, Hieu Nguyen","doi":"10.1145/2663165.2663318","DOIUrl":"https://doi.org/10.1145/2663165.2663318","url":null,"abstract":"Cache augmented SQL, CASQL, systems enhance the performance of simple operations that read and write a small amount of data from big data. They do so by looking up the results of computations that query the database in a key-value store (KVS) instead of processing them using a relational database management system (RDBMS). These systems incur undesirable race conditions that cause the KVS to produce stale data. This paper presents the IQ framework that provides strong consistency with no modification to the RDBMS. It consists of two non-blocking leases, Inhibit (I) and Quarantine (Q). Ratings obtained from a social networking benchmark named BG show the proposed framework has minimal impact on system performance while providing strong consistency guarantees.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984148","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}
引用次数: 23
Improving MapReduce performance in heterogeneous environments with adaptive task tuning 通过自适应任务调优提高异构环境下的MapReduce性能
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2666089
Dazhao Cheng, J. Rao, Yanfei Guo, Xiaobo Zhou
{"title":"Improving MapReduce performance in heterogeneous environments with adaptive task tuning","authors":"Dazhao Cheng, J. Rao, Yanfei Guo, Xiaobo Zhou","doi":"10.1145/2663165.2666089","DOIUrl":"https://doi.org/10.1145/2663165.2666089","url":null,"abstract":"The deployment of MapReduce in datacenters and clouds present several challenges in achieving good job performance. Compared to in-house dedicated clusters, datacenters and clouds often exhibit significant hardware and performance heterogeneity due to continuous server replacement and multi-tenant interferences. As most Mapreduce implementations assume homogeneous clusters, heterogeneity can cause significant load imbalance in task execution, leading to poor performance and low cluster utilizations. Despite existing optimizations on task scheduling and load balancing, MapReduce still performs poorly on heterogeneous clusters.\u0000 In this paper, we find that the homogeneous configuration of tasks on heterogeneous nodes can be an important source of load imbalance and thus cause poor performance. Tasks should be customized with different settings to match the capabilities of heterogeneous nodes. To this end, we propose an adaptive task tuning approach, Ant, that automatically finds the optimal settings for individual tasks running on different nodes. Ant works best for large jobs with multiple rounds of map task execution. It first configures tasks with randomly selected configurations and gradually improves tasks settings by reproducing the settings from best performing tasks and discarding poor performing configurations. To accelerate task tuning and avoid trapping in local optimum, Ant uses genetic functions during task configuration. Experimental results on a heterogeneous cluster and a virtual cluster with varying hardware capabilities show that Ant improves the average job completion time by 23%, 11%, and 16% compared to stock Hadoop, customized Hadoop with industry recommendations, and a profiling-based configuration approach, respectively.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126438237","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}
引用次数: 72
Virtual machine consolidation in the wild 野外的虚拟机整合
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663316
Akshat Verma, Juhi Bagrodia, Vimmi Jaiswal
{"title":"Virtual machine consolidation in the wild","authors":"Akshat Verma, Juhi Bagrodia, Vimmi Jaiswal","doi":"10.1145/2663165.2663316","DOIUrl":"https://doi.org/10.1145/2663165.2663316","url":null,"abstract":"Dynamic Virtual Machine (VM) consolidation dynamically adapts VM resource allocation to resource demands promising significant cost benefits for highly variable enterprise workloads. In this work, we analyze large enterprise workloads with the goal of understanding how effective are the VM consolidation variants in real world. We observe that burstiness in memory demand is much lower than the burstiness in CPU demand. Further, memory is the more constrained resource in virtualized servers, significantly reducing the potential gains due to dynamic consolidation. We study consolidation planning in four very large data centers and observe that the savings in facilities cost due to dynamic consolidation over static consolidation is not as large as estimated by past studies. Further, the savings over intelligent semi-static consolidation are surprisingly modest in most cases, putting a question mark over the applicability of dynamic consolidation in real world.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124963897","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}
引用次数: 21
Consensus inside 内部的共识
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663321
Tudor David, R. Guerraoui, M. Yabandeh
{"title":"Consensus inside","authors":"Tudor David, R. Guerraoui, M. Yabandeh","doi":"10.1145/2663165.2663321","DOIUrl":"https://doi.org/10.1145/2663165.2663321","url":null,"abstract":"Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency among replicas through a message-passing based agreement protocol.\u0000 In this paper, we present the first in-depth study of message-passing agreement on many-cores. In particular, we focus on the possibility of such a protocol being non-blocking. We highlight a number of optimizations that are specific to the many-core environment and present 1Paxos, a new non-blocking agreement protocol that takes up the challenges of this environment.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133849197","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}
引用次数: 11
PLEROMA: a SDN-based high performance publish/subscribe middleware PLEROMA:基于sdn的高性能发布/订阅中间件
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663338
M. Tariq, B. Koldehofe, Sukanya Bhowmik, K. Rothermel
{"title":"PLEROMA: a SDN-based high performance publish/subscribe middleware","authors":"M. Tariq, B. Koldehofe, Sukanya Bhowmik, K. Rothermel","doi":"10.1145/2663165.2663338","DOIUrl":"https://doi.org/10.1145/2663165.2663338","url":null,"abstract":"With the increasing popularity of Software-defined networks (SDN), TCAM memory of switches can be directly accessed by a publish/subscribe middleware to perform filtering operations at low latency. This way two important requirements for a publish/subscribe middleware can be fulfilled: namely bandwidth efficiency and line-rate performance in forwarding messages between producers and consumers. Nevertheless, it is challenging to sustain line-rate performance in the presence of dynamic changes in the interest of producers and consumers. In this paper, we propose and evaluate the PLEROMA middleware to realize publish/subscribe at line-rate and bandwidth efficiently in SDN. PLEROMA offers methods to efficiently reconfigure a deployed topology in the presence of dynamic subscriptions and advertisements. Furthermore, PLEROMA ensures interoperability and independent reconfiguration of multiple controlled SDN networks.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032791","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}
引用次数: 54
G-DUR: a middleware for assembling, analyzing, and improving transactional protocols G-DUR:用于组装、分析和改进事务协议的中间件
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663336
Masoud Saeida Ardekani, P. Sutra, M. Shapiro
{"title":"G-DUR: a middleware for assembling, analyzing, and improving transactional protocols","authors":"Masoud Saeida Ardekani, P. Sutra, M. Shapiro","doi":"10.1145/2663165.2663336","DOIUrl":"https://doi.org/10.1145/2663165.2663336","url":null,"abstract":"A large family of distributed transactional protocols have a common structure, called Deferred Update Replication (DUR). DUR provides dependability by replicating data, and performance by not re-executing transactions but only applying their updates. Protocols of the DUR family differ only in behaviors of few generic functions. Based on this insight, we offer a generic DUR middleware, called G-DUR, along with a library of finely-optimized plug-in implementations of the required behaviors. This paper presents the middleware, the plugins, and an extensive experimental evaluation in a geo-replicated environment. Our empirical study shows that:(i) G-DUR allows developers to implement various transactional protocols under 600 lines of code; (ii) It provides a fair, apples-to-apples comparison between transactional protocols; (iii) By replacing plugs-ins, developers can use G-DUR to understand bottlenecks in their protocols; (iv) This in turn enables the improvement of existing protocols; and (v) Given a protocol, G-DUR helps evaluate the cost of ensuring various degrees of dependability.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130699463","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}
引用次数: 17
Trustworthy geographically fenced hybrid clouds 值得信赖的地理隔离混合云
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2666091
K. R. Jayaram, D. Safford, Upendra Sharma, V. Naik, D. Pendarakis, S. Tao
{"title":"Trustworthy geographically fenced hybrid clouds","authors":"K. R. Jayaram, D. Safford, Upendra Sharma, V. Naik, D. Pendarakis, S. Tao","doi":"10.1145/2663165.2666091","DOIUrl":"https://doi.org/10.1145/2663165.2666091","url":null,"abstract":"Adoption of hybrid clouds by enterprises has been hampered by the inability of current hybrid cloud infrastructures to provide scalable and efficient mechanisms (1) to ensure the trustworthiness and integrity of the software stack executing a hybrid application workload, or (2) to enforce governmental privacy, data jurisdiction and audit regulations by ensuring that remote data and computation do not cross specified geographic boundaries.\u0000 This paper presents our vision of trustworthy geographically fenced hybrid clouds (TGHC), a generic, scalable and extensible middleware system to automatically bridge the gap between applications with their integrity and geo-fencing policies, and raw hardware infrastructure. It describes TGHCs modularly, by (a) outlining the challenges in certifying the trustworthiness of cloud computing infrastructures and in geo-fencing computation, including scalability limitations of existing solutions, (b) presenting scalable mechanisms to transform bare metal servers into trusted IaaS computing pools through integrity measurement, management and monitoring that leverage open, off-the-shelf hardware technologies like Intel TPM, (c) introducing workload specification languages to specify integrity and geo-fencing policies on hybrid workloads, and (d) extending IaaS systems to ensure that workload bursting from private data centers to public clouds uses trusted computing pools and respects geographic boundaries during initial placement of virtual machines (VMs) and further migration.\u0000 We also present early results from our implementation illustrating the feasibility of our proposed architecture, and outline future research challenges in engineering and effectively using TGHCs.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133718044","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}
引用次数: 26
StackSync: bringing elasticity to dropbox-like file synchronization StackSync:给类似于下拉框的文件同步带来弹性
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663332
P. López, Marc Sánchez Artigas, Sergi Toda, C. Cotes, John Lenton
{"title":"StackSync: bringing elasticity to dropbox-like file synchronization","authors":"P. López, Marc Sánchez Artigas, Sergi Toda, C. Cotes, John Lenton","doi":"10.1145/2663165.2663332","DOIUrl":"https://doi.org/10.1145/2663165.2663332","url":null,"abstract":"The design of elastic file synchronization services like Dropbox is an open and complex issue yet not unveiled by the major commercial providers, as it includes challenges like fine-grained programmable elasticity and efficient change notification to millions of devices. In this paper, we propose a novel architecture for file synchronization which aims to solve the above two major challenges. At the heart of our proposal lies ObjectMQ, a lightweight framework for providing programmatic elasticity to distributed objects using messaging. The efficient use of indirect communication: i) enables programmatic elasticity based on queue message processing, ii) simplifies change notifications offering simple unicast and multicast primitives; and iii) provides transparent load balancing based on queues.\u0000 Our reference implementation is StackSync, an open source elastic file synchronization Cloud service developed in the context of the FP7 project CloudSpaces. StackSync supports both predictive and reactive provisioning policies on top of ObjectMQ that adapt to real traces from the Ubuntu One service. The feasibility of our approach has been extensively validated with an open benchmark, including commercial synchronization services like Dropbox or OneDrive.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133033253","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}
引用次数: 23
CrowdWiFi: efficient crowdsensing of roadside WiFi networks CrowdWiFi:高效的路边WiFi网络众测
International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663329
Di Wu, Qiang Liu, Yuan Zhang, J. Mccann, A. Regan, N. Venkatasubramanian
{"title":"CrowdWiFi: efficient crowdsensing of roadside WiFi networks","authors":"Di Wu, Qiang Liu, Yuan Zhang, J. Mccann, A. Regan, N. Venkatasubramanian","doi":"10.1145/2663165.2663329","DOIUrl":"https://doi.org/10.1145/2663165.2663329","url":null,"abstract":"In this paper, we present CrowdWiFi, a novel vehicular middleware to identify and localize roadside WiFi APs that are located outside or inside buildings. Our work is motivated by the recent surge in availability of open WiFi access points (APs) that are enabling opportunistic data services to moving vehicles. Two key elements of CrowdWiFi that provide vehicles with opportunistic WiFi access include (a) an online compressive sensing component and (b) an offline crowdsourcing module. Online compressive sensing (CS) techniques are primarily used to for the coarse-grained estimation of nearby APs along the driving route; here, the received signal strength (RSS) values are recorded at runtime, and the number and locations of APs are recovered immediately based on limited RSS readings. The offline crowdsourcing mechanism assigns the online CS tasks to crowd-vehicles and aggregates answers using a bipartite graphical model. This offline crowdsourcing executes at a crowd-server that iteratively infers the reliability of each crowd-vehicle from the aggregated sensing results and refines the estimation of APs using weighted centroid processing. Extensive simulation results and real testbed experiments confirm that CrowdWiFi can successfully reduce the number of measurements needed for AP recovery, while maintaining satisfactory counting and localization accuracy. In addition, the impact of CrowdWiFi middleware on WiFi handoff and data transmission applications is examined.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392824","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}
引用次数: 24
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学术官方微信
小红书