On the public citation graph

Paging tradeoffs in distributed-shared-memory multiprocessors

https://doi.org/10.1007/bf00128100
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0743-7315(92)90014-eopenalex-snapshot
Gang scheduling performance benefits for fine-grain synchronization
inferredcites →https://doi.org/10.1063/1.4823162openalex-snapshot
Integrated Pvm Framework Supports Heterogeneous Network Computing
inferredcites →https://doi.org/10.1109/12.21127openalex-snapshot
Speedup versus efficiency in parallel systems
inferredcites →https://doi.org/10.1109/40.342018openalex-snapshot
A case for NOW (Networks of Workstations)
inferredcites →https://doi.org/10.1109/cmpcon.1993.289731openalex-snapshot
Memory servers for multicomputers
inferredcites →https://doi.org/10.1109/isca.1988.5238openalex-snapshot
An evaluation of directory schemes for cache coherence
inferredcites →https://doi.org/10.1145/130823.130824openalex-snapshot
SPLASH
inferredcites →https://doi.org/10.1145/166955.166979openalex-snapshot
The Wisconsin Wind Tunnel: virtual prototyping of parallel computers
inferredcites →https://doi.org/10.1145/169627.169673openalex-snapshot
Distributed computing feasibility in a non-dedicated homogeneous distributed system
inferredcites →https://doi.org/10.1145/285930.285995openalex-snapshot
An evaluation of directory schemes for cache coherence
inferredcites →https://doi.org/10.1145/29868.32979openalex-snapshot
Footprints in the cache
inferredcites →https://doi.org/10.1145/357980.357997openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1145/358818.358823openalex-snapshot
Medusa
inferredcites →https://doi.org/10.1145/363095.363141openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1145/98457.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1177/109434209100500306openalex-snapshot
The NAS Parallel Benchmarks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1099-1425(200011/12)3:6<355::aid-jos55>3.0.co;2-vopenalex-snapshot
On-line and off-line preemptive two-machine job shop scheduling
inferred← citeshttps://doi.org/10.1007/3-540-36569-9_40openalex-snapshot
Minimizing Paging Tradeoffs Applying Coscheduling Techniques in a Linux Cluster
inferred← citeshttps://doi.org/10.1007/3-540-45417-9_32openalex-snapshot
MemTo: A Memory Monitoring Tool for a Linux Cluster
inferred← citeshttps://doi.org/10.1007/3-540-45540-x_4openalex-snapshot
Coscheduling under Memory Constraints in a NOW Environment
inferred← citeshttps://doi.org/10.1007/3-540-45825-5_30openalex-snapshot
Adjusting the Lengths of Time Slices when Scheduling PVM Jobs with High Memory Requirements
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_17openalex-snapshot
Memory usage in the LANL CM-5 workload
inferred← citeshttps://doi.org/10.1007/s10586-007-0047-2openalex-snapshot
Benchmarking the effects of operating system interference on extreme-scale parallel machines
inferred← citeshttps://doi.org/10.1109/clustr.2006.311846openalex-snapshot
The Influence of Operating Systems on the Performance of Collective Operations at Extreme Scale
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327942openalex-snapshot
Parallel network RAM: effectively utilizing global cluster memory for large data-intensive parallel programs
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845971openalex-snapshot
Gang scheduling with memory considerations
inferred← citeshttps://doi.org/10.1109/tpds.2006.10openalex-snapshot
Effectively utilizing global cluster memory for large data-intensive parallel programs
inferred← citeshttps://doi.org/10.1142/9781860948923_0013openalex-snapshot
Stochastic Analysis of Resource Allocation in Parallel Processing Systems
inferred← citeshttps://doi.org/10.1145/1048935.1050161openalex-snapshot
Improving the Scalability of Parallel Jobs by adding Parallel Awareness to the Operating System
inferred← citeshttps://doi.org/10.1145/309746.309751openalex-snapshot
The impact of job memory requirements on gang-scheduling performance
inferred← citeshttps://doi.org/10.1177/1094342003017001004openalex-snapshot
Dealing with Memory Constraints in a Non-Dedicated Linux Cluster
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.