On the public citation graph

A Task Duplication Based Scheduling Algorithm Using Partial Schedules

0 signed · 41 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.1006/jpdc.1999.1578openalex-snapshot
Benchmarking and Comparison of the Task Graph Scheduling Algorithms
inferredcites →https://doi.org/10.1109/12.817403openalex-snapshot
Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment
inferredcites →https://doi.org/10.1109/12.995454openalex-snapshot
An optimal scheduling algorithm based on task duplication
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.655248openalex-snapshot
Optimal scheduling algorithm for distributed-memory machines
inferredcites →https://doi.org/10.1109/71.722221openalex-snapshot
On exploiting task duplication in parallel program scheduling
inferredcites →https://doi.org/10.1109/71.762819openalex-snapshot
On parallelizing the multiprocessor scheduling problem
inferredcites →https://doi.org/10.1109/71.80160openalex-snapshot
Hypertool: a programming aid for message-passing systems
inferredcites →https://doi.org/10.1109/71.932715openalex-snapshot
Efficient local search far DAG scheduling
inferredcites →https://doi.org/10.1109/cahpc.2002.1180769openalex-snapshot
Cluster-based static scheduling: theory and practice
inferredcites →https://doi.org/10.1109/hicss.1998.649185openalex-snapshot
Mapping of parallel tasks to multiprocessors with duplication
inferredcites →https://doi.org/10.1109/icpp.2005.15openalex-snapshot
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
inferredcites →https://doi.org/10.1109/ipdps.2003.1213079openalex-snapshot
Task clustering and scheduling to multiprocessors with duplication
inferredcites →https://doi.org/10.1109/tpds.2002.1011417openalex-snapshot
Low-cost task scheduling for distributed-memory machines
inferredcites →https://doi.org/10.1109/tpds.2003.1206502openalex-snapshot
An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems
inferredcites →https://doi.org/10.1137/0219021openalex-snapshot
Towards an Architecture-Independent Analysis of Parallel Algorithms
inferredcites →https://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors

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-031-21753-1_17openalex-snapshot
Duplication Scheduling with Bottom-Up Top-Down Recursive Neural Network
inferred← citeshttps://doi.org/10.1007/s11227-020-03208-yopenalex-snapshot
An efficient multi-functional duplication-based scheduling framework for multiprocessor systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.12.012openalex-snapshot
Scheduling directed acyclic graphs with optimal duplication strategy on homogeneous multiprocessor systems
inferred← citeshttps://doi.org/10.1016/j.parco.2014.09.012openalex-snapshot
An adaptive and hierarchical task scheduling scheme for multi-core clusters
inferred← citeshttps://doi.org/10.1109/icoac.2010.5725352openalex-snapshot
Compaction of schedules in a force based clustering method
inferred← citeshttps://doi.org/10.1109/icpp.2008.68openalex-snapshot
A Duplication Based Algorithm for Optimizing Latency Under Throughput Constraints for Streaming Workflows
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639389openalex-snapshot
A task duplication based bottom-up scheduling algorithm for heterogeneous environments
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536516openalex-snapshot
Scheduling reconfiguration at runtime on the trips processor
inferred← citeshttps://doi.org/10.1109/isspit.2012.6621269openalex-snapshot
An enhanced scheduling algorithm using a recursive critical path approach with task duplication
inferred← citeshttps://doi.org/10.1109/isspit.2014.7300601openalex-snapshot
Energy-aware heuristics for scheduling parallel applications on high performance computing platforms
inferred← citeshttps://doi.org/10.1109/jsen.2017.2768659openalex-snapshot
Distributed Optimal On-Line Task Allocation Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/mobilecloud.2019.00018openalex-snapshot
Throughput Optimized Scheduler for Dispersed Computing Systems
inferred← citeshttps://doi.org/10.1109/mocast.2018.8376594openalex-snapshot
Joint task allocation approaches for hierarchical wireless sensor networks
inferred← citeshttps://doi.org/10.1109/pdcat.2010.75openalex-snapshot
Energy-Efficient Task Clustering Scheduling on Homogeneous Clusters
inferred← citeshttps://doi.org/10.1109/pdcat.2012.17openalex-snapshot
A Hierarchical Work-Stealing Framework for Multi-core Clusters
inferred← citeshttps://doi.org/10.1109/pdgc.2012.6449810openalex-snapshot
Level based task duplication strategy to minimize the job turnaround time
inferred← citeshttps://doi.org/10.1109/tpds.2008.260openalex-snapshot
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2011.172openalex-snapshot
An Intelligent Task Allocation Scheme for Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/ucc.2015.113openalex-snapshot
Scheduling Workflows under Authorization Control
inferred← citeshttps://doi.org/10.1109/wccct.2016.72openalex-snapshot
DyDupSA - Dynamic Task Duplication Based Scheduling Algorithm for Multiprocessor System
inferred← citeshttps://doi.org/10.1109/wcnc.2010.5506150openalex-snapshot
Latency and Energy-Consumption Optimized Task Allocation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.2316/p.2012.789-052openalex-snapshot
Energy Consumption of a Duplication based Scheduling Approach: A Case Study
inferred← citeshttps://doi.org/10.5555/1898953.1899086openalex-snapshot
A task duplication based bottom-up scheduling algorithm for heterogeneous environments
showing the first 23 of 24 · page through all 24
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.