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 条

[41] Designing a standardized model for a shared-memory multiprocessor computing system
Nikol'skii, VA
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2001, 35 (02) : 47 - 51
[42] BASIC PARALLEL ALGORITHMIC TECHNIQUES FOR SHARED-MEMORY MACHINES
ALBACEA, EA
AUSTRALIAN COMPUTER JOURNAL, 1995, 27 (02): : 51 - 61
[43] Adaptive Space-Shared Scheduling for Shared-Memory Parallel Programs
Cho, Younghyun
Oh, Surim
Egger, Bernhard
JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, JSSPP 2016, 2017, 10353 : 158 - 177
[44] Efficient shared-memory support for parallel graph reduction
Bennett, AJ
Kelly, PHJ
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1997, 12 (06): : 481 - 503
[45] Experiences implementing a parallel ATMS on a shared-memory multiprocessor
1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):
[46] PARALLEL SPARSE QR FACTORIZATION ON SHARED-MEMORY ARCHITECTURES
MATSTOMS, P
PARALLEL COMPUTING, 1995, 21 (03) : 473 - 486
[47] A Flexible Shared-Memory Parallel Mesh Adaptation Framework
Gnam, Lukas
Manstetten, Paul
Quell, Michael
Rupp, Karl
Selberherr, Siegfried
Weinbub, Josef
2019 19TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ITS APPLICATIONS (ICCSA 2019), 2019, : 158 - 165
[48] Efficient shared-memory support for parallel graph reduction
Bennett, Andrew J.
Kelly, Paul H.J.
Future Generation Computer Systems, 1997, 12 (06): : 481 - 503
[49] Parallel classification for data mining on shared-memory multiprocessors
Zaki, MJ
Ho, CT
Agrawal, R
15TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 1999, : 198 - 205
[50] Parallel Data Distribution Management on Shared-memory Multiprocessors
Marzolla, Moreno
D'angelo, Gabriele
ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 2020, 30 (01):

← 1 2 3 4 5 →