On the public citation graph
Machines and models for parallel computing
0 signed · 69 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.4330020404openalex-snapshot
PVM: A framework for parallel distributed computing
inferredcites →https://doi.org/10.1007/3-540-06859-7_145openalex-snapshot
First version of a data flow procedure language
inferredcites →https://doi.org/10.1007/3-540-10283-3_1openalex-snapshot
The DDC Ada compiler development method
inferredcites →https://doi.org/10.1007/3-540-10699-5_103openalex-snapshot
An operational semantics for a language with early completion data structures
inferredcites →https://doi.org/10.1007/3-540-15975-4_27openalex-snapshot
Data flow graph optimization in if1
inferredcites →https://doi.org/10.1007/3-540-18923-8_15openalex-snapshot
Two fundamental issues in multiprocessing
inferredcites →https://doi.org/10.1007/3540543961_26openalex-snapshot
M-structures: Extending a parallel, non-strict, functional language with state
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1016/0066-4138(69)90005-6openalex-snapshot
On the formal description of PL/I
inferredcites →https://doi.org/10.1016/0743-7315(84)90008-xopenalex-snapshot
Resource managers in functional programming
inferredcites →https://doi.org/10.1016/0743-7315(92)90047-qopenalex-snapshot
The weakest memory-access order
inferredcites →https://doi.org/10.1109/2.156381openalex-snapshot
DDM-a cache-only memory architecture
inferredcites →https://doi.org/10.1109/2.84896openalex-snapshot
Computer technology and architecture: an evolving interaction
inferredcites →https://doi.org/10.1109/71.86111openalex-snapshot
Compiling communication-efficient programs for massively parallel machines
inferredcites →https://doi.org/10.1109/cmpcon.1993.289655openalex-snapshot
Overview of the START(*T) multithreaded computer
inferredcites →https://doi.org/10.1109/fmpc.1992.234877openalex-snapshot
Connection Machine model CM-5 system overview
inferredcites →https://doi.org/10.1109/fmpc.1992.234910openalex-snapshot
A compiler for a massively parallel distributed memory MIMD computer
inferredcites →https://doi.org/10.1109/fmpc.1992.234911openalex-snapshot
Compiling Fortran 77D and 90D for MIMD distributed-memory machines
inferredcites →https://doi.org/10.1109/superc.1988.44674openalex-snapshot
An efficient pipelined dataflow processor architecture
inferredcites →https://doi.org/10.1109/superc.1992.236679openalex-snapshot
Efficient parallel programming with Linda
inferredcites →https://doi.org/10.1109/superc.1992.236702openalex-snapshot
Implementation of a parallel unstructured Euler solver on shared and distributed memory architectures
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/tc.1984.5009332openalex-snapshot
Modeling the Weather with a Data Flow Supercomputer
inferredcites →https://doi.org/10.1142/9789814537742openalex-snapshot
Scientific Applications of the Connection Machine
inferredcites →https://doi.org/10.1145/1014192.802449openalex-snapshot
Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing
inferredcites →https://doi.org/10.1145/1115880.1115883openalex-snapshot
The contour model of block structured processes
inferredcites →https://doi.org/10.1145/1344551.1344561openalex-snapshot
Closure properties of interconnections of determinate systems
inferredcites →https://doi.org/10.1145/155090.155098openalex-snapshot
Dependence-based program analysis
inferredcites →https://doi.org/10.1145/285930.285985openalex-snapshot
Very long instruction work architectures and the ELI-512
inferredcites →https://doi.org/10.1145/325096.325132openalex-snapshot
The directory-based cache coherence protocol for the DASH multiprocessor
inferredcites →https://doi.org/10.1145/357980.357993openalex-snapshot
Programming semantics for multiprogrammed computations
inferredcites →https://doi.org/10.1145/358527.358540openalex-snapshot
A sublinear additive sieve for finding prime number
inferredcites →https://doi.org/10.1145/361598.361623openalex-snapshot
On the criteria to be used in decomposing systems into modules
inferredcites →https://doi.org/10.1145/363095.363139openalex-snapshot
Virtual memory, processes, and sharing in MULTICS
inferredcites →https://doi.org/10.1145/365230.365252openalex-snapshot
Programming semantics for multiprogrammed computations
inferredcites →https://doi.org/10.1145/62115.62121openalex-snapshot
Compiling Fortran 8x array features for the connection machine computer system
inferredcites →https://doi.org/10.1145/6513.6514openalex-snapshot
Cache coherence protocols: evaluation using a multiprocessor simulation model
inferredcites →https://doi.org/10.1145/800046.801649openalex-snapshot
Very Long Instruction Word architectures and the ELI-512
inferredcites →https://doi.org/10.1145/800223.806766openalex-snapshot
The semantic elegance of applicative languages
inferredcites →https://doi.org/10.1145/99370.99388openalex-snapshot
P-TAC: a parallel intermediate language
inferredcites →https://doi.org/10.5555/147877.148000openalex-snapshot
Efficient parallel programming with Linda
inferredcites →https://doi.org/10.5555/62972.63019openalex-snapshot
An efficient pipelined dataflow processor architecture
inferredcites →https://doi.org/10.7551/mitpress/5239.003.0005openalex-snapshot
HEP Architecture, Programming and Performance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_9openalex-snapshot
Dynamic Task Scheduling with Precedence Constraints and Communication Delays
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_13openalex-snapshot
On a technology of design and analysis of dataflow programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-4489-0_16openalex-snapshot
The Nop Parallel Programming Model
inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_40openalex-snapshot
An Extended ANSI C for Multimedia Processing
inferred← citeshttps://doi.org/10.1007/bfb0057916openalex-snapshot
Synchronizing communication primitives for a shared memory programming model
inferred← citeshttps://doi.org/10.1016/s0167-739x(00)00055-8openalex-snapshot
A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
inferred← citeshttps://doi.org/10.1023/a:1007529200051openalex-snapshot
Parallel Logic Programming for Problem Solving
inferred← citeshttps://doi.org/10.1109/pact.1998.727177openalex-snapshot
General parallel computation can be performed with a cycle-free heap
inferred← citeshttps://doi.org/10.5555/522344.825702openalex-snapshot
General parallel computation can be performed with a cycle-free heap
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.