On the public citation graph
Efficient local search far DAG scheduling
0 signed · 65 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.1007/3-540-58325-4_176openalex-snapshot
Average time complexity of the SAT 1.2 algorithm
inferredcites →https://doi.org/10.1016/0743-7315(90)90042-nopenalex-snapshot
Scheduling parallel program tasks onto arbitrary target machines
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/21.135698openalex-snapshot
Fast search algorithms for the n-queens problem
inferredcites →https://doi.org/10.1109/21.247892openalex-snapshot
Local search for satisfiability (SAT) problem
inferredcites →https://doi.org/10.1109/43.256919openalex-snapshot
Microword length minimization in microprogrammed controller synthesis
inferredcites →https://doi.org/10.1109/52.1991openalex-snapshot
Grain size determination for parallel processing
inferredcites →https://doi.org/10.1109/69.317698openalex-snapshot
Efficient local search with conflict minimization: a case study of the n-queens problem
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.308533openalex-snapshot
DSC: scheduling parallel tasks on an unbounded number of processors
inferredcites →https://doi.org/10.1109/71.752781openalex-snapshot
FASTEST: a practical low-complexity algorithm for compile-time assignment of parallel programs 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/icpp.1994.19openalex-snapshot
A Comparison of Multiprocessor Scheduling Heuristics
inferredcites →https://doi.org/10.1109/icpp.1996.537394openalex-snapshot
FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors
inferredcites →https://doi.org/10.1109/superc.1992.236653openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
inferredcites →https://doi.org/10.1145/130836.130837openalex-snapshot
Efficient local search for very large-scale satisfiability problems
inferredcites →https://doi.org/10.1145/361604.361619openalex-snapshot
A comparison of list schedules for parallel processing systems
inferredcites →https://doi.org/10.1287/opre.9.6.841openalex-snapshot
Parallel Sequencing and Assembly Line Problems
inferredcites →https://doi.org/10.5555/147877.148081openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1417openalex-snapshot
Multiobjective differential evolution for scheduling workflow applications on global Grids
inferred← citeshttps://doi.org/10.1007/3-540-36265-7_6openalex-snapshot
Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_48openalex-snapshot
Compiler-Controlled Parallelism-Independent Scheduling for Parallel and Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_17openalex-snapshot
A DAG-Based XCIGS Algorithm for Dependent Tasks in Grid Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-30207-0_18openalex-snapshot
Adaptive Grid Workflow Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/s10723-007-9083-7openalex-snapshot
Modeling and Supporting Grid Scheduling
inferred← citeshttps://doi.org/10.1007/s10723-015-9327-xopenalex-snapshot
Energy-Aware Scheduling for Precedence-Constrained Parallel Virtual Machines in Virtualized Data Centers
inferred← citeshttps://doi.org/10.1007/s11704-013-2130-6openalex-snapshot
Task assignment for minimizing application completion time using honeybee mating optimization
inferred← citeshttps://doi.org/10.1049/ip-cdt:20050196openalex-snapshot
Ant colony optimisation for task matching and scheduling
inferred← citeshttps://doi.org/10.1080/02533839.2008.9671467openalex-snapshot
Applying an improved fast ant system to DAG scheduling for computational grids
inferred← citeshttps://doi.org/10.1109/ccgrid49817.2020.00-92openalex-snapshot
A Pattern-Based API for Mapping Applications to a Hierarchy of Multi-Core Devices
inferred← citeshttps://doi.org/10.1109/cec.2005.1554931openalex-snapshot
Hybrid Evolutionary Static Scheduling for Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/dsd.2003.1231906openalex-snapshot
A constructive algorithm with look-ahead for mapping and scheduling of task graphs with conditional edges
inferred← citeshttps://doi.org/10.1109/dsd.2013.111openalex-snapshot
Fast Multiprocessor Scheduling with Fixed Task Binding of Large Scale Industrial Cyber Physical Systems
inferred← citeshttps://doi.org/10.1109/hpcc.2010.62openalex-snapshot
An Effective Scheduling Method for More Reliable Execution on Desktop Grids
inferred← citeshttps://doi.org/10.1109/icca.2007.4376361openalex-snapshot
A Novel Task Scheduling Algorithm for Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/iccct.2010.5640450openalex-snapshot
An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme
inferred← citeshttps://doi.org/10.1109/icess.2008.29openalex-snapshot
Research of Optimal Task Scheduling for Distributed Real-time Embedded Systems
inferred← citeshttps://doi.org/10.1109/icpp.2005.15openalex-snapshot
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
inferred← citeshttps://doi.org/10.1109/icpp.2005.66openalex-snapshot
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1109/icscse.2017.54openalex-snapshot
Retracted: Research and Design of Task Scheduling Method Based on Grid Computing
inferred← citeshttps://doi.org/10.1109/icws.2016.56openalex-snapshot
An Optimal Engine Component Placement Strategy for Cloud Workflow Service
inferred← citeshttps://doi.org/10.1109/ifita.2009.114openalex-snapshot
The New Algorithm Based on Grid Service Exception Handling
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213079openalex-snapshot
Task clustering and scheduling to multiprocessors with duplication
inferred← citeshttps://doi.org/10.1109/isdpe.2007.129openalex-snapshot
Mining Process Models from Event Logs in Distributed Bioinformatics Workflows
inferred← citeshttps://doi.org/10.1109/isdpe.2007.17openalex-snapshot
The Improvement of a Task Scheduling Algorithm in Grid Computing
inferred← citeshttps://doi.org/10.1109/services.2011.54openalex-snapshot
Analyzing Execution Dynamics of Scientific Workflows for Latency Minimization in Resource Sharing Environments
inferred← citeshttps://doi.org/10.1109/tencon.2004.1414557openalex-snapshot
Multiprocessor scheduling algorithm for tasks with precedence relation
inferred← citeshttps://doi.org/10.1109/tpds.2003.1206502openalex-snapshot
An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems
inferred← citeshttps://doi.org/10.1109/tpds.2007.1106openalex-snapshot
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
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.2013.272openalex-snapshot
Task-Tree Based Large-Scale Mosaicking for Massive Remote Sensed Imageries with Dynamic DAG Scheduling
inferred← citeshttps://doi.org/10.1142/s012962641650002xopenalex-snapshot
A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search
inferred← citeshttps://doi.org/10.1145/3626203.3670606openalex-snapshot
Towards Cross-Facility Workflows Orchestration through Distributed Automation
inferred← citeshttps://doi.org/10.1177/10943420211051039openalex-snapshot
An analytical performance model of generalized hierarchical scheduling
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1088openalex-snapshot
Optimal Scheme for Search State Space and Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.3390/en14123473openalex-snapshot
Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems
inferred← citeshttps://doi.org/10.4208/jics.v6.n2.p83openalex-snapshot
An Extension of Edge Zeroing Heuristic for Scheduling Precedence Constrained Task Graphs
inferred← citeshttps://doi.org/10.4236/ijcns.2011.44027openalex-snapshot
An Improved Task Scheduling Algorithm in Grid Computing Environment
inferred← citeshttps://doi.org/10.48550/arxiv.1203.2704openalex-snapshot
A model and framework for reliable build systems
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4274openalex-snapshot
Performance prediction and race detection in message-passing parallel applications
inferred← citeshttps://doi.org/10.5121/ijcsit.2012.4111openalex-snapshot
Integrated Task Clustering, Mapping and Scheduling for Heterogeneous Computing Systems
inferred← citeshttps://doi.org/10.70675/7dd0a7f5z0815z4b21z9eabz0ea7c9131b93openalex-snapshot
A methodology to develop high performance applications on GPGPU architectures : application to simulation of electrical machines
inferred← citeshttps://doi.org/10.7717/peerj-cs.1346openalex-snapshot
A task scheduling algorithm with deadline constraints for distributed clouds in smart cities
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.