International Middleware Conference最新文献_第2页

Publish/subscribe network designs for multiplayer games 多人游戏的发布/订阅网络设计

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663337

César Cañas, Kaiwen Zhang, Bettina Kemme, J. Kienzle, H. Jacobsen

引用次数: 31

Thematic event processing 专题事件处理

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663335

S. Hasan, E. Curry

引用次数: 25

A framework for the dynamic evolution of highly-available dataflow programs 一个用于高可用数据流程序动态演化的框架

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663320

Sebastian Ertel, P. Felber

{"title":"A framework for the dynamic evolution of highly-available dataflow programs","authors":"Sebastian Ertel, P. Felber","doi":"10.1145/2663165.2663320","DOIUrl":"https://doi.org/10.1145/2663165.2663320","url":null,"abstract":"Many distributed applications deployed on the Internet must operate continuously with no noticeable interruption of service. Such 24/7 availability requirements make the maintenance of these application difficult because fixing bugs or adding new functionality necessitates the online replacement of the software version by the new one, i.e., a \"live update\". Support for \"live update\" is therefore essential to allow software evolution of critical services. While the problem of live update has been widely studied and several techniques have been proposed (e.g., using group communication and replication), we propose in this paper an original approach for the dataflow-based programming model (FBP). An interesting property of FBP is its seamless support for multi-and many-core architectures, which have become the norm in recent generation of servers and Cloud infrastructures. We introduce a framework and new algorithms for implementing coordinated non-blocking updates, which do not only support the replacement of individual software components, but also modifications of structural aspects of the applications independently of the underlying execution infrastructure. These algorithms allow us to transparently orchestrate live updates without halting the executing program. We illustrate and evaluate our approach on a web server application. We present experimental evidence that our live update algorithms are scalable and have negligible impact on availability and performance.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"61 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":"133483739","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

CAMP: a cost adaptive multi-queue eviction policy for key-value stores CAMP:键值存储的成本自适应多队列退出策略

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663317

Shahram Ghandeharizadeh, S. Irani, Jenny Lam, Jason Yap

引用次数: 19

Mitigating interference in cloud services by middleware reconfiguration 通过中间件重新配置减少云服务中的干扰

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663330

A. Maji, S. Mitra, Bowen Zhou, S. Bagchi, Akshat Verma

{"title":"Mitigating interference in cloud services by middleware reconfiguration","authors":"A. Maji, S. Mitra, Bowen Zhou, S. Bagchi, Akshat Verma","doi":"10.1145/2663165.2663330","DOIUrl":"https://doi.org/10.1145/2663165.2663330","url":null,"abstract":"Application performance has been and remains one of top five concerns since the inception of cloud computing. A primary determinant of application performance is multi-tenancy or sharing of hardware resources in clouds. While some hardware resources can be partitioned well among VMs (such as CPUs), many others cannot (such as memory bandwidth). In this paper, we focus on understanding the variability in application performance on a cloud and explore ways for an end customer to deal with it. Based on rigorous experiments using CloudSuite, a popular Web2.0 benchmark, running on EC2, we found that interference-induced performance degradation is a reality. On a private cloud testbed, we also observed that interference impacts the choice of best configuration values for applications and middleware. We posit that intelligent reconfiguration of application parameters presents a way for an end customer to reduce the impact of interference. However, tuning the application to deal with interference is challenging because of two fundamental reasons --- the configuration depends on the nature and degree of interference and there are inter-parameter dependencies. We design and implement the IC2 system (Interference-aware Cloud application Configuration) to address the challenges of detection and mitigation of performance interference in clouds. Compared to an interference-agnostic configuration, the proposed solution provides up to 29% and 40% improvement in average response time on EC2 and a private cloud testbed respectively.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"192 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":"122848492","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}

引用次数: 62

HyRec: leveraging browsers for scalable recommenders HyRec:利用浏览器提供可扩展的推荐

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663315

A. Boutet, Davide Frey, R. Guerraoui, Anne-Marie Kermarrec, Rhicheek Patra

引用次数: 38

Stay-Away, protecting sensitive applications from performance interference 保持远离，保护敏感的应用程序免受性能干扰

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663327

N. Rameshan, Leandro Navarro-Moldes, Enric Monte-Moreno, Vladimir Vlassov

{"title":"Stay-Away, protecting sensitive applications from performance interference","authors":"N. Rameshan, Leandro Navarro-Moldes, Enric Monte-Moreno, Vladimir Vlassov","doi":"10.1145/2663165.2663327","DOIUrl":"https://doi.org/10.1145/2663165.2663327","url":null,"abstract":"While co-locating virtual machines improves utilization in resource shared environments, the resulting performance interference between VMs is difficult to model or predict. QoS sensitive applications can suffer from resource co-location with other less short-term resource sensitive or batch applications. The common practice of overprovisioning resources helps to avoid performance interference and guarantee QoS but leads to low machine utilization. Recent work that relies on static approaches suffer from practical limitations due to assumptions such as a priori knowledge of application behaviour and workload.\u0000 To address these limitations, we present Stay-Away, a generic and adaptive mechanism to mitigate the detrimental effects of performance interference on sensitive applications when co-located with batch applications. Our mechanism complements the allocation decisions of resource schedulers by continuously learning the favourable and unfavourable states of co-execution and mapping them to a state-space representation. Trajectories in this representation are used to predict and prevent any transition towards interference of sensitive applications by proactively throttling the execution of batch applications. The representation also doubles as a template to prevent violations in the future execution of the repeatable sensitive application when co-located with other batch applications. Experimental results with realistic applications show that it is possible to guarantee a high level of QoS for latency sensitive applications while also improving machine utilization.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"11 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":"134408908","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}

引用次数: 43

SenSocial: a middleware for integrating online social networks and mobile sensing data streams SenSocial:集成在线社交网络和移动传感数据流的中间件

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663331

Abhinav Mehrotra, V. Pejović, Mirco Musolesi

引用次数: 48

Fast, expressive top-k matching 快速，富有表现力的top-k匹配

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663326

W. Culhane, K. R. Jayaram, P. Eugster

{"title":"Fast, expressive top-k matching","authors":"W. Culhane, K. R. Jayaram, P. Eugster","doi":"10.1145/2663165.2663326","DOIUrl":"https://doi.org/10.1145/2663165.2663326","url":null,"abstract":"Top-k matching is a fundamental problem underlying on-line advertising platforms, mobile social networks, etc. Distributed processes (e.g., advertisers) specify predicates, which we call subscriptions, for events (e.g., user actions) they wish to react to. Subscriptions define weights for elementary constraints on individual event attributes and do not require that events match all constraints. An event is multicast only to the processes with the k highest match scores for that event -- this score is the aggregation of the weights of all constraints in a subscription matching the event.\u0000 However, state-of-the-art approaches to top-k matching support only rigid models of events and subscriptions, which leads to suboptimal matches. We present a novel model of weighted top-k matching which is more expressive than the state-of-the-art, and a corresponding efficient algorithm. Our model supports attributes with intervals, weights specified by producers of events or by subscriptions, negative weights, prorating of matched constraints, and the ability to vary scores dynamically with system parameters. Our algorithm exhibits time and space complexities which are competitive with state-of-the-art algorithms regardless of our added expressiveness -- O(M log N + S log k) and O(M N + k) respectively, with N the number of constraints, M the number of event attributes, and S the number of matching constraints.\u0000 Through empirical evaluation with both statistically generated and real-world data we demonstrate that our algorithm is (a) equally or more efficient and scalable than the state-of-the art without exploiting our added expressiveness, and it (b) significantly outperforms existing approaches upgraded -- if possible at all -- to match our expressiveness.","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"42 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":"132569906","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

Mutable checkpoint-restart: automating live update for generic server programs 可变检查点重新启动:自动更新通用服务器程序的实时更新

International Middleware Conference Pub Date : 2014-12-08 DOI: 10.1145/2663165.2663328

Cristiano Giuffrida, Călin Iorgulescu, A. Tanenbaum

{"title":"Mutable checkpoint-restart: automating live update for generic server programs","authors":"Cristiano Giuffrida, Călin Iorgulescu, A. Tanenbaum","doi":"10.1145/2663165.2663328","DOIUrl":"https://doi.org/10.1145/2663165.2663328","url":null,"abstract":"The pressing demand to deploy software updates without stopping running programs has fostered much research on live update systems in the past decades. Prior solutions, however, either make strong assumptions on the nature of the update or require extensive and error-prone manual effort, factors which discourage live update adoption.\u0000 This paper presents Mutable Checkpoint-Restart (MCR), a new live update solution for generic (multiprocess and multithreaded) server programs written in C. Compared to prior solutions, MCR can support arbitrary software updates and automate most of the common live update operations. The key idea is to allow the new version to restart as similarly to a fresh program initialization as possible, relying on existing code paths to automatically restore the old program threads and reinitialize a relevant portion of the program data structures. To transfer the remaining data structures, MCR relies on a combination of precise and conservative garbage collection techniques to trace all the global pointers and apply the required state transformations on the fly. Experimental results on popular server programs (Apache httpd, nginx, OpenSSH and vsftpd) confirm that our techniques can effectively automate problems previously deemed difficult at the cost of negligible run-time performance overhead (2% on average) and moderate memory overhead (3.9x on average).","PeriodicalId":262822,"journal":{"name":"International Middleware Conference","volume":"26 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":"132594386","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