{"title":"Improving Performance of Cloud Key-Value Storage Using Flushing Optimization","authors":"Yongseok Son, Hara Kang, Hyuck Han, H. Yeom","doi":"10.1109/FAS-W.2016.22","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.22","url":null,"abstract":"Key-value store is an essential component with an increasing demand in many scale-out environments, including social networks, online retail, and cloud services. Hence, modern key-value storage engines provide many features, including transaction, versioning, replication, etc. In storage engines, transaction processing provides atomicity and durability by using write-ahead logging (WAL), which flushes log data before the data page is written to persistent storage in synchronous commit. However, according to our observation, WAL is a performance bottleneck on key-value storage engine since the flushing of log data to persistent storage incurs significant overhead of lock contention and fsync() calls even with various optimizations in the existing scheme. In this paper, we propose an approach for improving performance of key-value storage by optimizing the existing flushing scheme combined with group commit and consolidate array. Our scheme aggregates multiple flushing of log data into a large request on the fly and completes the request early. This scheme is an efficient group commit that reduces the number of frequent lock acquisition and fsync() calls in the synchronous commit while supporting same transaction level that the existing scheme provides. We implemented our scheme on WiredTiger storage engine and evaluated that our scheme improves the performance by 1.3-5.5x on the key-value workload compared to the existing scheme.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127425873","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}
D. Sanderson, J. Chaplin, Lavindra de Silva, Paul Holmes, S. Ratchev
{"title":"Smart Manufacturing and Reconfigurable Technologies: Towards an Integrated Environment for Evolvable Assembly Systems","authors":"D. Sanderson, J. Chaplin, Lavindra de Silva, Paul Holmes, S. Ratchev","doi":"10.1109/FAS-W.2016.61","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.61","url":null,"abstract":"In this paper we present the Smart Manufacturing And Reconfigurable Technologies (SMART) demonstrator, an example of an integrated environment for the Evolvable Assembly Systems project, which demonstrates the application of adaptive agent control to transform a static legacy manufacturing system into a reconfigurable manufacturing system capable of addressing the 'batch-size-of-one' problem.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115567094","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}
Mirko Viroli, A. Bucchiarone, Danilo Pianini, J. Beal
{"title":"Combining Self-Organisation and Autonomic Computing in CASs with Aggregate-MAPE","authors":"Mirko Viroli, A. Bucchiarone, Danilo Pianini, J. Beal","doi":"10.1109/FAS-W.2016.49","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.49","url":null,"abstract":"Aggregate computing is a recently proposed framework to build CASs (collective adaptive systems) by focussing on direct programming of ensembles so as to abstract away from individual devices and their single interaction acts: this approach is shown to streamline the identification of highly reusable block components, and support reasoning about their resiliency properties. Following this paradigm, in this paper we present a framework for bridging the gap between the MAPE (Monitor-Analyse-Plan-Execute) loop of autonomic computing managers, and fully-distributed self-organising CASs. This is achieved by seeing the collection of M components of each agent as an aggregate, amenable to a direct specification as overall CAS Monitoring behaviour, and similarly for A, P and E. As a result, a self-organising CAS can be programmed by clearly separating the M, A, P, and E parts of it, though each is expressed in terms of a collective behaviour. The proposed approach is exemplified with an application scenario of crowd dispersal in a large-scale smart-mobility application.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"5 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131437059","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":"KOHA: Building a Kafka-Based Distributed Queue System on the Fly in a Hadoop Cluster","authors":"Cao Ngoc Nguyen, Jik-Soo Kim, Soonwook Hwang","doi":"10.1109/FAS-W.2016.23","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.23","url":null,"abstract":"Message queues take a crucial role in a distributed and scalable system by interconnecting loosely-coupled and autonomic computational units. Among the state of art distributed message queue systems, Apache Kafka has been able to achieve high throughput, low latency, and good load-balancing. Recently, we have worked on developing a new data processing framework that can efficiently handle a very large number of tasks on top of a Hadoop cluster by effectively leveraging Kafka as a job queue, which motivated us to explore more opportunities of utilizing Kafka in the Hadoop platform. The Apache Hadoop has already become the de facto big data processing infrastructure and with the help of YARN, it is now evolving into multi-use data platform that can harness various types of data processing workflows. Therefore, effectively utilizing Kafka for various purposes including message distribution, task processing, metadata management in a Hadoop cluster can potentially contribute to the expansion of current Hadoop ecosystem. In this paper, we design and implement a framework called KOHA (Kafka On HAdoop) that provides users with a simple, convenient and powerful way to develop a large-scale distributed Kafka-based application running on top of a Hadoop cluster. The framework automatically builds and starts Kafka brokers on the fly and allocates resources to launch producers and consumers. Users can use the framework to adopt Apache Kafka without any understanding of YARN programming model and efforts to deploy a Kafka cluster. In addition, we also present a use case of the framework to evaluate Kafka's performance with various test cases and working scenarios. The experimental results allow Kafka's potential users to perceive the influences of different settings on the queuing performance.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196492","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":"Formal Models for Analysing Dynamic Adaptation Behaviour in Real-Time Systems","authors":"V. Klös, Thomas Göthel, S. Glesner","doi":"10.1109/FAS-W.2016.34","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.34","url":null,"abstract":"Self-adaptive systems are able to autonomously adapt themselves to react to dynamic changes in their environment. They, thereby, provide suitable mechanisms to deal with uncertain environment settings, as is required in modern reactive systems, such as cyber-physical systems. However, design and analysis of adaptation logic is complex and error-prone. Thus, early design-time analysis of the adaptation logic is necessary, especially in safety-critical applications. In this paper, we cope with the problem of comprehensively analysing time-dependent self-adaptive systems. We consider rule-based adaptation as a generic mechanism to describe adaptation logic. We automatically extract formal timed models of the functional components from a SystemC system-level implementation. This ensures that analysis results on the models correspond to the actual running system. To analyse the adaptation behaviours, we embed the extracted functional models in a formal, generic, and abstract MAPE-K loop modelled with timed automata. We classify important adaptation properties and show how they can be generally verified on the resulting models together with an abstract model of the environment, which we assume to be given. To evaluate our approach, we analyse the widely used web-based information system Znn.com.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116378003","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}
Henner Heck, Stefan Rudolph, Christian Gruhl, Arno Wacker, J. Hähner, B. Sick, Sven Tomforde
{"title":"Towards Autonomous Self-Tests at Runtime","authors":"Henner Heck, Stefan Rudolph, Christian Gruhl, Arno Wacker, J. Hähner, B. Sick, Sven Tomforde","doi":"10.1109/FAS-W.2016.32","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.32","url":null,"abstract":"Self-adaptive and self-organising (SASO) systems are one promising approach to counter the raising interconnectedness and complexity in technical systems [1]. In particular, decisions about parametrisation, behaviour, and even structure are moved into the responsibility of the systems themselves: from design-time to runtime. This means that hardly all conditions a system may face can be foreseen during development. Consequently, a full test coverage at design-time is seldom possible as well. We argue that such a transfer of decisions to runtime also impacts the approach to test the resulting systems. If conditions, interaction partners, and resulting behaviour occur only at runtime, testing these aspects has to occur at runtime as well. Besides standard functionality tests (e.g. watchdogs), the distributed and component-oriented nature of self-organising systems can be re-used for highly autonomous and adaptive test mechanisms by establishing and dissolving relationships of test-tester pairs at runtime. The basic idea is to augment more static self-tests (i.e. integrated in hardware, or internal software routines) with dynamic tests - ranging from availability tests at the lowest level to comprising tests at the highest level (i.e. verifying that a component has not been taken over by an attacker). Since we want to avoid single points of failure and maintain scalability in large-scale self-organised systems, we propose a fully self-organised approach, the autonomous self-tests. In this article, we sketch a concept to runtime testing in terms of self-tests, briefly summarise the state-of-the-art, and illustrate the idea by means of examples from the smart camera and intrusion detection domains.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127209069","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":"Robotics for Self-Organised Construction","authors":"Victor Gerling, S. Mammen","doi":"10.1109/FAS-W.2016.45","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.45","url":null,"abstract":"Recent advances in material sciences and robotics promise a potential paradigm shift in the design and construction of human architecture. Inspired by nest constructions of social insects, architectural designs and constructions could arise from locally coordinated interactions of large numbers of robots. In order to achieve this goal, the algorithmic foundations of such processes need to be researched, these investigations' results need to be translated to productive systems, possibly first in the context of multi-physics simulations, and finally to actual, deployment-ready hardware systems. Important research steps are taken at all these levels of abstraction. In this paper, we present a brief survey of works that promote the deployment of self-organising robotic systems for the purpose of building construction. It focusses on the aspects of building materials (rigid and amorphous), deployed hardware (grounded and airborne) and the organisational realisation of the robots' coordination by means of stigmergic communication.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"2 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836773","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":"Enabling Low Latency Services on LTE Networks","authors":"Cesar A. García-Pérez, P. Merino","doi":"10.1109/FAS-W.2016.59","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.59","url":null,"abstract":"The upcoming 5G technologies promise to enable ultra low latency services such as remote robotics, augmented reality or vehicle to vehicle communications. Fog and MEC computing can enable low latency services for many different scenarios by moving the cloud and some network functions closer to the user. In the case of mobile networks this improvement is traditionally introduced in the reference point that defines the limit of the operator domain. In this paper we explore the introduction of an intermediate component in the LTE standard architecture, describing its functionality and providing experimental results on its use. This component, called Fog Gateway, can process the data plane for specific services to prevent all the traffic reaching the core network. The gateway analyzes the GTP traffic inner destination IP in order to determine whether to route the packet to the fog network or forward it to the destination SGW. The solution is compliant with standard LTE equipment all along the path (UE, eNodeB, EPC), so it can be implemented in current networks, and the preliminary figures, obtained combining emulated and COTS equipment, show an improvement of up to the 78% in terms of latency reduction.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116633518","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":"Unsupervised In-Silico Modeling of Complex Biological Systems","authors":"John Kalantari","doi":"10.1109/FAS-W.2016.69","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.69","url":null,"abstract":"The advent of high-throughput technologies and the resultant generation of data has increased the demand for data-driven analytics. However, a comprehensive and computationally efficient method for analyzing, understanding and managing the emergent behavior of complex biological systems using time-series data remains elusive. In this paper, we introduce a new computational framework and modeling formalism designed for unsupervised learning and model construction in high-throughput biological data applications. This framework uses an underlying Bayesian nonparametric model which effectively infers long-range temporal dependencies from heterogeneous data streams to produce grammatical rules used for real-time in-silico modeling, behavior recognition and prediction. We present initial results of unsupervised learning tasks using unlabeled live-cell imaging data from experiments performed on the Large Scale Digital Cell Analysis System (LSDCAS), namely cellular event classification and large-scale spatio-temporal behavior recognition.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123464833","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":"Voices of Justice: Finding Consensus in the Multitude of Claims","authors":"David Burth Kurka, J. Pitt","doi":"10.1109/FAS-W.2016.47","DOIUrl":"https://doi.org/10.1109/FAS-W.2016.47","url":null,"abstract":"A well-known aphorism in English law can be summarised as: \"not only must justice be done, it must also be seen to be done\". In this paper, we consider the implications of this statement for a policy of distributed distributive justice intended to deliver 'fair' resource allocation in open multi-agent systems, in particular, where one designated agent is responsible for computing and declaring the outcome of the resource allocation process. The proposed solution uses an information dissemination framework that is based on trust, social influence and opinion formation, allowing multiple local processes to aggregate and converge on an overall feedback measure for the effectiveness of the system in delivering fair outcomes. We consider a scenario where agents are subject to different resource allocation policies, and show how the system is able to deal with diverse and divergent accounts and reach consensus on its general fairness. Experiments show that our strategy is able to distinguish between fair and unfair allocations, is robust to malicious agents by preventing propagation of false impressions, and can operate successfully in different topologies.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"10 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124725309","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}