Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

被引：0

作者：

P. B. Gibbons

Y. Matias

V. Ramachandran

机构：

[1] Information Sciences Research Center,

[2] Bell Laboratories (Lucent Technologies),undefined

[3] 600 Mountain Avenue,undefined

[4] Murray Hill,undefined

[5] NJ 07974,undefined

[6] USA gibbons@research.bell-labs.com ,undefined

[7] Department of Computer Sciences,undefined

[8] University of Texas at Austin,undefined

[9] Austin,undefined

[10] TX 78712,undefined

[11] USA vlr@cs.utexas.edu,undefined

[12] Current address: Tel-Aviv University,undefined

[13] Ramat Aviv,undefined

[14] Tel-Aviv 69978,undefined

[15] Israel. matias@math.tau.ac.il ,undefined

来源：

Theory of Computing Systems | 1999年 / 32卷

关键词：

Shared Memory; Directed Acyclic Graph; Model Serve; Original Program; Bridge Model;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, and they result when one thread updates a location in shared memory while another thread is concurrently accessing the location. We have implemented a provably efficient determinacy-race detector for Cilk, an algorithmic multithreaded programming language. If a Cilk program is run on a given input data set, our debugging tool, which we call the ``Nondeterminator,'' either determines at least one location in the program that is subject to a determinacy race, or else it certifies that the program is race free when run on the data set.

引用

页码：327 / 359

页数：32

共 50 条

[11] CTL* model checking on a shared-memory architecture
Cornelia P. Inggs
Howard Barringer
Formal Methods in System Design, 2006, 29 : 135 - 155
[12] CTL model checking on a shared-memory architecture
Inggs, Cornelia P.
Barringer, Howard
FORMAL METHODS IN SYSTEM DESIGN, 2006, 29 (02) : 135 - 155
[13] Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy
Gyulassy, Attila
Bremer, Peer-Timo
Pascucci, Valerio
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2019, 25 (01) : 1183 - 1192
[14] New relaxed memory consistency model for shared-memory multiprocessors with parallel-multithreaded processing elements
Natl Chiao Tung Univ, Hsinchu, Taiwan
J Inf Sci Eng, 4 (785-808):
[15] A new relaxed memory consistency model for shared-memory multiprocessors with parallel-multithreaded processing elements
Wu, CC
Chen, C
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1998, 14 (04) : 785 - 808
[16] Model Checking Parameterized Asynchronous Shared-Memory Systems
Durand-Gasselin, Antoine
Esparza, Javier
Ganty, Pierre
Majumdar, Rupak
COMPUTER AIDED VERIFICATION, PT I, 2015, 9206 : 67 - 84
[17] Model checking parameterized asynchronous shared-memory systems
Durand-Gasselin, Antoine
Esparza, Javier
Ganty, Pierre
Majumdar, Rupak
FORMAL METHODS IN SYSTEM DESIGN, 2017, 50 (2-3) : 140 - 167
[18] Model checking parameterized asynchronous shared-memory systems
Antoine Durand-Gasselin
Javier Esparza
Pierre Ganty
Rupak Majumdar
Formal Methods in System Design, 2017, 50 : 140 - 167
[19] Experimental evaluation of QSM, a simple shared-memory model
Grayson, B
Dahlin, M
Ramachandran, V
IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 130 - 136
[20] Shared-Memory Alternatives for Parallel Image Reconstruction
Torres, Felipe
de la Fuente, Francisco
Rannou, Fernando R.
2011 IEEE NUCLEAR SCIENCE SYMPOSIUM AND MEDICAL IMAGING CONFERENCE (NSS/MIC), 2011, : 2541 - 2544

← 1 2 3 4 5 →