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 条

[1] Can a shared-memory model serve as a bridging model for parallel computation?
Gibbons, PB
Matias, Y
Ramachandran, V
THEORY OF COMPUTING SYSTEMS, 1999, 32 (03) : 327 - 359
[2] Can a shared-memory model serve as a bridging model for parallel computation?
Information Sciences Research Center, Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, United States
不详
不详
Theory Comput. Syst., 3 (327-359):
[3] A MODEL FOR ASYNCHRONOUS SHARED-MEMORY PARALLEL COMPUTATION
NISHIMURA, N
SIAM JOURNAL ON COMPUTING, 1994, 23 (06) : 1231 - 1252
[4] A hierarchical computation model for distributed shared-memory machines
Rauber, T
Rünger, G
NINTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2001, : 57 - 64
[5] DATA-STRUCTURES FOR PARALLEL COMPUTATION ON SHARED-MEMORY MACHINES
DEO, N
SUPERCOMPUTING /, 1989, 62 : 341 - 355
[6] Processing graphs with barrierless asynchronous parallel model on shared-memory systems
Luo, Le
Liu, Yi
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 106 : 641 - 652
[7] Grouping memory consistency model for parallel-multithreaded shared-memory multiprocessor systems
Wu, CC
Chen, C
INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1999, 10 (01): : 53 - 81
[8] A BRIDGING MODEL FOR PARALLEL COMPUTATION
VALIANT, LG
COMMUNICATIONS OF THE ACM, 1990, 33 (08) : 103 - 111
[9] CTL* Model Checking on a Shared-Memory Architecture
Inggs, Cornelia P.
Barringer, Howard
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 128 (03) : 107 - 123
[10] MEMORY MANAGEMENT FOR PARALLEL TASKS IN SHARED-MEMORY
LANGENDOEN, KG
MULLER, HL
VREE, WG
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 637 : 165 - 178

← 1 2 3 4 5 →