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 条

[21] Distributed, Shared-Memory Parallel Triangle Counting
Kanewala, Thejaka Amila
Zalewski, Marcin
Lumsdaine, Andrew
PROCEEDINGS OF THE PLATFORM FOR ADVANCED SCIENTIFIC COMPUTING CONFERENCE (PASC '18), 2017,
[22] PARALLEL CHOLESKY FACTORIZATION ON A SHARED-MEMORY MULTIPROCESSOR
GEORGE, A
HEATH, MT
LIU, J
LINEAR ALGEBRA AND ITS APPLICATIONS, 1986, 77 : 165 - 187
[23] Shared-Memory Parallel Maximal Clique Enumeration
Das, Apurba
Sanei-Mehri, Seyed-Vahid
Tirthapura, Srikanta
2018 IEEE 25TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2018, : 62 - 71
[24] A PARALLEL LINKED LIST FOR SHARED-MEMORY MULTIPROCESSORS
TANG, PY
YEW, PC
ZHU, CQ
PROCEEDINGS : THE THIRTEENTH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, 1989, : 130 - 135
[25] Correctness properties in a shared-memory parallel language
Caplain, G
JOURNAL OF THE ACM, 2002, 49 (06) : 785 - 827
[26] Parallel VLSI test in a shared-memory multiprocessor
Gil, C
Ortega, J
Montoya, MG
CONCURRENCY-PRACTICE AND EXPERIENCE, 2000, 12 (05): : 311 - 326
[27] SHARED-MEMORY PARALLEL PROGRAMMING IN C++
BECK, B
IEEE SOFTWARE, 1990, 7 (04) : 38 - 48
[28] Truss Decomposition on Shared-Memory Parallel Systems
Smith, Shaden
Liu, Xing
Ahmed, Nesreen K.
Tom, Ancy Sarah
Petrini, Fabrizio
Karypis, George
2017 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2017,
[29] Shared-Memory Parallel Maximal Biclique Enumeration
Das, Apurba
Tirthapura, Srikanta
2019 IEEE 26TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, AND ANALYTICS (HIPC), 2019, : 34 - 43
[30] Coarse-grained thread pipelining: A speculative parallel execution model for shared-memory multiprocessors
Kazi, IH
Lija, DJ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (09) : 952 - 966

← 1 2 3 4 5 →