Author image not provided
 Joseph Devietti

 homepage
 deviettiatcis.upenn.edu

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article19.60
Citation Count490
Publication count25
Publication years2007-2019
Available for download19
Average downloads per article601.37
Downloads (cumulative)11,426
Downloads (12 Months)1,461
Downloads (6 Weeks)133
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


25 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 25
Result page: 1 2

Sort by:

1 published by ACM
April 2019 ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 155,   Downloads (Overall): 155

Full text available: PDFPDF
Deterministic multithreading (DMT) fundamentally requires total, deterministic ordering of synchronization operations on each synchronization variable, i.e. a partial ordering over all synchronization operations. In practice, prior DMT systems totally order all synchronization operations, regardless of synchronization variable; the result is severe performance degradation for highly concurrent applications using fine-grained synchronization. ...
Keywords: determinism, multi-threading, performance, speculative execution

2 published by ACM
June 2018 PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 23,   Downloads (12 Months): 206,   Downloads (Overall): 348

Full text available: PDFPDF
As GPUs have become an integral part of nearly every pro- cessor, GPU programming has become increasingly popular. GPU programming requires a combination of extreme levels of parallelism and low-level programming, making it easy for concurrency bugs such as data races to arise. These con- currency bugs can be extremely ...
Keywords: GPUs, Nvidia CUDA, data race detection
Also published in:
December 2018  ACM SIGPLAN Notices - PLDI '18: Volume 53 Issue 4, April 2018

3 published by ACM
March 2018 ASPLOS '18: Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 162,   Downloads (Overall): 289

Full text available: PDFPDF
Correctly synchronizing multithreaded programs is challenging and errors can lead to program failures such as atomicity violations. Existing strong memory consistency models rule out some possible failures, but are limited by depending on programmer-defined locking code. We present the new Ordering-Free Region (OFR) serializability consistency model that ensures atomicity for ...
Keywords: C, C++, atomicity, data races, region serializability
Also published in:
November 2018  ACM SIGPLAN Notices - ASPLOS '18: Volume 53 Issue 2, February 2018

4
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 43

Full text available: PDFPDF
A program is said to have a determinacy race if logically parallel parts of a program access the same memory location and one of the accesses is a write. These races are generally bugs in the program since they lead to non-deterministic program behavior --- different schedules of the program ...

5 published by ACM
October 2017 MICRO-50 '17: Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 91,   Downloads (Overall): 269

Full text available: PDFPDF
Cache contention in the form of false sharing and true sharing arises when threads overshare cache lines at high frequency. Such oversharing can reduce or negate the performance benefits of parallel execution. Prior systems for detecting and repairing cache contention lack efficiency in detection or repair, contain subtle memory consistency ...
Keywords: C, C++, false sharing, memory consistency, performance counters

6 published by ACM
October 2017 MICRO-50 '17: Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 63,   Downloads (Overall): 196

Full text available: PDFPDF
Data race detection is a useful dynamic analysis for multithreaded programs that is a key building block in record-and-replay, enforcing strong consistency models, and detecting concurrency bugs. Existing software race detectors are precise but slow, and hardware support for precise data race detection relies on assumptions like type safety that ...
Keywords: data race detection, hardware support, multithreaded programming

7 published by ACM
October 2017 Proceedings of the ACM on Programming Languages: Volume 1 Issue OOPSLA, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 159,   Downloads (Overall): 362

Full text available: PDFPDF
Achieving determinism on real software systems remains difficult. Even a batch-processing job, whose task is to map input bits to output bits, risks nondeterminism from thread scheduling, system calls, CPU instructions, and leakage of environmental information such as date or CPU model. In this work, we present a system for ...
Keywords: Haskell, concurrency, deterministic parallelism

8 published by ACM
June 2017 PLDI 2017: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 6,   Downloads (12 Months): 67,   Downloads (Overall): 291

Full text available: PDFPDF
GPU programming models enable and encourage massively parallel programming with over a million threads, requiring extreme parallelism to achieve good performance. Massive parallelism brings significant correctness challenges by increasing the possibility for bugs as the number of thread interleavings balloons. Conventional dynamic safety analyses struggle to run at this scale. ...
Keywords: CUDA, GPUs, data race detection
Also published in:
September 2017  ACM SIGPLAN Notices - PLDI '17: Volume 52 Issue 6, June 2017

9 published by ACM
January 2017 CPP 2017: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 6,   Downloads (12 Months): 46,   Downloads (Overall): 191

Full text available: PDFPDF
Writing race-free concurrent code is notoriously difficult, and data races can result in bugs that are difficult to isolate and reproduce. Dynamic race detection can catch data races that cannot (easily) be detected statically. One approach to dynamic race detection is to instrument the potentially racy code with operations that ...
Keywords: Dynamic Race Detection, Interactive Theorem Proving

10 published by ACM
June 2016 PLDI '16: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 13,   Downloads (12 Months): 120,   Downloads (Overall): 697

Full text available: PDFPDF
As ever more computation shifts onto multicore architectures, it is increasingly critical to find effective ways of dealing with multithreaded performance bugs like true and false sharing. Previous approaches to fixing false sharing in unmanaged languages have employed highly-invasive runtime program modifications. We observe that managed language runtimes, with garbage ...
Keywords: Java, cache coherence, false sharing
Also published in:
August 2016  ACM SIGPLAN Notices - PLDI '16: Volume 51 Issue 6, June 2016

11
December 2015 RTSS '15: Proceedings of the 2015 IEEE Real-Time Systems Symposium (RTSS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Autonomous vehicles promise significant benefits to society, from reduced accident rates to greater mobility for the elderly. The biggest challenge in the design of autonomous vehicles comes from the uncertainty of the environment in which they will operate. Their control algorithms must be able to cope with driving events that ...

12
December 2015 RTSS '15: Proceedings of the 2015 IEEE Real-Time Systems Symposium (RTSS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Control software of autonomous robots has stringent real-time requirements that must be met to achieve the control objectives. One source of variability in the performance of a control system is the execution time and accuracy of the state estimator that provides the controller with state information. This estimator is typically ...

13 published by ACM
April 2015 EuroSys '15: Proceedings of the Tenth European Conference on Computer Systems
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Downloads (Overall): 467

Full text available: PDFPDF
We present Consequence, a deterministic multi-threading library. Consequence achieves deterministic execution via store buffering and strict ordering of synchronization operations. To ensure high performance under a wide variety of conditions, the ordering of synch operations is based on a deterministic clock [25], and store buffering is implemented using version-controlled memory ...

14 published by ACM
March 2013 ASPLOS '13: Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 3,   Downloads (12 Months): 38,   Downloads (Overall): 878

Full text available: PDFPDF
Nondeterminism is a key challenge in developing multithreaded applications. Even with the same input, each execution of a multithreaded program may produce a different output. This behavior complicates debugging and limits one's ability to test for correctness. This non-reproducibility situation is aggravated on massively parallel architectures like graphics processing units ...
Keywords: deterministic parallelism, gpu
Also published in:
March 2013  ACM SIGARCH Computer Architecture News - ASPLOS '13: Volume 41 Issue 1, March 2013 April 2013  ACM SIGPLAN Notices - ASPLOS '13: Volume 48 Issue 4, April 2013

15
June 2012 ISCA '12: Proceedings of the 39th Annual International Symposium on Computer Architecture
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 401

Full text available: PDFPDF
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforcing both atomicity and determinism. Unfortunately, existing software-only dynamic race detectors are precise but slow; proposals with hardware support offer higher performance but are imprecise. Both precision ...
Also published in:
September 2012  ACM SIGARCH Computer Architecture News - ISCA '12: Volume 40 Issue 3, June 2012

16
January 2012
Bibliometrics:
Citation Count: 0

Nondeterminism is one of the main reasons that parallel programming is so difficult. Bugs can vanish when programs are rerun or run under a debugger, thwarting attempts at their removal. Stress-testing is a common practice to flush out rare defects though it consumes extensive processing power and offers no real ...

17 published by ACM
March 2011 ASPLOS XVI: Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Publisher: ACM
Bibliometrics:
Citation Count: 31
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Downloads (Overall): 607

Full text available: PDFPDF
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic multiprocessor architectures as well as compiler and runtime systems that enforce determinism in current hardware. Such work has incidentally imposed strong memory-ordering properties. Historically, memory ordering has been relaxed in favor ...
Keywords: determinism, multicore, parallel programming, relaxed consistency
Also published in:
March 2011  ACM SIGARCH Computer Architecture News - ASPLOS '11: Volume 39 Issue 1, March 2011 March 2011  ACM SIGPLAN Notices - ASPLOS '11: Volume 46 Issue 3, March 2011

18 published by ACM
March 2010 ACM SIGARCH Computer Architecture News - ASPLOS '10: Volume 38 Issue 1, March 2010
Publisher: ACM
Bibliometrics:
Citation Count: 107
Downloads (6 Weeks): 2,   Downloads (12 Months): 49,   Downloads (Overall): 1,141

Full text available: PDFPDF
The behavior of a multithreaded program does not depend only on its inputs. Scheduling, memory reordering, timing, and low-level hardware effects all introduce nondeterminism in the execution of multithreaded programs. This severely complicates many tasks, including debugging, testing, and automatic replication. In this work, we avoid these complications by eliminating ...
Keywords: determinism, compilers, multicore, multithreading
Also published in:
March 2010  ACM SIGPLAN Notices - ASPLOS '10: Volume 45 Issue 3, March 2010 March 2010  ASPLOS XV: Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems

19
January 2010 IEEE Micro: Volume 30 Issue 1, January 2010
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 7

Shared-memory multicore and multiprocessor systems are nondeterministic, which frustrates debugging and complicates testing of multithreaded code, impeding parallel programming's widespread adoption. The authors propose fully deterministic shared-memory multiprocessing that not only enhances debugging by offering repeatability by default, but also improves the quality of testing and the deployment of production ...
Keywords: debugging, multiprocessors, determinism, debugging, reliability, reliability, determinism, multiprocessors

20
March 2009 HotPar'09: Proceedings of the First USENIX conference on Hot topics in parallelism
Publisher: USENIX Association
Bibliometrics:
Citation Count: 11

In this position paper we argue that concurrency errors should be fail-stop. We want to put concurrency errors in the same category as division-by-zero, segmentation fault in unmanaged languages and cast exceptions in managed languages. This would make nondeterminism in multithreaded execution be much more manageable. Concurrency exceptions would improve ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us