On the public citation graph

A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems

0 signed · 32 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.1002/047134608x.w5716openalex-snapshot
Heterogeneous Distributed Computing
inferredcites →https://doi.org/10.1007/3-540-63574-2_14openalex-snapshot
Theory and practice in parallel job scheduling
inferredcites →https://doi.org/10.1016/0743-7315(92)90012-copenalex-snapshot
A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
inferredcites →https://doi.org/10.1109/71.207593openalex-snapshot
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
inferredcites →https://doi.org/10.1109/71.503776openalex-snapshot
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
inferredcites →https://doi.org/10.1109/71.80160openalex-snapshot
Hypertool: a programming aid for message-passing systems
inferredcites →https://doi.org/10.1109/71.993206openalex-snapshot
Performance-effective and low-complexity task scheduling for heterogeneous computing
inferredcites →https://doi.org/10.1109/hcw.1999.765093openalex-snapshot
A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems
inferredcites →https://doi.org/10.1109/hcw.2000.843736openalex-snapshot
A heuristic algorithm for mapping communicating tasks on heterogeneous resources
inferredcites →https://doi.org/10.1109/hcw.2000.843747openalex-snapshot
Fast and effective task scheduling in heterogeneous systems
inferredcites →https://doi.org/10.1109/icpp.1994.19openalex-snapshot
A Comparison of Multiprocessor Scheduling Heuristics
inferredcites →https://doi.org/10.1109/icpp.1994.37openalex-snapshot
A New Approach to Scheduling Parallel Programs Using Task Duplication
inferredcites →https://doi.org/10.1109/ipdps.2000.846021openalex-snapshot
S3MP: a task duplication based scalable scheduling algorithm for symmetric multiprocessors
inferredcites →https://doi.org/10.1109/ipps.1997.580873openalex-snapshot
A comparison of general approaches to multiprocessor scheduling
inferredcites →https://doi.org/10.1109/ipps.1997.580875openalex-snapshot
DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems
inferredcites →https://doi.org/10.1109/ipps.1998.669967openalex-snapshot
Benchmarking the task graph scheduling algorithms
inferredcites →https://doi.org/10.1109/ispdc.2003.1267650openalex-snapshot
A simple scheduling heuristic for heterogeneous computing environments

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11227-007-0152-2openalex-snapshot
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.future.2006.09.007openalex-snapshot
Performance effective pre-scheduling strategy for heterogeneous grid systems in the master slave paradigm
inferred← citeshttps://doi.org/10.1016/j.future.2017.07.052openalex-snapshot
Theoretical and heuristic aspects of heterogeneous system scheduling with constraints on client’s multiple I/O ports
inferred← citeshttps://doi.org/10.1016/j.parco.2005.04.002openalex-snapshot
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.simpat.2016.06.010openalex-snapshot
Efficient task scheduling based on theoretical scheduling pattern constrained on single I/O port collision avoidance
inferred← citeshttps://doi.org/10.1109/ams.2009.77openalex-snapshot
A Low-Complexity Task Scheduling Algorithm for Heterogeneous Computing Systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2008.37openalex-snapshot
CD-HIT Workflow Execution on Grids Using Replication Heuristics
inferred← citeshttps://doi.org/10.1109/icpads.2006.37openalex-snapshot
A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems
inferred← citeshttps://doi.org/10.1109/icssit55814.2023.10061152openalex-snapshot
An Improved Scheduling Algorithm for Grey Wolf Fitness Task Enrichment with Cloud
inferred← citeshttps://doi.org/10.1109/ispacs.2016.7824770openalex-snapshot
A heuristic-genetic algorithm for client web service scheduling constrained by one I/O port
inferred← citeshttps://doi.org/10.1177/0037549711406911openalex-snapshot
An effective duplication-based task-scheduling algorithm for heterogeneous systems
inferred← citeshttps://doi.org/10.26634/jit.7.1.14089openalex-snapshot
A Comparative Study On Dynamic Task Scheduling Algorithms
inferred← citeshttps://doi.org/10.5120/18737-9982openalex-snapshot
Task Scheduling Optimization in Heterogeneous Distributed Systems
inferred← citeshttps://doi.org/10.5120/ijca2015906828openalex-snapshot
A Survey of Static Scheduling Algorithm for Distributed Computing System
inferred← citeshttps://doi.org/10.5555/1898953.1899086openalex-snapshot
A task duplication based bottom-up scheduling algorithm for heterogeneous environments
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.