DOCSLIB.ORG

Supplemental Material for CORE Ranking Application for the International Symposium on Distributed Computing (DISC)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Supplemental Material for CORE Ranking Application for the International Symposium on Distributed Computing (DISC) Supplemental material for CORE ranking application for the International Symposium on Distributed Computing (DISC) 1 General (Part F.2 of General CORE Form) DISC is a conference in Theoretical Distributed Computing. Theoretical Distributed Computing is its own research area, intersecting with both general CS Theory and distributed systems, but not a subarea of either of those: There are plenty of research topics that are covered by Theoretical Distributed Computing conferences that would not be covered by STOC/FOCS/SODA and other general CS Theory conferences nor by networking/distributed systems conferences, but which are very relevant theoretical areas with direct application to current distributed systems (e.g., theoretical underpinnings of blockchain, consensus, and low-level concurrency). To further understand how theoretical distributed computing is not a direct subset of CS Theory, note that the acceptance rates of DISC are in fact lower than the acceptance rates of the top general CS Theory conferences: SODA has an average acceptance rate of 30%, FOCS of 27.6% and STOC of 26.3%, according to lamsade.dauphine.fr/ sikora/ratio/confs.php – these three conferences are all rated A* by CORE. DISC and PODC (PODC is an A*-ranked conference at CORE) are the top two conferences in theoretical dis- tributed computing conferences. The theoretical distributed computing community opted to have two smaller, single- session top flagship conferences spread throughout the year, with support both from the US and from Europe through ACM and EATCS respectively, rather than having just one flagship multiple-session conference. DISC and PODC have very similar number of submissions and acceptance rates (see Section 4) and the same set of outstandingly qualified ”top people” in theoretical distributed computing publish in both conferences regularly: In addition to the information in Sections B, C and D of the CORE application, Section 5 shows the similarity of the pattern of publications in DISC and PODC (produced through the WPP tool) for a broader set of 36 top scholars who publish in theoretical distributed computing, ranging from the younger to the more established researchers. Moreover, the top award for Theoretical Distributed Computing, the Dijkstra Prize, and the Distributed Computing Dissertation award, which awards the top PhD thesis in theoretical distributed computing in a given year, are both jointly awarded by DISC and PODC and are delivered in alternate years at each of the two conferences. DISC brings together a large number of colocated workshops that span many areas connected to theoretical dis- tributed computing. In 2019 we had as many as 8 workshops colocated with DISC, with diverse topics including e.g. biological computation, hardware design, formal methods, and programming languages, all studied from the perspec- tive of distributed systems. In 2020, even though the conference was held online, we still had 4 colocated workshops, and all of them were very popular, with 100+ registered participants; a highlight was the CELLS workshop, which brought a large number of participants also from outside the traditional computer science community. Hence DISC (as well as PODC) serve as a hub that connects many different research communities with ties to theoretical distributed computing. Lastly, we would like to note that DISC is only listed at CORE under Field of Research 4606 – Distributed Computing and Systems Software, which spans all of the more applied areas in distributed computing, networking and systems. As mentioned above DISC is a theoretical CS conference (in distributed computing) and hence we would like to ask you that it be also listed under Field of Research 4613 – Theory of Computation, reflecting the correct subarea that DISC represents, Theoretical Distributed Computing. In the following, you will find additional supporting supporting information to DISC’s application that is not directly included in the general CORE application, such as a graph with DISC and PODC’s acceptance rates for the last several years, a list of researchers who regularly publish at DISC, with their affiliations, and a report by the DISC 2018 PC chair that document and illustrates the rigorous review process that papers submitted to DISC go through. 1 2 Qualifications of Regular DISC Participants Regular participants and contributors to PODC include distinguished researchers at all career levels with high h-index. The citation numbers are from Google Scholar, unless otherwise noted. Generally, citation numbers in theory are smaller than those in systems, as the community is smaller. Here is a sampling1: Name Affiliation Selected Honors h-index Number of DISC Count of most cited papers DISC paper Marcos Aguilera VMWare 42 12 184 James Aspnes Yale Dijkstra Prize 39 11 199 Hagit Attiya Techion ACM Fellow, 44 19 103 Dijkstra Prize Tushar Deepak Uber Dijkstra Prize 34 1 232 Chandra Dave Dice Oracle 42 1 1196 Danny Dolev Hebrew University ACM Fellow, 66 6 75 Dijkstra Award Shlomi Dolev Ben-Gurion 49 13 143 University Faith Ellen University of ACM Fellow 13 Toronto Pierre Fraigniaud CNRS 50 17 143 Seth Gilbert National U. of 32 18 142 Singapore Rachid Guerraoui EPFL ACM Fellow 75 33 205 Vassos Hadzilacos University of Dijkstra Prize 26 7 102 Toronto Bernhard Haeupler CMU Sloan Research 27 10 100 Fellow Joe Halpern Cornell ACM Fellow, IEEE 89 3 Fellow, NAE2, Godel¨ Prize, ACM AAAI Allen Newell Award Maurice Herlihy Brown University ACM Fellow, NAE, 70 21 622 Dijkstra Prize twice, Godel¨ Prize Idit Keidar Technion 42 16 113 Valerie King University of ACM Fellow 31 5 Victoria Fabian Kuhn University of 41 22 143 Freiburg Leslie Lamport Microsoft Research Turing Award, 80 7 116 NAE, NAS3, ACM Fellow, IEEE John von Neumann Medal, IEEE Emanuel R. Piore Award, Dijkstra Prize (three times) Nancy Lynch MIT ACM Fellow, NAE, 75 25 240 NAS, Knuth Prize, Dijkstra Prize Dahlia Malkhi Diem Association ACM Fellow 55 17 128 Yoram Moses Technion Dijkstra Prize, 33 11 Godel¨ Prize Gopal Pandurangan University of 35 10 114 Houston 1We will leave a field blank when the respective information was not available. 2US National Academy of Engineering 3US National Academy of Science 2 Name Affiliation Selected Honors h-index Number of DISC Count of most cited papers DISC paper Andrzej Pelc University of 50 9 Quebec in Outaouais David Peleg Weizmann Institute ACM Fellow, 75 15 of Science Dijkstra Prize Michel Raynal INRIA Academia Europea 61 22 225 Christian Scheideler U. of Paderborn 40 8 74 Stefan Schmid University of 42 5 74 Vienna Michael Scott University of ACM Fellow, IEEE 59 11 301 Rochester Fellow, Dijkstra Prize Nir Shavit MIT ACM Fellow, 13 Dijkstra Prize, Godel¨ Prize Gadi Taubenfeld Interdisciplinary 22 13 97 Center Sam Toueg University of Dijkstra Prize 45 10 184 Toronto Nitin Vaidya Georgetown IEEE Fellow 72 3 University Roger Wattenhofer ETH Zurich¨ 86 10 150 Jennifer Welch Texas A& M 34 10 152 Moti Yung Google ACM Fellow, IEEE 108 4 216 Fellow, EATCS Fellow, IACR Fellow 3 Quality of Reviewing of DISC Submissions We present detailed sample materials from the review process for the 2018 DISC conference, whose PC chair was Ulrich Schmid, Technical University of Vienna, Austria. The makeup of the DISC steering committee includes the PC chairs from the previous three years, so there is good continuity of processes and expectations. 3 Details of the DISC’18 Reviewing Process Since DISC 2018 was expected to get a similar number of submissions as DISC 2017, a large PC consisting of 39 distinguished members of the community was formed in an attempt to sufficiently cover all the 17 topics specifically addressed in the call for papers. In addition, stimulated by concerns with the reviewing process used at DISC and PODC in the past1, a number of quality-enhancing measures were foreseen for DISC 2018. Besides enforcing the requirement for self-contained submissions (15 pages LIPIcs, without references) by disallowing appendices but encouraging full versions on publicly accessible archives like arxiv or HAL, which facilitates a fair comparison of submissions given the tight reviewing time constraints, the following measures were implemented: (i) To facilitate effective paper bidding, EasyChair’s ability to match the selected topics of the submissions with the selected topics of expertise of the PC members was used to generate an initial bidding proposal for every PC member that could be modified during the actual paper bidding phase. The result of the bidding phase allowed EasyChair to find an optimal paper assignment (3 reviewers per submission) in a single assignment run, in negligible time. (ii) In order not to rule out the most competent reviewers for a submission by an overly restrictive conflict of interest policy, prohibitive CoI (like supervisor or personal relations, to be declared during bidding as usual) that forbid any access to the reviewing process, and milder forms of CoI (like occasional co-authorship, to be declared in the “comments to the PC section” of the reviews) were distinguished. (iii) A reviewing process with two intermediate reviews before the final review was enforced. The first intermediate review just asked for the reviewers’ actual expertise for reviewing the assigned papers [1 week after paper assignment], the second intermediate review asked for an estimate of the overall merit figure (and optionally major strenghts and weaknesses) [3 weeks after paper assignment]. The intermediate reviews were used to assign additional PC members/reviewers to submissions that either did not have at least 2 reviewers with expertise 3 (“knowledgable”) or 4 (“expert”), or suffered from controversial merit figure estimates (a difference larger or equal to 3, from knowledgable reviewers). At the end, 50 (resp. 3) submissions ended up with 4 (resp. 5) reviewers. (iv) The full reviews were due 6 weeks after paper assignment, which allowed 3 weeks of discussion before the PC meeting.
Load more

Recommended publications
  • James Aspnes
    James Aspnes August 12th, 2021 Work address James Aspnes Yale University Department of Computer Science 39 Willow Road Guilford, CT USA Email: [email protected] URL: https://www.cs.yale.edu/homes/aspnes/ Phone: +1 203 533 9862 Home address 39 Willow Rd Guilford, CT 06437-1723 Degrees • PhD (CS) 1992, Carnegie-Mellon University. Thesis title: Wait-Free Consensus. Advisor: Steven Rudich. • SM (EECS) 1987, Massachusetts Institute of Technology. • SB (Mathematics) 1987, Massachusetts Institute of Technology. Experience • Yale University. Assistant Professor of Computer Science, 1993–1998; Associate Professor of Computer Science (term), 1998–2001; Associate Professor of Computer Science (tenured), 2001–2005; Professor of Com- puter Science, 2005–. • IBM Almaden Research Center. Visiting Scientist, 1992–1993. 1 Honors • ACM-EATCS Dijkstra Prize in Distributed Computing, 2020. • The Dylan Hixon ’88 Prize for Teaching Excellence in the Natural Sci- ences. Awarded by Yale College, 2000. • IBM Graduate Fellowship, 1991–1992. • NSF Graduate Fellowship, 1987–1990. • Phi Beta Kappa, 1987. Grants • NSF award CCF-1650596, EAGER: Concurrent Data Structures, 2016–2020. (PI, $265,044.) • NSF award CCF-1637385, AitF: The Fuzzy Log: A Unifying Abstrac- tion for the Theory and Practice of Distributed Systems, 2016–2019. (Co-PI, $600,000.) • NSF award CCF-0916389, AF: Small: Algorithms for Active Learning of Interaction Networks, 2009–2013. (Co-PI, $500,000.) • NSF award CNS-0435201, NeTS-NR: Design and Evaluation of Multi- homed Networks, 2004–2008. (Co-PI, $349,987.) • NSF award CNS-0305258, Distributed Tree Infrastructure for Peer-to- Peer Systems, 2003–2006. (PI, $300,000.) • NSF award CCR-0098078, Fault-Tolerant Distributed Resource Loca- tion, 2001–2004.
    [Show full text]
  • Distributed Computing Column 52 Annual Review 2013
    Distributed Computing Column 52 Annual Review 2013 Jennifer L. Welch Department of Computer Science and Engineering Texas A&M University, College Station, TX 77843-3112, USA [email protected] This is my inaugural issue as editor of the SIGACT News Distributed Computing Column. I am honored to be asked to take over from Idit Keidar, who has done a wonderful job with the column for the last seven years, obtaining a wide variety of articles that have provided the community with informative news, and leavening it with her sense of humor. I hope to continue to rely on the efforts of the community to share information about our field. As with prior December issues, this issue is devoted to a review of notable events related to distributed computing that occurred during the year. First, congratulations to Nati Linial who received the 2013 Dijkstra Prize for his paper \Lo- cality in Distributed Graph Algorithms"! I have reproduced the citation for his award, which was presented at the International Symposium on Distributed Computing (DISC), illustrated with a photo. Congratulations as well to Shiri Chechik and Danupon Nanongkai, who were awarded the Principles of Distributed Computing Doctoral Dissertation Award! Shiri's dissertation was entitled \Fault-Tolerant Structures in Graphs", while Danupon's was \Graphs and Geometric Algorithms on Distributed Networks and Databases". I have also reproduced their citations; the awards were also given at DISC. Graphs rule! The first invited article is a review of the 2013 ACM Symposium on Principles of Distributed Computing (PODC) by Nicolas Braud-Santoni. Nicolas is the student author of the paper \Fast Byzantine Agreement", which received a Best Student Paper Award; the other authors are Rachid Guerraoui and Florian Huc.
    [Show full text]
  • Dagrep-V007-I011-Complete.Pdf
    Volume 7, Issue 11, November 2017 New Challenges in Parallelism (Dagstuhl Seminar 17451) Annette Bieniusa, Hans-J. Boehm, Maurice Herlihy, and Erez Petrank ........... 1 Algorithmic Cheminformatics (Dagstuhl Seminar 17452) Jakob L. Andersen, Christoph Flamm, Daniel Merkle, and Peter F. Stadler . 28 Connecting Visualization and Data Management Research (Dagstuhl Seminar 17461) Remco Chang, Jean-Daniel Fekete, Juliana Freire, and Carlos E. Scheidegger . 46 A Shared Challenge in Behavioural Specification (Dagstuhl Seminar 17462) Klaus Havelund, Martin Leucker, Giles Reger, and Volker Stolz . 59 Artificial and Computational Intelligence in Games: AI-Driven Game Design (Dagstuhl Seminar 17471) Pieter Spronck, Elisabeth André, Michael Cook, and Mike Preuß . 86 Addressing the Computational Challenges of Personalized Medicine (Dagstuhl Seminar 17472) Niko Beerenwinkel, Holger Fröhlich, and Susan A. Murphy . 130 Reliable Computation and Complexity on the Reals (Dagstuhl Seminar 17481) Norbert T. Müller, Siegfried M. Rump, Klaus Weihrauch, and Martin Ziegler . 142 DagstuhlReports,Vol. 7,Issue11 ISSN2192-5283 ISSN 2192-5283 Published online and open access by Aims and Scope Schloss Dagstuhl – Leibniz-Zentrum für Informatik The periodical Dagstuhl Reports documents the GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, program and the results of Dagstuhl Seminars and Germany. Online available at Dagstuhl Perspectives Workshops. http://www.dagstuhl.de/dagpub/2192-5283 In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that Publication date contains the following: March, 2018 an executive summary of the seminar program and the fundamental results, Bibliographic information published by the Deutsche an overview of the talks given during the seminar Nationalbibliothek (summarized as talk abstracts), and The Deutsche Nationalbibliothek lists this publica- summaries from working groups (if applicable).
    [Show full text]
  • FOCS 2005 Program SUNDAY October 23, 2005
    FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H.
    [Show full text]
  • Chicago Journal of Theoretical Computer Science the MIT Press
    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 1 12 March 1997 ISSN 1073–0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; [email protected], [email protected]. Published one article at a time in LATEX source form on the Internet. Pag- ination varies from copy to copy. For more information and other articles see: http://www-mitpress.mit.edu/jrnls-catalog/chicago.html • http://www.cs.uchicago.edu/publications/cjtcs/ • ftp://mitpress.mit.edu/pub/CJTCS • ftp://cs.uchicago.edu/pub/publications/cjtcs • Feige and Kilian Limited vs. Polynomial Nondeterminism (Info) The Chicago Journal of Theoretical Computer Science is abstracted or in- R R R dexed in Research Alert, SciSearch, Current Contents /Engineering Com- R puting & Technology, and CompuMath Citation Index. c 1997 The Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal’s World Wide Web site for further details. Address inquiries to the Subsidiary Rights Manager, MIT Press Journals; (617)253-2864; [email protected]. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for significant results on theoretical aspects of all topics in computer science. Editor in chief: Janos Simon Consulting
    [Show full text]
  • Self-Sorting SSD: Producing Sorted Data Inside Active Ssds
    Foreword This volume contains the papers presentedat the Third Israel Symposium on the Theory of Computing and Systems (ISTCS), held in Tel Aviv, Israel, on January 4-6, 1995. Fifty five papers were submitted in response to the Call for Papers, and twenty seven of them were selected for presentation. The selection was based on originality, quality and relevance to the field. The program committee is pleased with the overall quality of the acceptedpapers and, furthermore, feels that many of the papers not used were also of fine quality. The papers included in this proceedings are preliminary reports on recent research and it is expected that most of these papers will appear in a more complete and polished form in scientific journals. The proceedings also contains one invited paper by Pave1Pevzner and Michael Waterman. The program committee thanks our invited speakers,Robert J. Aumann, Wolfgang Paul, Abe Peled, and Avi Wigderson, for contributing their time and knowledge. We also wish to thank all who submitted papers for consideration, as well as the many colleagues who contributed to the evaluation of the submitted papers. The latter include: Noga Alon Alon Itai Eric Schenk Hagit Attiya Roni Kay Baruch Schieber Yossi Azar Evsey Kosman Assaf Schuster Ayal Bar-David Ami Litman Nir Shavit Reuven Bar-Yehuda Johan Makowsky Richard Statman Shai Ben-David Yishay Mansour Ray Strong Allan Borodin Alain Mayer Eli Upfal Dorit Dor Mike Molloy Moshe Vardi Alon Efrat Yoram Moses Orli Waarts Jack Feldman Dalit Naor Ed Wimmers Nissim Francez Seffl Naor Shmuel Zaks Nita Goyal Noam Nisan Uri Zwick Vassos Hadzilacos Yuri Rabinovich Johan Hastad Giinter Rote The work of the program committee has been facilitated thanks to software developed by Rob Schapire and FOCS/STOC program chairs.
    [Show full text]
  • Combinatorial Topology and Distributed Computing Copyright 2010 Herlihy, Kozlov, and Rajsbaum All Rights Reserved
    Combinatorial Topology and Distributed Computing Copyright 2010 Herlihy, Kozlov, and Rajsbaum All rights reserved Maurice Herlihy Dmitry Kozlov Sergio Rajsbaum February 22, 2011 DRAFT 2 DRAFT Contents 1 Introduction 9 1.1 DecisionTasks .......................... 10 1.2 Communication.......................... 11 1.3 Failures .............................. 11 1.4 Timing............................... 12 1.4.1 ProcessesandProtocols . 12 1.5 ChapterNotes .......................... 14 2 Elements of Combinatorial Topology 15 2.1 Theobjectsandthemaps . 15 2.1.1 The Combinatorial View . 15 2.1.2 The Geometric View . 17 2.1.3 The Topological View . 18 2.2 Standardconstructions. 18 2.3 Chromaticcomplexes. 21 2.4 Simplicial models in Distributed Computing . 22 2.5 ChapterNotes .......................... 23 2.6 Exercises ............................. 23 3 Manifolds, Impossibility,DRAFT and Separation 25 3.1 ManifoldComplexes ....................... 25 3.2 ImmediateSnapshots. 28 3.3 ManifoldProtocols .. .. .. .. .. .. .. 34 3.4 SetAgreement .......................... 34 3.5 AnonymousProtocols . .. .. .. .. .. .. 38 3.6 WeakSymmetry-Breaking . 39 3.7 Anonymous Set Agreement versus Weak Symmetry Breaking 40 3.8 ChapterNotes .......................... 44 3.9 Exercises ............................. 44 3 4 CONTENTS 4 Connectivity 47 4.1 Consensus and Path-Connectivity . 47 4.2 Consensus in Asynchronous Read-Write Memory . 49 4.3 Set Agreement and Connectivity in Higher Dimensions . 53 4.4 Set Agreement and Read-Write memory . 59 4.4.1 Critical States . 63 4.5 ChapterNotes .......................... 64 4.6 Exercises ............................. 64 5 Colorless Tasks 67 5.1 Pseudospheres .......................... 68 5.2 ColorlessTasks .......................... 72 5.3 Wait-Free Read-Write Memory . 73 5.3.1 Read-Write Protocols and Pseudospheres . 73 5.3.2 Necessary and Sufficient Conditions . 75 5.4 Read-Write Memory with k-Set Agreement .
    [Show full text]
  • 1 Personal Data 2 Education 3 Research Interests 4 Academic Appointments
    CURRICULUM VITAE HAGIT ATTIYA Department of Computer Science, Technion Haifa 32000, ISRAEL (Updated: January 2021) 1 Personal Data Date and place of birth: February 16, 1962, Jerusalem, Israel. Israeli citizenship (I.d. # 5739025-4). Telephone: +972-4-8294365 [email protected] http://www.cs.technion.ac.il/˜hagit/ 2 Education • Ph.D. in Computer Science. Hebrew University, July 1987. • M.Sc. in Computer Science, cum laude. Hebrew University, June 1983. • B.Sc. in Mathematics (expanded) and Computer Science, cum laude. Hebrew University, June 1981. 3 Research Interests Distributed and parallel computing: synchronization primitives, fault-tolerance, agreement problems, ran- domization, timing-based algorithms; transactional memory; packet switches; performance analysis of dis- tributed servers. 4 Academic Appointments October 2015–September 2019: Executive Vice President for Academic Affairs, the Technion. August 2005–present: Professor, The Harry W. Labov and Charlotte Ullman Labov Academic Chair, Faculty of Computer Science, Technion. February 1997–July 2005: Associate Professor, Faculty of Computer Science, Technion. October 1990–February 1997: Senior lecturer (tenure: May 1994), Faculty of Computer Science, Technion. 1 September 1988–September 1990: Postdoctoral research associate with the Theory of Distributed Systems research group at the Laboratory for Computer Science, M.I.T. October 1987–August 1988: Instructor, Department of Computer Science, Tel-Aviv University. October 1983–September 1986: Research assistant, Department of Computer Science, Hebrew University. October 1981–September 1983: Teaching assistant, Department of Computer Science, Hebrew University. 5 Other Professional Employment August 2009–August 2010: Visiting professor at the Ecole´ Polytechnique Fed´ erale´ de Lausanne (EPFL), Switzerland. September 2001–September 2002: Research scientist at Dune Semiconductor Ltd.
    [Show full text]
  • Tight Bounds for K-Set Agreement Soma Chaudhuri Maurice Herlihy CRL 98/4 Nancy A
    TM Tight Bounds for k-Set Agreement Soma Chaudhuri Maurice Herlihy Nancy A. Lynch Mark R. Tuttle CRL 98/4 May 1998 Cambridge Research Laboratory The Cambridge Research Laboratory was founded in 1987 to advance the state of the art in both core computing and human-computerinteraction, and to use the knowledge so gained to support the Company’s corporate objectives. We believe this is best accomplished through interconnected pur- suits in technology creation, advanced systems engineering, and business development. We are ac- tively investigating scalable computing; mobile computing; vision-based human and scene sensing; speech interaction; computer-animated synthetic persona; intelligent information appliances; and the capture, coding, storage, indexing, retrieval, decoding, and rendering of multimedia data. We recognize and embrace a technology creation model which is characterized by three major phases: Freedom: The life blood of the Laboratory comes from the observations and imaginations of our research staff. It is here that challenging research problems are uncovered (through discussions with customers, through interactions with others in the Corporation, through other professional interac- tions, through reading, and the like) or that new ideas are born. For any such problem or idea, this phase culminates in the nucleation of a project team around a well articulated central research question and the outlining of a research plan. Focus: Once a team is formed, we aggressively pursue the creation of new technology based on the plan. This may involve direct collaboration with other technical professionals inside and outside the Corporation. This phase culminates in the demonstrable creation of new technology which may take any of a number of forms - a journal article, a technical talk, a working prototype, a patent application, or some combination of these.
    [Show full text]
  • A Complexity-Based Hierarchy for Multiprocessor Synchronization
    A Complexity-Based Hierarchy for Multiprocessor Synchronization Faith Ellen Rati Gelashvili Nir Shavit University of Toronto MIT MIT [email protected] [email protected] [email protected] Leqi Zhu University of Toronto [email protected] Abstract For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best ex- planation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply syn- chronization instructions to collections of arbitrary memory locations. We were surprised to realize that, when considering instructions applied to memory locations, the computability based hierarchy collapses. This leaves open the question of how to better capture the power of various synchronization instructions. In this paper, we provide an approach to answering this question. We present a hierarchy of synchro- nization instructions, classified by the space complexity necessary to solve consensus in an obstruction- free manner using these instructions. Our hierarchy provides a classification of combinations of known instructions that seems to fit with our intuition of how useful some are in practice, while questioning the effectiveness of others. In particular, we prove an essentially tight characterization of the power of buffered read and write instructions. Interestingly, we show a similar result for multi-location atomic assignments. 1 Introduction Herlihy’s Consensus Hierarchy [Her91] assigns a consensus number to each object, namely, the number of processes for which there is a wait-free binary consensus algorithm using only instances of this object and read-write registers.
    [Show full text]
  • SIGACT Viability
    SIGACT Name and Mission: SIGACT: SIGACT Algorithms & Computation Theory The primary mission of ACM SIGACT (Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory) is to foster and promote the discovery and dissemination of high quality research in the domain of theoretical computer science. The field of theoretical computer science is interpreted broadly so as to include algorithms, data structures, complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness. Work in this field is often distinguished by its emphasis on mathematical technique and rigor. Newsletters: Volume Issue Issue Date Number of Pages Actually Mailed 2014 45 01 March 2014 N/A 2013 44 04 December 2013 104 27-Dec-13 44 03 September 2013 96 30-Sep-13 44 02 June 2013 148 13-Jun-13 44 01 March 2013 116 18-Mar-13 2012 43 04 December 2012 140 29-Jan-13 43 03 September 2012 120 06-Sep-12 43 02 June 2012 144 25-Jun-12 43 01 March 2012 100 20-Mar-12 2011 42 04 December 2011 104 29-Dec-11 42 03 September 2011 108 29-Sep-11 42 02 June 2011 104 N/A 42 01 March 2011 140 23-Mar-11 2010 41 04 December 2010 128 15-Dec-10 41 03 September 2010 128 13-Sep-10 41 02 June 2010 92 17-Jun-10 41 01 March 2010 132 17-Mar-10 Membership: based on fiscal year dates 1st Year 2 + Years Total Year Professional
    [Show full text]
  • James Aspnes
    James Aspnes October 1st, 2021 Work address James Aspnes Yale University Department of Computer Science 39 Willow Road Guilford, CT USA Email: [email protected] URL: https://www.cs.yale.edu/homes/aspnes/ Phone: +1 203 533 9862 Home address 39 Willow Rd Guilford, CT 06437-1723 Degrees • PhD (CS) 1992, Carnegie-Mellon University. Thesis title: Wait-Free Consensus. Advisor: Steven Rudich. • SM (EECS) 1987, Massachusetts Institute of Technology. • SB (Mathematics) 1987, Massachusetts Institute of Technology. Experience • Yale University. Assistant Professor of Computer Science, 1993–1998; Associate Professor of Computer Science (term), 1998–2001; Associate Professor of Computer Science (tenured), 2001–2005; Professor of Com- puter Science, 2005–. • IBM Almaden Research Center. Visiting Scientist, 1992–1993. 1 Honors • ACM-EATCS Dijkstra Prize in Distributed Computing, 2020. • The Dylan Hixon ’88 Prize for Teaching Excellence in the Natural Sci- ences. Awarded by Yale College, 2000. • IBM Graduate Fellowship, 1991–1992. • NSF Graduate Fellowship, 1987–1990. • Phi Beta Kappa, 1987. Grants • NSF award CCF-1650596, EAGER: Concurrent Data Structures, 2016–2020. (PI, $265,044.) • NSF award CCF-1637385, AitF: The Fuzzy Log: A Unifying Abstrac- tion for the Theory and Practice of Distributed Systems, 2016–2019. (Co-PI, $600,000.) • NSF award CCF-0916389, AF: Small: Algorithms for Active Learning of Interaction Networks, 2009–2013. (Co-PI, $500,000.) • NSF award CNS-0435201, NeTS-NR: Design and Evaluation of Multi- homed Networks, 2004–2008. (Co-PI, $349,987.) • NSF award CNS-0305258, Distributed Tree Infrastructure for Peer-to- Peer Systems, 2003–2006. (PI, $300,000.) • NSF award CCR-0098078, Fault-Tolerant Distributed Resource Loca- tion, 2001–2004.
    [Show full text]