In this paper, we propose a method to implement any concurrent data structure. Our method produces implementations that work particularly well in non-uniform memory access (NUMA) machines. Due to recent architecture trends, highly concurrent servers today are NUMA machines, where the cost of accessing a memory location is not the same across every core. To fully leverage these machines, programmers need efficient concurrent data structures that are aware of the NUMA performance artifacts.We propose Node Replication (NR), a black-box approach to obtaining such data structures. NR takes an arbitrary sequential data structure and automatically transforms it into a NUMA-aware concurrent data structure satisfying linearizability. Using NR requires no expertise in concurrent data structure design, and the result is free of concurrency bugs. NR draws ideas from two disciplines: shared-memory algorithms and distributed systems. Briefly, NR implements a NUMA-aware shared log, and then uses the log to replicate data structures consistently across NUMA nodes. The cost of NR is additional memory for its log and replicas.
{"title":"How to implement any concurrent data structure for modern servers","authors":"I. Calciu, S. Sen, M. Balakrishnan, M. Aguilera","doi":"10.1145/3139645.3139650","DOIUrl":"https://doi.org/10.1145/3139645.3139650","url":null,"abstract":"In this paper, we propose a method to implement any concurrent data structure. Our method produces implementations that work particularly well in non-uniform memory access (NUMA) machines. Due to recent architecture trends, highly concurrent servers today are NUMA machines, where the cost of accessing a memory location is not the same across every core. To fully leverage these machines, programmers need efficient concurrent data structures that are aware of the NUMA performance artifacts.We propose Node Replication (NR), a black-box approach to obtaining such data structures. NR takes an arbitrary sequential data structure and automatically transforms it into a NUMA-aware concurrent data structure satisfying linearizability. Using NR requires no expertise in concurrent data structure design, and the result is free of concurrency bugs. NR draws ideas from two disciplines: shared-memory algorithms and distributed systems. Briefly, NR implements a NUMA-aware shared log, and then uses the log to replicate data structures consistently across NUMA nodes. The cost of NR is additional memory for its log and replicas.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79351811","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}
The Brazilian Symposium on Computing System Engineering (SBESC) is an initiative of the research community originally associated with three events: the Brazilian Workshop on Real-Time Systems, created in 1998; the Brazilian Workshop on Operating Systems, created in 2004; and the Brazilian Workshop on Embedded Systems, created in 2010. The identification of a strong synergy among these research areas added to the fact that designing computing systems is an increasingly multidisciplinary task and motivated the workshops to move from their native conferences to form an independent symposium. From the beginning, the symposium has been holding the Brazilian Embedded Systems School. In 2013, the symposium incorporated another related research community, which is focused on topics related to Critical Embedded Systems such as system safety and dependability. In the same year, it also started to host the Education Forum in Computing Engineering and the Embedded Systems Competition organized by Intel.
{"title":"6th Brazilian Symposium on Computing System Engineering","authors":"A. Brito, Rivalino Matias, L. Becker","doi":"10.1145/3139645.3139662","DOIUrl":"https://doi.org/10.1145/3139645.3139662","url":null,"abstract":"The Brazilian Symposium on Computing System Engineering (SBESC) is an initiative of the research community originally associated with three events: the Brazilian Workshop on Real-Time Systems, created in 1998; the Brazilian Workshop on Operating Systems, created in 2004; and the Brazilian Workshop on Embedded Systems, created in 2010. The identification of a strong synergy among these research areas added to the fact that designing computing systems is an increasingly multidisciplinary task and motivated the workshops to move from their native conferences to form an independent symposium. From the beginning, the symposium has been holding the Brazilian Embedded Systems School. In 2013, the symposium incorporated another related research community, which is focused on topics related to Critical Embedded Systems such as system safety and dependability. In the same year, it also started to host the Education Forum in Computing Engineering and the Embedded Systems Competition organized by Intel.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84507021","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}
Empirical studies in software reliability have predominantly focused on end-user applications. Given the intrinsic dependency of user programs on the operating system (OS) software, OS failures can severely impact even the most reliable applications. Therefore, it is a major requirement to understand how OS failures occur in order to improve software reliability as a whole. In this paper, we present an exploratory study on OS failure causes, based on 7,007 real failure records collected from different computers running a mass-market operating system. We performed quantitative and qualitative analyses to investigate different properties of the OS failures analyzed. The findings indicate that OS services failed more than any other OS failure category. Empirical evidences confirmed the presence of failure correlation in the sample, where both cross-correlation and autocorrelation were found; in particular, causal relationship between different operating system failures was observed.
{"title":"Exploratory Analysis on Failure Causes in a Mass-Market Operating System","authors":"C. A. R. D. Santos, Rivalino Matias","doi":"10.1145/2903267.2903274","DOIUrl":"https://doi.org/10.1145/2903267.2903274","url":null,"abstract":"Empirical studies in software reliability have predominantly focused on end-user applications. Given the intrinsic dependency of user programs on the operating system (OS) software, OS failures can severely impact even the most reliable applications. Therefore, it is a major requirement to understand how OS failures occur in order to improve software reliability as a whole. In this paper, we present an exploratory study on OS failure causes, based on 7,007 real failure records collected from different computers running a mass-market operating system. We performed quantitative and qualitative analyses to investigate different properties of the OS failures analyzed. The findings indicate that OS services failed more than any other OS failure category. Empirical evidences confirmed the presence of failure correlation in the sample, where both cross-correlation and autocorrelation were found; in particular, causal relationship between different operating system failures was observed.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86211577","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}
Building on the success of its 2010–2014 predecessors in New Delhi, Shanghai, Seoul, Singapore, and Beijing, APSys 2015 was held July 27th and 28th in Tokyo. The mission of APSys is to be a forum for systems researchers and practitioners across the world to meet, interact, and collaborate with their peers from the Asia/Pacific region. The workshop had 112 registered attendees, the second largest attendance thus far. Approximately 61% of attendees were from Japan, 12% from Korea, 12% from the U.S., 9% from China, and 3% from Europe as shown in Figure 1. We received 68 submissions, almost double that of last year and only exceeded by the 73 submissions of 2013. Each paper got at least 3 reviews by a program committee of 24. Upon receiving all reviews, each paper was discussed online. We accepted 20 papers, a 29.4% acceptance rate that is lower than the 33% average for APSys. APSys continued to attract submissions from many countries. Approximately 1/3rd of the accepted papers are from the U.S. and Canada, 1/6th each from China, Korea, and Europe, and the remaining papers from Australia, India, Japan, and Singapore. Table 1 shows the paper submission statistics by country for all APSys workshops so far. Each paper was shepherded by a program committee member, a first for APSys. Among the rejected papers, the program committee pre-accepted eight papers for poster presentation. Out of 21 submissions, we accepted 19 posters for presentation. We received 24 applications for SIGOPSsponsored student travel grants and awarded 14. Besides the paper and poster presentations, the 2-day workshop program contained a talk by Gernot Heiser on “How To Write A Systems Paper” and a lively panel on “Teaching Systems” with Gernot Heiser, KyoungSoo Park, and Robbert van Renesse, led by Haibo Chen. Finally, we had a “Systems Research in Asia-Pacific Industry” session with the following talks:
在2010-2014年在新德里、上海、首尔、新加坡和北京成功举办的基础上，APSys 2015于7月27日和28日在东京举行。APSys的使命是为世界各地的系统研究人员和从业者提供一个论坛，让他们与来自亚太地区的同行会面、互动和合作。本次研讨会共有112名注册与会者，是迄今为止参加人数第二多的一次。如图1所示，大约61%的与会者来自日本，12%来自韩国，12%来自美国，9%来自中国，3%来自欧洲。我们收到了68份申请，几乎是去年的两倍，仅超过2013年的73份。每篇论文至少由24人组成的项目委员会进行3次评审。收到所有评论后，每篇论文都在网上进行讨论。我们接受了20篇论文，录取率为29.4%，低于APSys 33%的平均录取率。APSys继续吸引来自许多国家的申请。大约三分之一的论文来自美国和加拿大，六分之一的论文来自中国、韩国和欧洲，其余的论文来自澳大利亚、印度、日本和新加坡。表1显示了到目前为止所有APSys研讨会按国家划分的论文提交统计数据。每篇论文都由一个项目委员会成员指导，这在APSys还是第一次。在被拒论文中，计划委员会预收了8篇论文进行海报展示。在21份提交的海报中，我们接受了19份海报进行展示。我们收到了24份sigops资助的学生旅行补助金申请，并批准了14份。除了论文和海报展示之外，为期两天的研讨会还包括Gernot Heiser关于“如何写系统论文”的演讲，以及由陈海波领导的Gernot Heiser, KyoungSoo Park和robert van Renesse主持的“教学系统”小组讨论。最后，我们举行了“亚太工业系统研究”会议，并进行了以下讨论:
{"title":"Report on the Asia-Pacific Systems Workshop 2015 (APSys'15)","authors":"G. Heiser, K. Kono, KyoungSoo Park, R. V. Renesse","doi":"10.1145/2903267.2903269","DOIUrl":"https://doi.org/10.1145/2903267.2903269","url":null,"abstract":"Building on the success of its 2010–2014 predecessors in New Delhi, Shanghai, Seoul, Singapore, and Beijing, APSys 2015 was held July 27th and 28th in Tokyo. The mission of APSys is to be a forum for systems researchers and practitioners across the world to meet, interact, and collaborate with their peers from the Asia/Pacific region. The workshop had 112 registered attendees, the second largest attendance thus far. Approximately 61% of attendees were from Japan, 12% from Korea, 12% from the U.S., 9% from China, and 3% from Europe as shown in Figure 1. We received 68 submissions, almost double that of last year and only exceeded by the 73 submissions of 2013. Each paper got at least 3 reviews by a program committee of 24. Upon receiving all reviews, each paper was discussed online. We accepted 20 papers, a 29.4% acceptance rate that is lower than the 33% average for APSys. APSys continued to attract submissions from many countries. Approximately 1/3rd of the accepted papers are from the U.S. and Canada, 1/6th each from China, Korea, and Europe, and the remaining papers from Australia, India, Japan, and Singapore. Table 1 shows the paper submission statistics by country for all APSys workshops so far. Each paper was shepherded by a program committee member, a first for APSys. Among the rejected papers, the program committee pre-accepted eight papers for poster presentation. Out of 21 submissions, we accepted 19 posters for presentation. We received 24 applications for SIGOPSsponsored student travel grants and awarded 14. Besides the paper and poster presentations, the 2-day workshop program contained a talk by Gernot Heiser on “How To Write A Systems Paper” and a lively panel on “Teaching Systems” with Gernot Heiser, KyoungSoo Park, and Robbert van Renesse, led by Haibo Chen. Finally, we had a “Systems Research in Asia-Pacific Industry” session with the following talks:","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82958204","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}
S. Delabrida, Thiago D'Angelo, Ricardo A. O. Oliveira, A. Loureiro
Wearable devices have emerged in the last years with new applications that provide user convenience. Healthcare, sports, safety are some examples of applications embedded in thousands of devices released in the last years. Wearable operating systems with different focus emerged together with wearable applications in order to make adjustments and optimizations of software and hardware. This paper presents a wearable operating systems discussion and shows the current challenges and wearable operating system inuence. We developed a wearable appliance for geology. The wearable contains a Head Mounted Display (HMD) assembled with Google Cardboard API and sensors connected to developments boards. For each system component was used different operating systems according to hardware and software available. The results indicate some trends for wearable operating systems.
{"title":"Building Wearables for Geology: An Operating System Approach","authors":"S. Delabrida, Thiago D'Angelo, Ricardo A. O. Oliveira, A. Loureiro","doi":"10.1145/2903267.2903275","DOIUrl":"https://doi.org/10.1145/2903267.2903275","url":null,"abstract":"Wearable devices have emerged in the last years with new applications that provide user convenience. Healthcare, sports, safety are some examples of applications embedded in thousands of devices released in the last years. Wearable operating systems with different focus emerged together with wearable applications in order to make adjustments and optimizations of software and hardware. This paper presents a wearable operating systems discussion and shows the current challenges and wearable operating system inuence. We developed a wearable appliance for geology. The wearable contains a Head Mounted Display (HMD) assembled with Google Cardboard API and sensors connected to developments boards. For each system component was used different operating systems according to hardware and software available. The results indicate some trends for wearable operating systems.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80584542","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}
With increasing demand for big-data processing and faster in-memory databases, cloud providers are moving towards large virtualized instances besides focusing on the horizontal scalability. However, our experiments reveal that such instances in popular cloud services (e.g., 32 vCPUs with 208 GB supported by Google Compute Engine) do not achieve the desired scalability with increasing core count even with a simple, embarrassingly parallel job (e.g., Linux kernel compile). On a serious note, the internal synchronization scheme (e.g., paravirtualized ticket spinlock) of the virtualized instance on a machine with higher core count (e.g., 80-core) dramatically degrades its overall performance. Our finding is different from the previously well-known scalability problem (i.e., lock contention problem) and occurs because of the sophisticated optimization techniques implemented in the hypervisor---what we call sleepy spinlock anomaly. To solve this problem, we design and implement OTICKET, a variant of paravirtualized ticket spinlock that effectively scales the virtualized instances in both undersubscribed and oversubscribed environments.
{"title":"Opportunistic Spinlocks: Achieving Virtual Machine Scalability in the Clouds","authors":"Sanidhya Kashyap, Changwoo Min, Taesoo Kim","doi":"10.1145/2903267.2903271","DOIUrl":"https://doi.org/10.1145/2903267.2903271","url":null,"abstract":"With increasing demand for big-data processing and faster in-memory databases, cloud providers are moving towards large virtualized instances besides focusing on the horizontal scalability. However, our experiments reveal that such instances in popular cloud services (e.g., 32 vCPUs with 208 GB supported by Google Compute Engine) do not achieve the desired scalability with increasing core count even with a simple, embarrassingly parallel job (e.g., Linux kernel compile). On a serious note, the internal synchronization scheme (e.g., paravirtualized ticket spinlock) of the virtualized instance on a machine with higher core count (e.g., 80-core) dramatically degrades its overall performance. Our finding is different from the previously well-known scalability problem (i.e., lock contention problem) and occurs because of the sophisticated optimization techniques implemented in the hypervisor---what we call sleepy spinlock anomaly. To solve this problem, we design and implement OTICKET, a variant of paravirtualized ticket spinlock that effectively scales the virtualized instances in both undersubscribed and oversubscribed environments.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88482965","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}
Kernel probes allow code to be inserted into a running operating system kernel to gather information for debugging or profiling. Inserting code into the kernel raises a number of safety issues. Current solutions follow one of the two paths: a VM-based approach, where safety properties are checked dynamically by an interpreter, or a static-analysis approach, where probe code is guaranteed to be safe statically. While more attractive, existing static solutions depend on ad-hoc and error-prone analysis. We propose to explore enforcing safety properties using a type system, thus building our analysis on top of the well-studied ground of type theory.
{"title":"Tapir: A Language for Verified OS Kernel Probes","authors":"Ilya Yanok, Nathaniel Nystrom","doi":"10.1145/2883591.2883602","DOIUrl":"https://doi.org/10.1145/2883591.2883602","url":null,"abstract":"Kernel probes allow code to be inserted into a running operating system kernel to gather information for debugging or profiling. Inserting code into the kernel raises a number of safety issues. Current solutions follow one of the two paths: a VM-based approach, where safety properties are checked dynamically by an interpreter, or a static-analysis approach, where probe code is guaranteed to be safe statically. While more attractive, existing static solutions depend on ad-hoc and error-prone analysis. We propose to explore enforcing safety properties using a type system, thus building our analysis on top of the well-studied ground of type theory.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88254044","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}
The uncontrolled use of the cache hierarchy in a multicore processor by real-time tasks may impact their worst-case execution times. Several operating system techniques have been recently proposed to deal with caches in a multiprocessor in order to improve predictability, such as cache partitioning, cache locking, and real-time scheduling. However, the contention caused by the cache coherence protocol and its implication for real-time tasks is still an open problem. In this paper, we present the design and evaluation of a real-time operating system for cache-coherent multicore architectures. The real-time operating system infrastructure includes real-time schedulers, cache partitioning, and cache coherence contention detection through hardware performance counters. We evaluate the real-time operating system in terms of run-time overhead, schedulability of realtime tasks, cache partitioning performance, and hardware performance counters usability. Our results indicate that: (i) a real-time operating system designed from scratch reduces the run-time overhead, and thus improves the realtime schedulability, when compared to a patched operating system; (ii) cache partitioning reduces the contention in the shared cache and provides safe real-time bounds; and (iii) hardware performance counters can detect when real-time tasks interfere with each other at the shared cache level. Scheduling, cache partitioning, and hardware performance counters together are a step-forward to provide real-time bounds in cache-coherent architectures.
{"title":"On the Design and Evaluation of a Real-Time Operating System for Cache-Coherent Multicore Architectures","authors":"G. Gracioli, A. A. Fröhlich","doi":"10.1145/2883591.2883594","DOIUrl":"https://doi.org/10.1145/2883591.2883594","url":null,"abstract":"The uncontrolled use of the cache hierarchy in a multicore processor by real-time tasks may impact their worst-case execution times. Several operating system techniques have been recently proposed to deal with caches in a multiprocessor in order to improve predictability, such as cache partitioning, cache locking, and real-time scheduling. However, the contention caused by the cache coherence protocol and its implication for real-time tasks is still an open problem. In this paper, we present the design and evaluation of a real-time operating system for cache-coherent multicore architectures. The real-time operating system infrastructure includes real-time schedulers, cache partitioning, and cache coherence contention detection through hardware performance counters. We evaluate the real-time operating system in terms of run-time overhead, schedulability of realtime tasks, cache partitioning performance, and hardware performance counters usability. Our results indicate that: (i) a real-time operating system designed from scratch reduces the run-time overhead, and thus improves the realtime schedulability, when compared to a patched operating system; (ii) cache partitioning reduces the contention in the shared cache and provides safe real-time bounds; and (iii) hardware performance counters can detect when real-time tasks interfere with each other at the shared cache level. Scheduling, cache partitioning, and hardware performance counters together are a step-forward to provide real-time bounds in cache-coherent architectures.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91226022","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}
We would like first and foremost to thank the authors who chose to submit their papers to INFLOW ’15, who are responsible for ensuring that this workshop continues to represent some of the most cutting-edge research in storage systems. We are also grateful to the program committee for their efforts, providing three to four high-quality reviews for each paper, and to ACM SIGOPS for their support of this workshop. Finally we would like to thank the attendees at INFLOW ’15, who attended despite the concurrent SOSP History Day.
{"title":"INFLOW 2015: The Third Workshop on Interactions of NVM/FLash with Operating systems and Workloa: INFLOW '15 Message from the Chairs","authors":"Peter Desnoyers, G. Kandiraju","doi":"10.1145/2883591.2883596","DOIUrl":"https://doi.org/10.1145/2883591.2883596","url":null,"abstract":"We would like first and foremost to thank the authors who chose to submit their papers to INFLOW ’15, who are responsible for ensuring that this workshop continues to represent some of the most cutting-edge research in storage systems. We are also grateful to the program committee for their efforts, providing three to four high-quality reviews for each paper, and to ACM SIGOPS for their support of this workshop. Finally we would like to thank the attendees at INFLOW ’15, who attended despite the concurrent SOSP History Day.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75395153","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：