On the public citation graph

Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

0 signed · 35 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.1007/3-540-08755-9_3openalex-snapshot
Computer organization and architecture
inferredcites →https://doi.org/10.1016/0967-0661(93)90237-lopenalex-snapshot
Introduction to parallel computing
inferredcites →https://doi.org/10.1109/12.55693openalex-snapshot
Dynamic processor self-scheduling for general parallel nested loops
inferredcites →https://doi.org/10.1109/32.21760openalex-snapshot
Design tradeoffs for process scheduling in shared memory multiprocessor systems
inferredcites →https://doi.org/10.1109/71.205655openalex-snapshot
Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers
inferredcites →https://doi.org/10.1109/dmcc.1990.556310openalex-snapshot
A Distributed and Adaptive Dynamic Load Balancing Scheme for Parallel Processing of Medium-Grain Tasks
inferredcites →https://doi.org/10.1109/dmcc.1991.633108openalex-snapshot
Probabilistic Analysis of the Optimal Efficiency of the Multi-Level Dynamic Load Balancing Scheme
inferredcites →https://doi.org/10.1109/hicss.1993.284074openalex-snapshot
Scheduling non-uniform parallel loops on distributed memory machines
inferredcites →https://doi.org/10.1109/superc.1990.130115openalex-snapshot
Heuristic methods for dynamic load balancing in a message-passing supercomputer
inferredcites →https://doi.org/10.1109/tc.1983.1676201openalex-snapshot
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
inferredcites →https://doi.org/10.1109/tse.1985.231547openalex-snapshot
Allocating Independent Subtasks on Parallel Processors
inferredcites →https://doi.org/10.1145/135226.135232openalex-snapshot
Factoring: a method for scheduling parallel loops
inferredcites →https://doi.org/10.1145/169627.169841openalex-snapshot
Self-scheduling on distributed-memory machines
inferredcites →https://doi.org/10.1145/255129.255155openalex-snapshot
Compiler techniques for data synchronization in nested parallel loops
inferredcites →https://doi.org/10.1145/77726.255155openalex-snapshot
Compiler techniques for data synchronization in nested parallel loops
inferredcites →https://doi.org/10.5555/110382.110620openalex-snapshot
Heuristic methods for dynamic load balancing in a message-passing supercomputer

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0111openalex-snapshot
Managing the Overall Balance of Operating System Threads on a Multiprocessor Using Automatic Self-Allocating Threads (ASAT)
inferred← citeshttps://doi.org/10.1007/11424758_30openalex-snapshot
A New Carried-Dependence Self-scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_13openalex-snapshot
Scheduling at Twilight the EasyWay
inferred← citeshttps://doi.org/10.1007/3-540-45993-6_12openalex-snapshot
Multiple-Robot Motion Planning = Parallel Processing + Geometry
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_7openalex-snapshot
Divisible Loads
inferred← citeshttps://doi.org/10.1007/978-3-540-46642-0_23openalex-snapshot
Affinity-Based Self Scheduling for Software Shared Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-35606-3_3openalex-snapshot
Knowledge-Based Adaptive Self-Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-662-04303-5_6openalex-snapshot
Management of Resources in Parallel Systems
inferred← citeshttps://doi.org/10.1007/s002240010013openalex-snapshot
On Scheduling Parallel Tasks at Twilight
inferred← citeshttps://doi.org/10.1007/s10951-009-0138-4openalex-snapshot
Adaptive statistical scheduling of divisible workloads in heterogeneous systems
inferred← citeshttps://doi.org/10.1109/71.569656openalex-snapshot
Adaptively scheduling parallel loops in distributed shared-memory systems
inferred← citeshttps://doi.org/10.1109/icpads.1998.741167openalex-snapshot
IPLS: an intelligent parallel loop scheduling for multiprocessor systems
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00067openalex-snapshot
A Hybrid Scheduling Scheme for Parallel Loops
inferred← citeshttps://doi.org/10.1109/mlhpc49564.2019.00009openalex-snapshot
Scheduling Optimization of Parallel Linear Algebra Algorithms Using Supervised Learning
inferred← citeshttps://doi.org/10.1109/spdp.1996.570341openalex-snapshot
An adaptive loop scheduling algorithm on shared-memory systems
inferred← citeshttps://doi.org/10.1142/s0129054101000503openalex-snapshot
LOAD BALANCING IN HOME-BASED SOFTWARE DSMS
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5376openalex-snapshot
Optimizing the Performance of Multi-threaded Linear Algebra Libraries Based on Task Granularity
inferred← citeshttps://doi.org/10.6688/jise.2015.31.6.7openalex-snapshot
Fault Tolerant Scheduling for Parallel Loops on Shared Memory Systems
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.