On the public citation graph

Efficient processor assignment algorithms and loop transformations for executing nested parallel loops on multiprocessors

0 signed · 27 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/0010-4655(82)90016-9openalex-snapshot
Parallel computers: Architecture, programming and algorithms
inferredcites →https://doi.org/10.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1109/12.29467openalex-snapshot
Utilizing multidimensional loop parallelism on large scale parallel processor systems
inferredcites →https://doi.org/10.1109/12.55693openalex-snapshot
Dynamic processor self-scheduling for general parallel nested loops
inferredcites →https://doi.org/10.1109/tc.1984.5009336openalex-snapshot
Hardware Task/Processor Scheduling in a Polyprocessor Environment
inferredcites →https://doi.org/10.1109/tc.1987.1676923openalex-snapshot
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
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.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1145/502874.502878openalex-snapshot
Parallel processing
inferredcites →https://doi.org/10.1145/502949.502878openalex-snapshot
Parallel processing
inferredcites →https://doi.org/10.1145/76263.76338openalex-snapshot
Parallel processor balance through loop spreading

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-58049-9_18openalex-snapshot
Mapping Algorithms On Hypercube
inferred← citeshttps://doi.org/10.1016/0141-9331(92)90107-5openalex-snapshot
Design of parallel algorithms for a distributed memory hypercube
inferred← citeshttps://doi.org/10.1016/0164-1212(94)90015-9openalex-snapshot
Guidelines for choosing self-scheduling orders on multiprocessors
inferred← citeshttps://doi.org/10.1016/0167-739x(94)90033-7openalex-snapshot
Scheduling of parallel programs including dynamic loops
inferred← citeshttps://doi.org/10.1080/10637199408915404openalex-snapshot
FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗
inferred← citeshttps://doi.org/10.1109/5.503297openalex-snapshot
Parallel image processing with the block data parallel architecture
inferred← citeshttps://doi.org/10.1109/71.296318openalex-snapshot
Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory
inferred← citeshttps://doi.org/10.1109/71.494634openalex-snapshot
Valid transformations: a new class of loop transformations for high-level synthesis and pipelined scheduling applications
inferred← citeshttps://doi.org/10.1109/hicss.1993.284074openalex-snapshot
Scheduling non-uniform parallel loops on distributed memory machines
inferred← citeshttps://doi.org/10.1109/hicss.1993.284106openalex-snapshot
Finding optimum wavefront of parallel computation
inferred← citeshttps://doi.org/10.1109/icpp.1993.118openalex-snapshot
Multi-Level Communication Structure for Heirarchical Gain Aggregation
inferred← citeshttps://doi.org/10.1109/padsw.2000.884508openalex-snapshot
A new model of exploiting loop parallelization using knowledge-based techniques
inferred← citeshttps://doi.org/10.1145/181181.181349openalex-snapshot
Compiler techniques for maximizing fine-grain and coarse-grain parallelism in loops with uniform dependences
inferred← citeshttps://doi.org/10.1147/rd.445.0681openalex-snapshot
Parallel Image Processing with the Block Data Parallel Architecture
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.118.4_558openalex-snapshot
A Parallelizing Compiler for the Workstaion Cluster Environment
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.