2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W)最新文献_第4页

Efficient Multi-GPU Memory Management for Deep Learning Acceleration

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00023

Youngrang Kim, J. Lee, Jik-Soo Kim, Hyunseung Jei, Hongchan Roh

引用次数: 10

Engineering Self-Adaptive Software Systems – An Organized Tour 工程自适应软件系统-组织之旅

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00012

Danny Weyns

引用次数: 21

Toward an Adaptive Fair GPU Sharing Scheme in Container-Based Clusters 基于容器集群的自适应公平GPU共享方案研究

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00029

Jisun Oh, Seoyoung Kim, Yoonhee Kim

{"title":"Toward an Adaptive Fair GPU Sharing Scheme in Container-Based Clusters","authors":"Jisun Oh, Seoyoung Kim, Yoonhee Kim","doi":"10.1109/FAS-W.2018.00029","DOIUrl":"https://doi.org/10.1109/FAS-W.2018.00029","url":null,"abstract":"Virtualization is an innovative technology that accelerates software development by providing portability and maintainability of applications. However, it often leads underperformance especially caused by overheads from managing virtual machines. To address the limitation of virtual machines, container technology has emerged to deploy and operate distributed applications without launching entire virtual machines. Unfortunately, resources contention issues in container-based clusters, bringing substantial performance loss are still challenging. This paper proposes an adaptive fair-share method to share effectively in container-based virtualization environment. In particular, we focus on enabling GPU sharing between multiple concurrent containers without lack of GPU memory. We demonstrate that our approach contributes to overall performance improvement as well as higher resource utilization compared to default and static fair-share methods with homogeneous and heterogeneous workloads. Compared to two other conditions, their results show that the proposed method reduces by 16.37%, 15.61% in average execution time and boosts approximately by 52.46%, 10.3% in average GPU memory utilization, respectively.","PeriodicalId":164903,"journal":{"name":"2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083346","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

Aspects of Measuring and Evaluating the Integration Status of a (Sub-)System at Runtime 运行时测量和评价(子系统)集成状态的几个方面

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00047

Christian Gruhl, Sven Tomforde, B. Sick

引用次数: 5

Design and Implementation of Software-Based Dynamically Connected Transport 基于软件的动态连接传输的设计与实现

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00026

Jiwoong Park, H. Yeom

引用次数: 1

Title Page i 第1页

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/fas-w.2018.00001

引用次数: 0

A Tool for Online Experiment-Driven Adaptation 在线实验驱动适应工具

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00032

I. Gerostathopoulos, Ali Naci Uysal, C. Prehofer, T. Bures

引用次数: 5

Reactive and Adaptive Security Monitoring in Cloud Computing 云计算中的响应式和自适应安全监控

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00014

Clément Elbaz, Louis Rilling, C. Morin

{"title":"Reactive and Adaptive Security Monitoring in Cloud Computing","authors":"Clément Elbaz, Louis Rilling, C. Morin","doi":"10.1109/FAS-W.2018.00014","DOIUrl":"https://doi.org/10.1109/FAS-W.2018.00014","url":null,"abstract":"Cloud computing enabled service-level agreements (SLAs) to gain widespread use among information systems stakeholders. It is now normal for performance and availability of such systems to be carefully measured and evaluated. Contracts that include financial penalties in case of breach are now common. However security is lagging behind this trend; it is as important to stakeholders as performance and availability, but is generally not included in the scope of service-level agreements between stakeholders, and handled instead on a best-effort basis, without any transparency nor SLA with their clients. One reason for this is the difficulty of objectively measuring security. Indeed, the actual security level of a system is dependent on a wide range of factors, some intrinsic to the system - such as a design or implementation mistake resulting in a vulnerability - and some extrinsic to it. For instance, an external event such as the publication of a vulnerability in an open-source software dependency or a change of political context in a country can widely impact the risks faced by an information system even if no actual change were made to the system. These factors are even more numerous in multi-tenant cloud infrastructures because of the sheer number of actors involved - and their sometimes conflicting incentives - and opportunities for both attack and defense at scale. Security monitoring aims to detect and react to attacks in real time; Reactive security monitoring intends to take external events into account while doing so. Improving the accuracy of a system's overall security assessment can help transitioning security to a SLA paradigm and enable better transparency for all stakeholders.","PeriodicalId":164903,"journal":{"name":"2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114294754","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}

引用次数: 3

Design of Skiplist Based Key-Value Store on Non-Volatile Memory 非易失性存储器中基于Skiplist键值存储的设计

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/FAS-W.2018.00024

Qichen Chen, H. Yeom

{"title":"Design of Skiplist Based Key-Value Store on Non-Volatile Memory","authors":"Qichen Chen, H. Yeom","doi":"10.1109/FAS-W.2018.00024","DOIUrl":"https://doi.org/10.1109/FAS-W.2018.00024","url":null,"abstract":"Non-volatile Memory is promising to persistent data storage, which has outstanding advantages against traditional storage devices such as HDD and SSD. One of its hugest advantages is its DRAM-like read latency and micro second level write latency, which is several hundred times faster than the original block device. However, one of the issues on using non-volatile memory as storage device is designing a suitable indexing system for data stores there, in which the characteristics of non-volatile memory can be able to make full use of. The state of the art indexing systems of non-volatile key-value stores are usually based on B+-tree or its variant, which are originally designed for mechanic hard disk and volatile memory. The semantics of B+-tree requires inside data being sorted and frequent split and merge for keeping its balance. However, both of sorting and splitting will cause extra write to non-volatile memory, which will downgrade the performance. As a result, B+-tree and its variant may not be naturally suitable for non-volatile memory. In this paper, we proposed a skiplist based indexing system for non-volatile memory key-value store(NV-Skiplist), which can take fully use of the features of both the non-volatile memory and DRAM. NV-Skiplist constructs its bottom layer in the non-volatile memory for data persistence and supporting range scan, it also builds its upper layers in the DRAM to retain fast index searching and prevent large consistent overhead. We also introduced a multi-ranged variant to increase the search performance. We evaluate the performance of NV-Skiplist on a non-volatile memory emulator with a server that has Intel Xeon E5-2620 v2 processor. The experimental results show that our design outperforms the original tree-based non-volatile key-value store on both insertion and search performance by both 27% and 12% in each case.","PeriodicalId":164903,"journal":{"name":"2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128136798","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

AMGCC 2018 Foreword

2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems (FAS*W) Pub Date : 2018-09-01 DOI: 10.1109/fas-w.2018.00007

H. Yeom, Kento Aida, Jaeyoung Choi, Young-ri Choi, E. Deelman, Sandro Fiore, R. G. Diaz, Hyeonsang Eom, E. Heien, J. Jensen, Jik-Soo Kim, Yoonhee Kim, Youngjae Kim, Jaewook Lee, K. Lee, J. Lee, Myungho Lee, Young-Choon Lee, R. Montella, Taiga Nakamura, Beom-Il Nam, S. Pallickara, Seung-Jong Park, Sungyong Park, R. Quick, Ilkyeun Ra, D. Sarramia, Yoshio Tanaka, Taro Tezuka, S. Timm, Ananta Tiwari, J. L. Vázquez-Poletti, J. Wozniak

引用次数: 0