Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Todd Mytkowicz"'
Autor:
Elizabeth Dinella, Todd Mytkowicz, Alexey Svyatkovskiy, Christian Bird, Mayur Naik, Shuvendu Lahiri
Publikováno v:
IEEE Transactions on Software Engineering. 49:1599-1614
In collaborative software development, program merging is the mechanism to integrate changes from multiple programmers. Merge algorithms in modern version control systems report a conflict when changes interfere textually. Merge conflicts require man
Using pre-trained language models to resolve textual and semantic merge conflicts (experience paper)
Publikováno v:
Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis.
Autor:
Abhinav Jangda, Jun Huang, Guodong Liu, Amir Hossein Nodehi Sabet, Saeed Maleki, Youshan Miao, Madanlal Musuvathi, Todd Mytkowicz, Olli Saarikivi
Publikováno v:
Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems.
Recent trend towards increasing large machine learning models require both training and inference tasks to be distributed. Considering the huge cost of training these models, it is imperative to unlock optimizations in computation and communication t
Autor:
Alexey Svyatkovskiy, Sarah Fakhoury, Negar Ghorbani, Todd Mytkowicz, Elizabeth Dinella, Christian Bird, Jinu Jang, Neel Sundaresan, Shuvendu K. Lahiri
Collaborative software development is an integral part of the modern software development life cycle, essential to the success of large-scale software projects. When multiple developers make concurrent changes around the same lines of code, a merge c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a99c46243c58fcf37fdee66295abe244
Autor:
Ed Chi, Todd Mytkowicz
Publikováno v:
Proceedings of the International AAAI Conference on Web and Social Media. 2:178-179
Given the rise in popularity of social tagging systems, it seems only natural to ask how efficient is the organically evolved tagging vocabulary in describing any underlying document objects? Does this distributed process really provide a way to circ
Autor:
Jacob Nelson, Madanlal Musuvathi, Todd Mytkowicz, Zixian Cai, Zhengyang Liu, Olli Saarikivi, Saeed Maleki
Publikováno v:
PPoPP
Collective communication algorithms are an important component of distributed computation. Indeed, in the case of deep-learning, collective communication is the Amdahl's bottleneck of data-parallel training. This paper introduces SCCL (for Synthesize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb60d6282d0c675b6b5ade7d73a91462
http://arxiv.org/abs/2008.08708
http://arxiv.org/abs/2008.08708
Publikováno v:
Proceedings of the ACM on Programming Languages. 1:1-27
Heterogeneous hardware is central to modern advances in performance and efficiency. Mainstream programming models for heterogeneous architectures, however, sacrifice safety and expressiveness in favor of low-level control over performance details. Th
Autor:
Mike Barnett, Haibo Lin, Guoqing Harry Xu, Madan Musuvathi, Margus Veanes, Ben Zorn, Todd Mytkowicz, Huan He
Publikováno v:
SOSP
Multilingual data-parallel pipelines, such as Microsoft's Scope and Apache Spark, are widely used in real-world analytical tasks. While the involvement of multiple languages (often including both managed and native languages) provides much convenienc
Autor:
Madanlal Musuvathi, Todd Mytkowicz, Roshan Dathathri, Kristin E. Lauter, Olli Saarikivi, Hao Chen, Saeed Maleki, Kim Laine
Publikováno v:
PLDI
Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations on encrypted data without requiring a secret key. Recent cryptographic advances have pushed FHE into the realm of practical applications. However, progra
Publikováno v:
Communications of the ACM. 59:85-92
This paper proposes an efficient parallel algorithm for an important class of dynamic programming problems that includes Viterbi, Needleman--Wunsch, Smith--Waterman, and Longest Common Subsequence. In dynamic programming, the subproblems that do not