On the public citation graph
Multiprocessor join scheduling
0 signed · 21 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.1109/icde.1988.105473openalex-snapshot
Scheduling of page fetches in join operations using B/sub c/-trees
inferredcites →https://doi.org/10.1109/icde.1989.47209openalex-snapshot
Processor scheduling for multiprocessor joins
inferredcites →https://doi.org/10.1109/t-c.1975.224171openalex-snapshot
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
inferredcites →https://doi.org/10.1109/tc.1972.5008918openalex-snapshot
Optimal Scheduling Strategies in a Multiprocessor System
inferredcites →https://doi.org/10.1109/tc.1973.5009153openalex-snapshot
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
inferredcites →https://doi.org/10.1109/tc.1987.5009446openalex-snapshot
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
inferredcites →https://doi.org/10.1145/361604.361619openalex-snapshot
A comparison of list schedules for parallel processing systems
inferredcites →https://doi.org/10.1145/63039.63042openalex-snapshot
Random number generators: good ones are hard to find
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-oopenalex-snapshot
Parallel join for IBGF partitioned relational databases
inferred← citeshttps://doi.org/10.1007/s10479-024-05890-0openalex-snapshot
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00139-0openalex-snapshot
How to survive while visiting a graph
inferred← citeshttps://doi.org/10.1109/icpp.2006.56openalex-snapshot
On Creating Efficient Object-relational Views of Scientific Datasets
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846013openalex-snapshot
Optimizing retrieval and processing of multi-dimensional scientific datasets
inferred← citeshttps://doi.org/10.1109/ssdm.1998.688106openalex-snapshot
Scalable, parallel, scientific databases
inferred← citeshttps://doi.org/10.1142/s0129626403001264openalex-snapshot
DATABASE SUPPORT FOR DATA-DRIVEN SCIENTIFIC APPLICATIONS IN THE GRID
inferred← citeshttps://doi.org/10.1145/331532.331544openalex-snapshot
Querying very large multi-dimensional datasets in ADR
inferred← citeshttps://doi.org/10.1287/ijoc.13.1.2.9746openalex-snapshot
Cascade Graphs: Design, Analysis and Algorithms for Relational Joins
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.