FastTrack: Efficient and Precise Dynamic Race Detection.
Multithreaded programs are notoriously prone to race conditions. Prior work developed precise dynamic race detectors that never report false alarms. However, these checkers employ expensive data structures, such as vector clocks (VCs), that result in significant performance overhead. This paper expl...
| Publicado en: | Communications of the ACM Vol. 53; no. 11; pp. 93 - 102 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Nov2010
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=55063024&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 55063024 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Nov2010 vid: 53 iid: 11 pid: 68 pub: Association for Computing Machinery artinfo: ui: 55063024 10.1145/1839676.1839699 ppf: 93 ppct: 9 formats: tig: atl: FastTrack: Efficient and Precise Dynamic Race Detection. aug: au: Flanagan, Cormac Freund, Stephen N. affil: Computer Science Department, University of California, Santa Cruz, Santa Cruz, CA. Computer Science Department, Williams College, Williamstown, MA. su: Parallel programs (Computer programs) Vector analysis Data analysis Acquisition of data Computer programming Algorithm research sug: subj: Parallel programs (Computer programs) Vector analysis Data analysis Acquisition of data Computer programming Algorithm research ab: Multithreaded programs are notoriously prone to race conditions. Prior work developed precise dynamic race detectors that never report false alarms. However, these checkers employ expensive data structures, such as vector clocks (VCs), that result in significant performance overhead. This paper exploits the insight that the full generality of VCs is not necessary in most cases. That is, we can replace VCs with an adaptive lightweight representation that, for almost all operations of the target program, requires constant space and supports constant-time operations. Experimental results show that the resulting race detection algorithm is over twice as fast as prior precise race detectors, with no loss of precision. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2010 holdings: @attributes: islocal: N |
|---|