H. Howard, Malte Schwarzkopf, Anil Madhavapeddy, J. Crowcroft
The Paxos algorithm is famously difficult to reason about and even more so to implement, despite having been synonymous with distributed consensus for over a decade. The recently proposed Raft protocol lays claim to being a new, understandable consensus algorithm, improving on Paxos without making compromises in performance or correctness. In this study, we repeat the Raft authors' performance analysis. We developed a clean-slate implementation of the Raft protocol and built an event-driven simulation framework for prototyping it on experimental topologies. We propose several optimizations to the Raft protocol and demonstrate their effectiveness under contention. Finally, we empirically validate the correctness of the Raft protocol invariants and evaluate Raft's understandability claims.
{"title":"Raft Refloated: Do We Have Consensus?","authors":"H. Howard, Malte Schwarzkopf, Anil Madhavapeddy, J. Crowcroft","doi":"10.1145/2723872.2723876","DOIUrl":"https://doi.org/10.1145/2723872.2723876","url":null,"abstract":"The Paxos algorithm is famously difficult to reason about and even more so to implement, despite having been synonymous with distributed consensus for over a decade. The recently proposed Raft protocol lays claim to being a new, understandable consensus algorithm, improving on Paxos without making compromises in performance or correctness.\u0000 In this study, we repeat the Raft authors' performance analysis. We developed a clean-slate implementation of the Raft protocol and built an event-driven simulation framework for prototyping it on experimental topologies. We propose several optimizations to the Raft protocol and demonstrate their effectiveness under contention. Finally, we empirically validate the correctness of the Raft protocol invariants and evaluate Raft's understandability claims.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88694765","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}
Cristian Ruiz, Salem Harrache, Michael Mercier, Olivier Richard
A software appliance builder bundles together an application with its needed middleware and an operating system to allow easy deployment on Infrastructure as a Service (IaaS) providers. These builders have the potential to address a key need in our community: the ability to reproduce an experiment. This paper reports the experiences on developing a software appliance builder called Kameleon that leverages popular and well tested tools. Kameleon simplifies the creation of complex software appliances that are targeted at research on operating systems, HPC and distributed computing. It does so by proposing a highly modular description format that encourages collaboration and reuse of procedures. Moreover, it provides debugging mechanisms for improving experimenter's productivity. To justify that our appliance builder stands above others, we compare it with the most known tools used by developers and researchers to automate the construction of software environments for virtual machines and IaaS infrastructures.
{"title":"Reconstructable Software Appliances with Kameleon","authors":"Cristian Ruiz, Salem Harrache, Michael Mercier, Olivier Richard","doi":"10.1145/2723872.2723883","DOIUrl":"https://doi.org/10.1145/2723872.2723883","url":null,"abstract":"A software appliance builder bundles together an application with its needed middleware and an operating system to allow easy deployment on Infrastructure as a Service (IaaS) providers. These builders have the potential to address a key need in our community: the ability to reproduce an experiment. This paper reports the experiences on developing a software appliance builder called Kameleon that leverages popular and well tested tools. Kameleon simplifies the creation of complex software appliances that are targeted at research on operating systems, HPC and distributed computing. It does so by proposing a highly modular description format that encourages collaboration and reuse of procedures. Moreover, it provides debugging mechanisms for improving experimenter's productivity. To justify that our appliance builder stands above others, we compare it with the most known tools used by developers and researchers to automate the construction of software environments for virtual machines and IaaS infrastructures.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80291111","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}
Welcome to this special issue of Operating Systems Review dedicated to the topics of repeatability and sharing of experimental artifacts in systems research. The twelve papers in this issue present na snapshot of activities, results, and viewpoints on this theme. As the guest editor of this issue, I hope that you find these papers to be both inspiring and useful. I hope that by reading them, you will be motivated to carefully think about repeatability and artifact sharing as you pursue your own systems experiments. Several of the papers in this special issue present tools or testbeds that support repeatability and sharing, so I expect that you will discover one or more "new tricks" that will make it easier for you to create and share high-quality, sound, and repeatable experiments.
{"title":"Foreword: Special Issue on Repeatability and Sharing of Experimental Artifacts","authors":"E. Eide","doi":"10.1145/2723872.2723874","DOIUrl":"https://doi.org/10.1145/2723872.2723874","url":null,"abstract":"Welcome to this special issue of Operating Systems Review dedicated to the topics of repeatability and sharing of experimental artifacts in systems research. The twelve papers in this issue present na snapshot of activities, results, and viewpoints on this theme. As the guest editor of this issue, I hope that you find these papers to be both inspiring and useful. I hope that by reading them, you will be motivated to carefully think about repeatability and artifact sharing as you pursue your own systems experiments. Several of the papers in this special issue present tools or testbeds that support repeatability and sharing, so I expect that you will discover one or more \"new tricks\" that will make it easier for you to create and share high-quality, sound, and repeatable experiments.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87000649","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}
Data placement refers to the problem of deciding how to assign data items to nodes in a distributed system to optimize one or several of a number of performance criteria such as reducing network congestion, improving load balancing, among others. This document reports on our experience when addressing this problem in distributed systems of different scales, namely: medium size datacenter-scale and internet-scale systems.
{"title":"On Data Placement in Distributed Systems","authors":"João Paiva, L. Rodrigues","doi":"10.1145/2723872.2723890","DOIUrl":"https://doi.org/10.1145/2723872.2723890","url":null,"abstract":"Data placement refers to the problem of deciding how to assign data items to nodes in a distributed system to optimize one or several of a number of performance criteria such as reducing network congestion, improving load balancing, among others. This document reports on our experience when addressing this problem in distributed systems of different scales, namely: medium size datacenter-scale and internet-scale systems.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77745688","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}
In this paper we address the question of developing a lightweight and effective workflow for conducting experimental research on modern parallel computer systems in a reproducible way. Our approach builds on two well-known tools (Git and Org-mode) and enables to address, at least partially, issues such as running experiments, provenance tracking, experimental setup reconstruction or replicable analysis. We have been using such a methodology for two years now and it enabled us to recently publish a fully reproducible article [12]. To fully demonstrate the effectiveness of our proposal, we have opened our two year laboratory notebook with all the attached experimental data. This notebook and the underlying Git revision control system enable to illustrate and to better understand the workflow we used.
{"title":"An Effective Git And Org-Mode Based Workflow For Reproducible Research","authors":"Luka Stanisic, Arnaud Legrand, Vincent Danjean","doi":"10.1145/2723872.2723881","DOIUrl":"https://doi.org/10.1145/2723872.2723881","url":null,"abstract":"In this paper we address the question of developing a lightweight and effective workflow for conducting experimental research on modern parallel computer systems in a reproducible way. Our approach builds on two well-known tools (Git and Org-mode) and enables to address, at least partially, issues such as running experiments, provenance tracking, experimental setup reconstruction or replicable analysis. We have been using such a methodology for two years now and it enabled us to recently publish a fully reproducible article [12]. To fully demonstrate the effectiveness of our proposal, we have opened our two year laboratory notebook with all the attached experimental data. This notebook and the underlying Git revision control system enable to illustrate and to better understand the workflow we used.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82471361","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}
Compared to more traditional disciplines, such as the natural sciences, computer science is said to have a somewhat sloppy relationship with the external repeatability of published results. However, from our experience the problem starts even earlier: In many cases, authors are not even able to replicate their own results a year later, or to explain how exactly that number on page three of the paper was ncomputed. Because of constant time pressure and strict submission deadlines, the successful researcher has to favor timely results over experiment documentation and data traceability. We consider internal repeatability to be one of the most important prerequisites for external replicability and the scientific process. We describe our approach to foster internal repeatability in our own research projects with the help of dedicated tools for the automation of traceable experimental setups and for data presentation in scientific papers. By employing these tools, measures for ensuring internal repeatability no longer waste valuable working time and pay off quickly: They save time by eliminating recurring, and therefore error-prone, manual work steps, and at the same time increase confidence in experimental results.
{"title":"The dataref versuchung: Saving Time through Better Internal Repeatability","authors":"Christian J. Dietrich, D. Lohmann","doi":"10.1145/2723872.2723880","DOIUrl":"https://doi.org/10.1145/2723872.2723880","url":null,"abstract":"Compared to more traditional disciplines, such as the natural sciences, computer science is said to have a somewhat sloppy relationship with the external repeatability of published results. However, from our experience the problem starts even earlier: In many cases, authors are not even able to replicate their own results a year later, or to explain how exactly that number on page three of the paper was ncomputed. Because of constant time pressure and strict submission deadlines, the successful researcher has to favor timely results over experiment documentation and data traceability.\u0000 We consider internal repeatability to be one of the most important prerequisites for external replicability and the scientific process. We describe our approach to foster internal repeatability in our own research projects with the help of dedicated tools for the automation of traceable experimental setups and for data presentation in scientific papers. By employing these tools, measures for ensuring internal repeatability no longer waste valuable working time and pay off quickly: They save time by eliminating recurring, and therefore error-prone, manual work steps, and at the same time increase confidence in experimental results.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81240646","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}
Petter Svärd, B. Hudzia, Steve Walsh, Johan Tordsson, E. Elmroth
Since first demonstrated by Clark et al. in 2005, live migration of virtual machines has both become a standard feature of hypervisors and created an active field of research. However, the rich ongoing research in live migration focusmainly on performance improvements to well-known techniques, most of them being variations of the Clark approach. In order to advance live migration beyond incremental performance improvements, it is important to gain a deeper understanding of the live migration problem itself and its underlying principles. To address this issue, this contribution takes a step back and investigates the essential characteristics of live migration. The paper identifies five fundamental properties of live migration and uses these to investigate, categorize, and compare three approaches to live migration: precopy, postcopy and hybrid. The evaluated algorithms include well-known techniques derived from that of Clark as well as novel RDMA in-kernel approaches. Our analysis of the fundamental properties of the algorithms is validated by a set of experiments. In these, we migrate virtual machines with large memory sizes hosting workloads with high page dirtying rates to expose differences and limitations of the different approaches. Finally, we provide guidelines for which approach to use in different scenarios.
{"title":"Principles and Performance Characteristics of Algorithms for Live VM Migration","authors":"Petter Svärd, B. Hudzia, Steve Walsh, Johan Tordsson, E. Elmroth","doi":"10.1145/2723872.2723894","DOIUrl":"https://doi.org/10.1145/2723872.2723894","url":null,"abstract":"Since first demonstrated by Clark et al. in 2005, live migration of virtual machines has both become a standard feature of hypervisors and created an active field of research. However, the rich ongoing research in live migration focusmainly on performance improvements to well-known techniques, most of them being variations of the Clark approach. In order to advance live migration beyond incremental performance improvements, it is important to gain a deeper understanding of the live migration problem itself and its underlying principles.\u0000 To address this issue, this contribution takes a step back and investigates the essential characteristics of live migration. The paper identifies five fundamental properties of live migration and uses these to investigate, categorize, and compare three approaches to live migration: precopy, postcopy and hybrid. The evaluated algorithms include well-known techniques derived from that of Clark as well as novel RDMA in-kernel approaches. Our analysis of the fundamental properties of the algorithms is validated by a set of experiments. In these, we migrate virtual machines with large memory sizes hosting workloads with high page dirtying rates to expose differences and limitations of the different approaches. Finally, we provide guidelines for which approach to use in different scenarios.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86743887","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}
Nicola Nostro, A. Ceccarelli, A. Bondavalli, F. Brancati
Security is a major challenge for today's companies, especially ICT ones which manage large scale cyber-critical systems. Amongst the multitude of attacks and threats to which a system is potentially exposed, there are insider attackers i.e., users with legitimate access which abuse or misuse of their power, thus leading to unexpected security violation (e.g., acquire and disseminate sensitive information). These attacks are very difficult to detect and mitigate due to the nature of the attackers, which often are company's employees motivated by socio-economical reasons, and to the fact that attackers operate within their granted restrictions. It is a consequence that insider attackers constitute an actual threat for ICT organizations. In this paper we present our methodology, together with the application of existing supporting libraries and tools from the state-of-the-art, for insider threats assessment and mitigation. The ultimate objective is to define the motivations and the target of an insider, investigate the likeliness and severity of potential violations, and finally identify appropriate countermeasures. The methodology also includes a maintenance phase during which the assessment can be updated to reflect system changes. As case study, we apply our methodology to the crisis management system Secure!, which includes different kinds of users and consequently is potentially exposed to a large set of insider threats.
{"title":"Insider Threat Assessment: a Model-Based Methodology","authors":"Nicola Nostro, A. Ceccarelli, A. Bondavalli, F. Brancati","doi":"10.1145/2694737.2694740","DOIUrl":"https://doi.org/10.1145/2694737.2694740","url":null,"abstract":"Security is a major challenge for today's companies, especially ICT ones which manage large scale cyber-critical systems. Amongst the multitude of attacks and threats to which a system is potentially exposed, there are insider attackers i.e., users with legitimate access which abuse or misuse of their power, thus leading to unexpected security violation (e.g., acquire and disseminate sensitive information). These attacks are very difficult to detect and mitigate due to the nature of the attackers, which often are company's employees motivated by socio-economical reasons, and to the fact that attackers operate within their granted restrictions. It is a consequence that insider attackers constitute an actual threat for ICT organizations. In this paper we present our methodology, together with the application of existing supporting libraries and tools from the state-of-the-art, for insider threats assessment and mitigation. The ultimate objective is to define the motivations and the target of an insider, investigate the likeliness and severity of potential violations, and finally identify appropriate countermeasures. The methodology also includes a maintenance phase during which the assessment can be updated to reflect system changes. As case study, we apply our methodology to the crisis management system Secure!, which includes different kinds of users and consequently is potentially exposed to a large set of insider threats.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75126734","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}
One year after our first workshop on dependability issues in cloud computing, it is possible to say that cloud adoption reached ubiquity, paraphrasing a 2014 report [2]. In that document, RightScale, a cloud portfolio management company, says that 94% of the organisations they surveyed are running applications or at least experimenting with Infrastructure-as-a-Service. Moreover, 87% of these companies are using public clouds, often following a hybrid cloud approach. In a 2013 report, Verizon said that organisations were no longer using clouds just for development and testing, as production applications accounted for 60% of cloud usage [3]. A last January post in Forbes estimates that US businesses will spend $13 Billion in cloud computing in 2014 [1]. This level of cloud computing adoption suggests that the time is ripe for research on services and processes for cloud dependability and security. Governments are now aware of the benefits and challenges of cloud computing, as shown by initiatives such as the European Commission’s Cloud Computing Strategy and the U.S. Chief Information Officer and Federal CIO Council cloud.cio.gov . The academic community is not behind with a large number of conferences being promoted by professional societies such as the Association for Computing Machinery (ACM) and the Institute of Electrical and Electronics Engineers (IEEE). Consequently, research in the area is thriving. The Second International Workshop on Dependability Issues in Cloud Computing – DISCCO 2013 – aimed to contribute to this trend on research on cloud computing with a focus on dependability and security. This section of the present issue of the Operating Systems Review aims to report the activities of the workshop and present extended versions of two papers selected from its program based on their timeliness and quality.
{"title":"Cloud Computing Dependability: Report and Extended Papers of the Second International Workshop on Dependability Issues in Cloud Computing","authors":"M. Correia, N. Mittal","doi":"10.1145/2694737.2694739","DOIUrl":"https://doi.org/10.1145/2694737.2694739","url":null,"abstract":"One year after our first workshop on dependability issues in cloud computing, it is possible to say that cloud adoption reached ubiquity, paraphrasing a 2014 report [2]. In that document, RightScale, a cloud portfolio management company, says that 94% of the organisations they surveyed are running applications or at least experimenting with Infrastructure-as-a-Service. Moreover, 87% of these companies are using public clouds, often following a hybrid cloud approach. In a 2013 report, Verizon said that organisations were no longer using clouds just for development and testing, as production applications accounted for 60% of cloud usage [3]. A last January post in Forbes estimates that US businesses will spend $13 Billion in cloud computing in 2014 [1]. This level of cloud computing adoption suggests that the time is ripe for research on services and processes for cloud dependability and security. Governments are now aware of the benefits and challenges of cloud computing, as shown by initiatives such as the European Commission’s Cloud Computing Strategy and the U.S. Chief Information Officer and Federal CIO Council cloud.cio.gov . The academic community is not behind with a large number of conferences being promoted by professional societies such as the Association for Computing Machinery (ACM) and the Institute of Electrical and Electronics Engineers (IEEE). Consequently, research in the area is thriving. The Second International Workshop on Dependability Issues in Cloud Computing – DISCCO 2013 – aimed to contribute to this trend on research on cloud computing with a focus on dependability and security. This section of the present issue of the Operating Systems Review aims to report the activities of the workshop and present extended versions of two papers selected from its program based on their timeliness and quality.","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85489476","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}
I was delighted that the ACM extended the professional travel program to create an Emeritus-Discount on the SOSP registration, particularly since it was driving distance for me, and would have been a shame to miss. I also attended the Sunday workshop on non-volatile memory. I have been an ACM member pretty continuously since I was an Undergraduate at Northwestern, in the early 1960s. During my carrier I participated in many ACM program committees, and conferences, but my favorite has always been SOSP. During my carrier at IBM I spent a sabbatical at UC Berkeley CS, and being in the Research Division, was following university research, mainly systems, for decades. Visiting Universities, going to conferences, especially SOSP ” meeting the Faculty and Graduate students and seeing their research projects, was part of my role at IBM, but also just great fun. I enjoyed finding the projects that related to IBM work, and getting people connected. I fondly remember many SOSP conferences, and the graduate students I met for the first time, and later hired. When I retired, then the Past President of the IBM Academy of Technology, I was invited, as one of the senior scientists, to continue as an Emeritus Distinguished Engineer. It makes for a nice transition into mostly retirement, but I also continue to have a role in the research, and keep track of projects I am interested in. It also let’s me continue to play my role as a matchmaker between researchers at IBM and in Academia, and look for promising graduate students who might want to work at IBM research. I also continue to be active in the ACM, as a member of the Professional Development Committee, and am on some university advisory boards. Attending SOSP fit very well with my situation as an Emeritus at IBM. I saw many interesting presentations and poster sessions. In some cases they were in areas where I have worked over the years, and I feel I was able to provide some historical context for the people doing the work. Knowing about work in IBM, as well as other universities, I was also able to suggest to the people I met, other work that I thought would interest them, and in some cases provided email introductions. I had attended the SOSP at Big Sky, at my expense, Emeritus, Retired academics and industrial researchers don’t have grant money with travel, or a corporate expense account. I combined it with vacation time in Yellowstone, the Teatons, and Jackson, and just barely justified the extra, quite high cost of the SOSP conference. Hopefully SOSP, and other conferences, will value having older researchers, who are still active, with connections to other university or corporate research, but are no longer coming ”free” because their job pays for it, and have a long connection with ACM and the particular conference. I fully expect to pay for lodging and transportation, and turn the trip into a bit of vacation travel, but help on the high cost of the conference itself is a big help. The economics of a
{"title":"SOSP Professional Travel Scholarship: Reflections by Recipient William Tetzlaff","authors":"W. Tetzlaff","doi":"10.1145/2694737.2694743","DOIUrl":"https://doi.org/10.1145/2694737.2694743","url":null,"abstract":"I was delighted that the ACM extended the professional travel program to create an Emeritus-Discount on the SOSP registration, particularly since it was driving distance for me, and would have been a shame to miss. I also attended the Sunday workshop on non-volatile memory. I have been an ACM member pretty continuously since I was an Undergraduate at Northwestern, in the early 1960s. During my carrier I participated in many ACM program committees, and conferences, but my favorite has always been SOSP. During my carrier at IBM I spent a sabbatical at UC Berkeley CS, and being in the Research Division, was following university research, mainly systems, for decades. Visiting Universities, going to conferences, especially SOSP ” meeting the Faculty and Graduate students and seeing their research projects, was part of my role at IBM, but also just great fun. I enjoyed finding the projects that related to IBM work, and getting people connected. I fondly remember many SOSP conferences, and the graduate students I met for the first time, and later hired. When I retired, then the Past President of the IBM Academy of Technology, I was invited, as one of the senior scientists, to continue as an Emeritus Distinguished Engineer. It makes for a nice transition into mostly retirement, but I also continue to have a role in the research, and keep track of projects I am interested in. It also let’s me continue to play my role as a matchmaker between researchers at IBM and in Academia, and look for promising graduate students who might want to work at IBM research. I also continue to be active in the ACM, as a member of the Professional Development Committee, and am on some university advisory boards. Attending SOSP fit very well with my situation as an Emeritus at IBM. I saw many interesting presentations and poster sessions. In some cases they were in areas where I have worked over the years, and I feel I was able to provide some historical context for the people doing the work. Knowing about work in IBM, as well as other universities, I was also able to suggest to the people I met, other work that I thought would interest them, and in some cases provided email introductions. I had attended the SOSP at Big Sky, at my expense, Emeritus, Retired academics and industrial researchers don’t have grant money with travel, or a corporate expense account. I combined it with vacation time in Yellowstone, the Teatons, and Jackson, and just barely justified the extra, quite high cost of the SOSP conference. Hopefully SOSP, and other conferences, will value having older researchers, who are still active, with connections to other university or corporate research, but are no longer coming ”free” because their job pays for it, and have a long connection with ACM and the particular conference. I fully expect to pay for lodging and transportation, and turn the trip into a bit of vacation travel, but help on the high cost of the conference itself is a big help. The economics of a ","PeriodicalId":7046,"journal":{"name":"ACM SIGOPS Oper. Syst. Rev.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81502453","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
扫码关注我们
求助内容：
应助结果提醒方式：